DeepAI AI Chat
Log In Sign Up

Pareto optimal multi-robot motion planning

by   Guoxiang Zhao, et al.
Penn State University

This paper studies a class of multi-robot 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 algorithm is guaranteed using set-valued numerical analysis. Simulations show the anytime property and increasing optimality of the proposed algorithm.


page 1

page 2

page 3

page 4


Multi-robot motion planning of k-colored discs is PSPACE-hard

In the problem of multi-robot motion planning, a group of robots, placed...

Back to the Future: Efficient, Time-Consistent Solutions in Reach-Avoid Games

We study the class of reach-avoid dynamic games in which multiple agents...

SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning

This work studies the labeled multi-robot path and motion planning probl...

Robots That Do Not Avoid Obstacles

The motion planning problem is a fundamental problem in robotics, so tha...

Efficient Algorithms for Optimal Perimeter Guarding

We investigate the problem of optimally assigning a large number of robo...

Shadoks Approach to Low-Makespan Coordinated Motion Planning

This paper describes the heuristics used by the Shadoks team for the CG:...

Improved Discrete RRT for Coordinated Multi-robot Planning

This paper addresses the problem of coordination of a fleet of mobile ro...