A-STC: auction-based spanning tree coverage algorithm formotion planning of cooperative robots

The multi-robot coverage motion planning (MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the “auction-based spanning tree coverage (A-STC)” algorithm. First,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Frontiers of information technology & electronic engineering 2019, Vol.20 (1), p.18-31
Hauptverfasser:	Gao, Guan-Qiang, Xin, Bin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Auctions Communications Engineering Computer Hardware Computer Science Computer Systems Organization and Communication Networks Configurations Electrical Engineering Electronics and Microelectronics Graph theory Instrumentation Motion planning Multiple robots Networks Robot dynamics Robots Trajectory analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!