Multi-Target Visual Tracking with Aerial Robots
2014-06-20
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Multi-Target Visual Tracking with Aerial Robots
Authors
Published Date
2014-06-20
Publisher
Type
Report
Abstract
We study the problem of tracking mobile targets using a team of aerial robots. The robots are mounted with cameras that face downwards, and are used to detect targets moving on the ground. The overall goal is to plan for the trajectories of the robots in order to track the most number of targets, and accurately estimate the target locations using the images. The two objectives can conflict since a robot may fly to a higher altitude, thus potentially covering a larger number of targets but with lower accuracy.
We start by showing that k>= 3 robots may not be able to track all n targets while maintaining a constant factor approximation of the optimal quality of tracking at all times. Next, we study the problem of choosing robot trajectories to maximize either the number of targets tracked or the quality of tracking. We formulate this problem as a weighted, combinatorial optimization problem. A greedy algorithm yields a 1/2 approximation for this problem. Finally, we evaluate the algorithm and the sensing model through simulations and preliminary experiments.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 14-013
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Tokekar, Pratap; Franchi, Antonio. (2014). Multi-Target Visual Tracking with Aerial Robots. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215950.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.