Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  On optimal cooperative patrolling

Pasqualetti, F., Franchi, A., & Bullo, F. (2010). On optimal cooperative patrolling. In 49th IEEE Conference on Decision and Control (CDC 2010) (pp. 7153-7158). Piscataway, NJ, USA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-BD36-4 Versions-Permalink: https://hdl.handle.net/21.11116/0000-0002-7E41-8
Genre: Konferenzbeitrag

Externe Referenzen

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

Urheber

einblenden:
ausblenden:
 Urheber:
Pasqualetti, F, Autor
Franchi, A1, 2, Autor           
Bullo, F, Autor
Affiliations:
1Department Human Perception, Cognition and Action, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497797              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. In both civil and military applications it is of increasing importance
to instruct a team of autonomous agents to accomplish
repetitive tasks, such as the monitoring of strategic regions
or the detection of life threatening situations. As performance
criterion for optimal patrolling we minimize the worst-case time
gap between any two visits of an environment location. We
characterize the computational complexity of the trajectory
design (patrolling) problem with respect to the environment
topology and to the number of robots to be employed in
the surveillance task. Even though the patrolling problem is
generally NP-hard, we identify particular cases that are solvable
efficiently, and we describe optimal patrolling trajectories.
Finally, we present a heuristic with performance guarantee, and
an 8-approximation algorithm to solve the NP-hard patrolling
problem.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2010-12
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: DOI: 10.1109/CDC.2010.5717873
BibTex Citekey: 6676
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 49th IEEE Conference on Decision and Control (CDC 2010)
Veranstaltungsort: Atlanta, GA, USA
Start-/Enddatum: 2010-12-15 - 2010-12-17

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 49th IEEE Conference on Decision and Control (CDC 2010)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Piscataway, NJ, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 7153 - 7158 Identifikator: ISBN: 978-1-4244-7745-6