Some Thoughts on Robustness in Multi-Agent Path Finding

Abstract

Multi-agent path finding deals with finding collision free paths for a group of agents moving to given destinations. The off-line generated plan is assumed to be blindly executed on robots, which brings issues when something is not going according to the plan. This short paper discusses robustness as a way to prevent the issues with uncertainty, dynamicity, and possible involvement of other (uncontrolled) agents.