Multi-angle pursuit of a moving target using mobile robots
by Kadioglu Urtis, Esra, Ph.D., UNIVERSITY OF MINNESOTA, 2008, 112 pages; 3313450

Abstract:

This dissertation presents a solution to the problem of determining and maintaining the visibility of a moving target by using one or more robots. Within the framework of surveillance systems and mobile sensors, our work contributes to the relatively less addressed research on visibility in the case of a moving target and moving cameras. The design goal is to attain views of a moving target from multiple angles while an unpredictable target performs a variety of motions. One or more robots follow the target and approach the target at a pre-determined distance and angle to obtain images. In this way, more informative and task specific results can be obtained from the sensors, rather than a general view that may not be always useful. Although our main motivation is to obtain visual information about a target by positioning mobile cameras at task specific locations, the method can also be used with other sensors to accomplish a wide variety of tasks such as docking, transportation, automated repairs, etc.

We present three algorithms for the solution of multi-angle view problem. The first one addresses the general solution in the case of a single-target single-pursuer (STSP) setting and with a fixed order of approach angles. We demonstrate the method by simulations and on a robot. The second algorithm improves the first one by enabling the pursuer to adaptively decide which approach angle to aim rather than following a fixed order. Performance in each case is described by the task completion time. The method is generalized for the case of multiple pursuers and a pareto optimal solution for task allocation among the robots is presented and evaluated by simulations.

An unpredictable target motion presents many challenges on the design of the pursuer motion strategies and the initial placement of the pursuers. For the STSP case, we present a mathematical analysis on the pursuer step size such that the target can always escape. For multiple pursuers, an analysis is presented on the initial placement of the pursuers and their step sizes to complete the task in a pareto optimal manner.

 
AdviserNikolaos Papanikolopoulos
SchoolUNIVERSITY OF MINNESOTA
SourceDAI/B 69-05, p. , Aug 2008
Source TypeDissertation
SubjectsRobotics; Computer science
Publication Number3313450
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3313450
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.