Deadlock Resolution and Recursive Feasibility in MPC-Based Multirobot Trajectory Generation

Online collision-free trajectory generation within a shared workspace is fundamental for most multirobot applications. However, many widely-used methods based on model predictive control (MPC) lack theoretical guarantees on the feasibility of underlying optimization. Furthermore, when applied in a distributed manner without a central coordinator, deadlocks often occur where several robots block each other indefinitely. Whereas heuristic methods such as introducing random perturbations exist, no profound analyses are given to validate these measures. Toward this end, we propose a systematic method called infinite-horizon model predictive control with deadlock resolution. The MPC is formulated as a convex optimization over the proposed modified buffered Voronoi with warning band. Based on this formulation, the condition of deadlocks is formally analyzed and proven to be analogous to a force equilibrium. A detection-resolution scheme is proposed, which can effectively detect deadlocks online before they even happen. Once detected, it utilizes an adaptive force scheme to resolve deadlocks, under which no stable deadlocks can exist under minor conditions on robots' target positions. In addition, the proposed planning algorithm ensures recursive feasibility of the underlying optimization at each replanning under both input and model constraints, is concurrent for all robots, and requires only local communication. Comprehensive simulation and experiment studies are conducted over large-scale multirobot systems. Significant improvements on success rate are reported, in comparison with other state-of-the-art methods and especially in crowded and high-speed scenarios.