Pareto optimal multi-robot motion planning
share
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.
READ FULL TEXT