MAPS-X: Explainable Multi-Robot Motion Planning via Segmentation

10/30/2020
by   Justin Kottinger, et al.
0

Traditional multi-robot motion planning (MMP) focuses on computing trajectories for multiple robots acting in an environment, such that the robots do not collide when the trajectories are taken simultaneously. In safety-critical applications, a human supervisor may want to verify that the plan is indeed collision-free. In this work, we propose a notion of explanation for a plan of MMP, based on visualization of the plan as a short sequence of images representing time segments, where in each time segment the trajectories of the agents are disjoint, clearly illustrating the safety of the plan. We show that standard notions of optimality (e.g., makespan) may create conflict with short explanations. Thus, we propose meta-algorithms, namely multi-agent plan segmenting-X (MAPS-X) and its lazy variant, that can be plugged on existing centralized sampling-based tree planners X to produce plans with good explanations using a desirable number of images. We demonstrate the efficacy of this explanation-planning scheme and extensively evaluate the performance of MAPS-X

READ FULL TEXT
research
02/20/2022

Conflict-Based Search for Explainable Multi-Agent Path Finding

In the Multi-Agent Path Finding (MAPF) problem, the goal is to find non-...
research
03/04/2022

Cooperative Task and Motion Planning for Multi-Arm Assembly Systems

Multi-robot assembly systems are becoming increasingly appealing in manu...
research
11/25/2015

Plan Explicability and Predictability for Robot Task Planning

Intelligent robots and machines are becoming pervasive in human populate...
research
03/18/2019

Motion Planning for Multi-Mobile-Manipulator Payload Transport Systems

In this paper, a kinematic motion planning algorithm for cooperative spa...
research
09/08/2014

Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots

An important capability of autonomous multi-robot systems is to prevent ...
research
09/16/2021

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...
research
01/21/2021

Centralized Collision-free Polynomial Trajectories and Goal Assignment for Aerial Swarms

Computationally tractable methods are developed for centralized goal ass...

Please sign up or login with your details

Forgot password? Click here to reset