elib
DLR-Header
DLR-Logo -> http://www.dlr.de
DLR Portal Home | Impressum | Datenschutz | Kontakt | English
Schriftgröße: [-] Text [+]

An Asynchronous Distributed Constraint Optimization Approach to Multi-Robot Path Planning with Complex Constraints

Viseras, Alberto und Karolj, Valentina und Merino, Luis (2016) An Asynchronous Distributed Constraint Optimization Approach to Multi-Robot Path Planning with Complex Constraints. In: Proceedings of the ACM Symposium on Applied Computing. The 32nd ACM Symposium on Applied Computing, Track on Intelligent Robotics and Multi-Agent Systems (IRMAS), 3-7 April 2017, Marrakesh, Morocco. doi: 10.1145/3019612.3019708. ISBN 978-1-4503-4486-9/17/04.

[img] PDF
2MB

Kurzfassung

Multi-robot teams can play a crucial role in many applications such as exploration, or search and rescue operations. One of the most important problems within the multi-robot context is path planning. This has been shown to be particularly challenging, as the team of robots must deal with additional constraints, e.g. inter-robot collision avoidance, while searching in a much larger action space. Previous works have proposed solutions to this problem, but they present two major drawbacks: (i) algorithms suffer from a high computational complexity, or (ii) algorithms require a communication link between any two robots within the system. This paper presents a method to solve this problem, which is both computationally efficient and only requires local communication between neighboring agents. We formulate the multi-robot path planning as a distributed constraint optimization problem. Specifically, in our approach the asynchronous distributed constraint optimization algorithm (Adopt) is combined with sampling-based planners to obtain collision free paths, which allows us to take into account both kinematic and kinodynamic constraints of the individual robots. The paper analyzes the performance and scalability of the approach using simulations, and presents real experiments employing a team of several robots.

elib-URL des Eintrags:https://elib.dlr.de/118905/
Dokumentart:Konferenzbeitrag (Vortrag)
Titel:An Asynchronous Distributed Constraint Optimization Approach to Multi-Robot Path Planning with Complex Constraints
Autoren:
AutorenInstitution oder E-Mail-AdresseAutoren-ORCID-iDORCID Put Code
Viseras, Albertoalberto.viserasruiz (at) dlr.deNICHT SPEZIFIZIERTNICHT SPEZIFIZIERT
Karolj, Valentinavalentina.karolj (at) dlr.deNICHT SPEZIFIZIERTNICHT SPEZIFIZIERT
Merino, Luislmercab (at) upo.esNICHT SPEZIFIZIERTNICHT SPEZIFIZIERT
Datum:2016
Erschienen in:Proceedings of the ACM Symposium on Applied Computing
Referierte Publikation:Ja
Open Access:Ja
Gold Open Access:Nein
In SCOPUS:Ja
In ISI Web of Science:Nein
DOI:10.1145/3019612.3019708
ISBN:978-1-4503-4486-9/17/04
Status:veröffentlicht
Stichwörter:multi-robot path planning, distributed constraint optimization, sampling-based planner
Veranstaltungstitel:The 32nd ACM Symposium on Applied Computing, Track on Intelligent Robotics and Multi-Agent Systems (IRMAS)
Veranstaltungsort:Marrakesh, Morocco
Veranstaltungsart:internationale Konferenz
Veranstaltungsdatum:3-7 April 2017
HGF - Forschungsbereich:Luftfahrt, Raumfahrt und Verkehr
HGF - Programm:Verkehr
HGF - Programmthema:Verkehrsmanagement (alt)
DLR - Schwerpunkt:Verkehr
DLR - Forschungsgebiet:V VM - Verkehrsmanagement
DLR - Teilgebiet (Projekt, Vorhaben):V - Vabene++ (alt)
Standort: Oberpfaffenhofen
Institute & Einrichtungen:Institut für Kommunikation und Navigation > Nachrichtensysteme
Hinterlegt von: Viseras Ruiz, Alberto
Hinterlegt am:09 Feb 2018 13:31
Letzte Änderung:31 Jul 2019 20:16

Nur für Mitarbeiter des Archivs: Kontrollseite des Eintrags

Blättern
Suchen
Hilfe & Kontakt
Informationen
electronic library verwendet EPrints 3.3.12
Gestaltung Webseite und Datenbank: Copyright © Deutsches Zentrum für Luft- und Raumfahrt (DLR). Alle Rechte vorbehalten.