Convex distributed robust model predictive control for collision and obstacle avoidance

Abstract

Listen

Translate article

AbstractThe article proposes a convex distributed robust model predictive control algorithm for collision avoidance in multi‐agent systems with additive disturbances, which utilizes the concept of tube model predictive control to address the disturbances. To tackle the coupled collision avoidance constraints, each agent integrates assumed nominal position and input trajectories from its neighbors, rather than relying on actual ones. Compatibility constraints are then designed using the normal vector of the constructed separating hyperplanes for collision avoidance and the residual collision avoidance margin of the optimal solutions at the last time step to restrict deviations between assumed and actual trajectories and ensure consistency among the agents. The nonconvex collision and obstacle avoidance constraints are convexified using the concept of safe sets, transforming them into time‐varying closed polyhedral constraints while accounting for the impact of disturbances. Particularly, the residual collision avoidance margin is incorporated into the construction of safe sets for the satisfaction of coupled collision avoidance constraints. Consequently, the original collision avoidance optimal control problems can be efficiently and simultaneously solved for all agents using standard quadratic programming techniques. Under the design of local terminal constraint sets for each agent, the proposed algorithm ensures a rigorous analysis of robust constraint satisfaction for collision avoidance constraints, as well as an assessment of recursive feasibility and closed‐loop stability. The effectiveness of the algorithm is demonstrated through an illustrative example, and simulation results validate its ability to successfully achieve collision and obstacle avoidance even in the presence of disturbances.