Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Multi-Target Visual Tracking with UAVs

Tokekar, P., Isler, V., & Franchi, A. (2014). Multi-Target Visual Tracking with UAVs. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014) (pp. 350-356). Piscataway, NJ, USA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/21.11116/0000-0001-2CCE-7 Versions-Permalink: https://hdl.handle.net/21.11116/0000-0001-2CCF-6
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:
ausblenden:
externe Referenz:
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6942986 (Verlagsversion)
Beschreibung:
-
OA-Status:

Urheber

einblenden:
ausblenden:
 Urheber:
Tokekar, P, Autor
Isler, V, Autor
Franchi, A1, Autor           
Affiliations:
1Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Analyse et d'Architecture des Systèmes (LAAS), France, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We study the problem of tracking mobile targets using a team of aerial robots. Each robot carries a camera 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 and potentially cover a larger number of targets at the expense of 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 the weighted version of a combinatorial optimization problem known as the Maximum Group Coverage (MGC) problem. A greedy algorithm yields a 1/2 approximation for the weighted MGC problem. Finally, we evaluate the algorithm and the sensing model through simulations and preliminary experiments.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2014-09
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: DOI: 10.1109/IROS.2014.6942986
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014)
Veranstaltungsort: Chicago, IL, USA
Start-/Enddatum: -

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Piscataway, NJ, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 350 - 356 Identifikator: -