Decentralized multi-vehicle path coordination under communication constraints

Abstract

We present a mathematical programming based decentralized framework to generate time optimal velocity profiles for a group of path constrained mobile vehicle robots subject to communication connectivity constraints. Each vehicle robot starts from a fixed start point and moves towards a goal point along a fixed path so as to avoid collisions with other robots, and remain in communication connectivity with other robots. The main contribution of this paper is the discrete time decentralized Receding Horizon Mixed Integer Nonlinear Programming (RH-MINLP) formulation of the multi-vehicle path coordination problem with constraints on kinematics, dynamics, collision avoidance, and communication connectivity, and the application of state-of-the-art MINLP solution techniques. We test scenarios involving up to ten (10) robots to demonstrate (i) the effect of communication connectivity requirements on robot velocity profiles; and (ii) the dependence of the solution computation time on communication connectivity requirements.