Distributed Model Predictive Control for Multi-Agent Systems: Conception and Design for Dynamic Routing Task

This paper presents a sequential distributed model predictive control (DMPC) solution for multi-robot navigation. The method targets scenarios where multiple agents must reach designated goals while avoiding collisions in a shared environ- ment. Unlike centralized MPC, which suffers from scalability and communication bottlenecks, the proposed solution decomposes the problem into local optimizations solved sequentially in a fixed cyclic order. Collision avoidance is enforced through dy- namically activated constraints, which are introduced only when predicted inter-agent distances fall below a threshold, thereby reducing conservatism while ensuring safety. The solutionis implemented in ROS 2 using the ChoiRbot library and extended to support unicycle dynamics, two-dimensional motion, and soft Manhattan distance constraints. Simulation results in Gazebo with TurtleBot3 robots demonstrate collision-free convergence in both sparse two-agent and dense four-agent intersection scenarios. These findings highlight the potential of sequential DMPC as a scalable and communication-efficient solution for safe multi-robot coordination.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-11-07
DOI
https://doi.org/10.5281/zenodo.17561147
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Model Predictive Control for Multi-Agent Systems: Conception and Design for Dynamic Routing Task

Zenodo (CERN European Organization for Nuclear Research)
Advanced Control Systems Optimization
article

Distributed Model Predictive Control for Multi-Agent Systems: Conception and Design for Dynamic Routing Task

article en

Abstract

This paper presents a sequential distributed model predictive control (DMPC) solution for multi-robot navigation. The method targets scenarios where multiple agents must reach designated goals while avoiding collisions in a shared environ- ment. Unlike centralized MPC, which suffers from scalability and communication bottlenecks, the proposed solution decomposes the problem into local optimizations solved sequentially in a fixed cyclic order. Collision avoidance is enforced through dy- namically activated constraints, which are introduced only when predicted inter-agent distances fall below a threshold, thereby reducing conservatism while ensuring safety. The solutionis implemented in ROS 2 using the ChoiRbot library and extended to support unicycle dynamics, two-dimensional motion, and soft Manhattan distance constraints. Simulation results in Gazebo with TurtleBot3 robots demonstrate collision-free convergence in both sparse two-agent and dense four-agent intersection scenarios. These findings highlight the potential of sequential DMPC as a scalable and communication-efficient solution for safe multi-robot coordination.

Zenodo (CERN European Organization for Nuclear Research)
Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau (DE)
Openalex Percentile: Top 42%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.