Title
Pareto Optimal Multirobot Motion Planning
Abstract
This article studies a class of multirobot coordination problems where a team of robots aim to reach their goal regions with minimum time and avoid collisions with obstacles and other robots. A novel numerical algorithm is proposed to identify the Pareto optimal solutions where no robot can unilaterally reduce its traveling time without extending others’. The consistent approximation of the algori...
Year
DOI
Venue
2021
10.1109/TAC.2020.3025870
IEEE Transactions on Automatic Control
Keywords
DocType
Volume
Planning,Collision avoidance,Robot sensing systems,Pareto optimization,Robot motion,Heuristic algorithms
Journal
66
Issue
ISSN
Citations 
9
0018-9286
1
PageRank 
References 
Authors
0.38
14
2
Name
Order
Citations
PageRank
Guoxiang Zhao111.40
Minghui Zhu24412.11