Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance

• URL: http://arxiv.org/abs/2605.10738v1
• Date: Mon, 11 May 2026 15:40:36 GMT
• Title: Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance
• Abstract summary: This paper develops a decentralized contingency MPC framework for multi-agent systems with nonlinear dynamics.<n>Under a state-only information pattern, each agent follows the same consensual rule set, enabling safe decentralized planning without communication.<n> Simulation results demonstrate performance in both sparse and dense multi-agent environments.
• Score: 1.5856188608650232
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Decentralized collision avoidance remains challenging, particularly when agents do not communicate any information related to planned trajectories. Most existing approaches either rely on conservative coordination mechanisms or provide limited guarantees on recursive feasibility and convergence. This paper develops a decentralized contingency MPC framework for multi-agent systems with nonlinear dynamics that achieves collision-free motion under a state-only information pattern. Each agent follows the same consensual rule set, enabling safe decentralized planning without communication. Each agent solves a local optimization problem that couples a nominal trajectory with a contingency certificate ensuring a feasible backup maneuver under receding-horizon operation. A novel geometric and decentralized safe-set update mechanism prevents feasibility loss between consecutive time steps. The resulting scheme guarantees recursive feasibility, including collision avoidance, and establishes a Lyapunov-type convergence result to an admissible safe equilibrium. Simulation results demonstrate performance in both sparse and dense multi-agent environments, including cluttered bottleneck scenarios and under plug-and-play operation.

Related papers

• Learning Communication-Conditioned Generative Policies for Decentralized Multi-Agent Collision Avoidance [2.7429630700600893]
  We propose a decentralized communication-conditioned generative framework for multi-agent collision avoidance.<n>Agents generate short-horizon action sequences using a flow-matching policy trained from privileged offline demonstrations.<n>The proposed approach enables efficient single-step inference of short-horizon action sequences and degrades gracefully under communication dropouts.
  arXiv  Detail & Related papers  (2026-09-13T04:04:01Z)
• Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems [1.5856188608650232]
  Decentralized contingency MPC is considered for multi-agent control under a state-only information pattern.<n>The framework relies on agent-wise fallback regions (safe sets) in which a feasible contingency maneuver to a safe equilibrium is always available.<n>A novel safe-set update mechanism is introduced that supports less conservative decentralized interaction while preserving the underlying guarantees.
  arXiv  Detail & Related papers  (2026-08-31T14:33:59Z)
• Semi-Decentralized Multi-Spacecraft Collision Avoidance under Communication Constraints [22.71668728031368]
  Current spacecraft collision-avoidance operations rely on intermittent ground-station contacts, requiring operators to plan with delayed and asynchronously updated information.<n>We formulate a semi-decentralized POMDP (SDec-POMDP) where we govern information propagation directly by realistic ground-station visibility windows.<n>Results show that semi-decentralized planning recovers near-centralized maneuver quality while requiring 28.5% fewer synchronization events than continuous coordination.
  arXiv  Detail & Related papers  (2026-07-29T07:48:18Z)
• Distributed Motion Planning with Safety Guarantees for Self-Reconfiguring Robotic Boats [76.98547580312116]
  This paper proposes a hybrid framework that combines distributed Model Predictive Control (MPC) with Control Barrier Functions (CBFs)<n>To ensure safety in real time, distributed CBF-based filters are applied to enforce inter-agent avoidance.
  arXiv  Detail & Related papers  (2026-07-22T16:37:05Z)
• World Models as Adversaries: Multi-Agent Self-Play Fine-Tuning for Robust Motion Planning [60.88859946006306]
  Adversa World Modeling is a theoretically grounded multi-agent self-play fine-tuning framework.<n>In inner minimization, the planner's predictive world model is converted into a role-conditioned adversary that learns sparse, scene-adaptive attack coalitions.<n> Experiments on the nuPlan and InterPlan benchmarks demonstrate that our method generates transferable adversarial interactions.
  arXiv  Detail & Related papers  (2026-07-12T07:44:16Z)
• ReactiveBFM: Reactive Closed-Loop Motion Planning Towards Universal Humanoid Whole-Body Control [54.267632784131415]
  ReactiveBFM is a real-time-loop planning-control framework for humanoids.<n>It mitigates fatal cumulative exposure bias via a scheduled prefix sampling curriculum.<n>It demonstrates unprecedented physical agility across a vast repertoire of text-conditioned closed-loop motions.
  arXiv  Detail & Related papers  (2026-06-29T14:27:27Z)
• Branch-Stochastic Model Predictive Control for Motion Planning under Multi-Modal Uncertainty with Scenario Clustering [4.456206353869196]
  We present a novel combination of SMPC and the branching structure, enabling the planner to generate distinct trajectories for different possible intentions.<n>A novel scenario clustering is proposed to merge prediction scenarios based on high-level decision similarity, thereby ensuring real-time tractability.<n> Simulation studies in challenging highway scenarios demonstrate that the proposed method improves safety, reduces conservatism, and achieves real-time computational performance.
  arXiv  Detail & Related papers  (2026-05-21T15:15:16Z)
• Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy [51.758416625168]
  Randomized smoothing is a powerful tool for certifying robustness to adversarial perturbations.<n>We propose a framework for certification of complex, composed mechanisms.<n>We provide a principled and general framework for using composite mechanisms to certify robustness under complex threat models.
  arXiv  Detail & Related papers  (2026-05-20T22:17:29Z)
• Accelerated Spline-Based Time-Optimal Motion Planning with Continuous Safety Guarantees for Non-Differentially Flat Systems [6.862015448582809]
  State-of-the-art approaches formulate spline-based motion planning as a single Control Problem (OCP)<n>By treating separation as an independent classification problem solvable via a linear system or quadratic program, the proposed method eliminates hyperplane parameters from the OCP variables.<n> Experimental validation demonstrates that this decoupled approach reduces trajectory times up to almost 60% compared to fully-rich environments.
  arXiv  Detail & Related papers  (2026-03-25T09:53:04Z)
• Rethinking Transferable Adversarial Attacks on Point Clouds from a Compact Subspace Perspective [55.919842734983156]
  CoSA is a transferable attack framework that operates within a shared low-dimensional semantic space.<n>CoSA consistently outperforms state-of-the-art transferable attacks.
  arXiv  Detail & Related papers  (2026-01-30T15:48:11Z)
• Building a Foundational Guardrail for General Agentic Systems via Synthetic Data [76.18834864749606]
  LLM agents can plan multi-step tasks, intervening at the planning stage-before any action is executed-is often the safest way to prevent harm.<n>Existing guardrails mostly operate post-execution, which is difficult to scale and leaves little room for controllable supervision at the plan level.<n>We introduce AuraGen, a controllable engine that synthesizes benign trajectories, injects category-labeled risks with difficulty, and filters outputs via an automated reward model.
  arXiv  Detail & Related papers  (2025-10-10T18:42:32Z)
• SAFE--MA--RRT: Multi-Agent Motion Planning with Data-Driven Safety Certificates [6.77934423529734]
  This paper proposes a fully data-driven motion-planning framework for homogeneous linear multi-agent systems.<n>Each agent independently learns its closed-loop behavior from experimental data.<n>A sampling-based planner constructs a tree of such waypoints, where transitions are allowed only when adjacent ellipsoids overlap.
  arXiv  Detail & Related papers  (2025-09-04T17:34:59Z)
• Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning [56.240199425429445]
  Multi-Robot Motion Planning (MPMP) involves generating trajectories for multiple robots operating in a shared continuous workspace.<n>While discrete multi-agent finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization trajectory quality.<n>This paper tackles limitations of two approaches by introducing discrete MAPF solvers with constrained generative diffusion models.
  arXiv  Detail & Related papers  (2025-08-27T17:59:36Z)
• Collision Avoidance Verification of Multiagent Systems with Learned Policies [9.550601011551024]
  This paper presents a backward reachability-based approach for verifying the collision avoidance properties of Multi-Agent Feedback Loops (MA-NFLs) We account for many uncertainties, making it well aligned with real-world scenarios. We demonstrate the proposed algorithm can verify collision-free properties of a MA-NFL with agents trained to imitate a collision avoidance algorithm.
  arXiv  Detail & Related papers  (2024-03-05T20:36:26Z)
• SAFE-SIM: Safety-Critical Closed-Loop Traffic Simulation with Diffusion-Controllable Adversaries [94.84458417662407]
  We introduce SAFE-SIM, a controllable closed-loop safety-critical simulation framework. Our approach yields two distinct advantages: 1) generating realistic long-tail safety-critical scenarios that closely reflect real-world conditions, and 2) providing controllable adversarial behavior for more comprehensive and interactive evaluations. We validate our framework empirically using the nuScenes and nuPlan datasets across multiple planners, demonstrating improvements in both realism and controllability.
  arXiv  Detail & Related papers  (2023-12-31T04:14:43Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Improper Learning with Gradient-based Policy Optimization [62.50997487685586]
  We consider an improper reinforcement learning setting where the learner is given M base controllers for an unknown Markov Decision Process. We propose a gradient-based approach that operates over a class of improper mixtures of the controllers.
  arXiv  Detail & Related papers  (2021-02-16T14:53:55Z)
• Trajectory Optimization for Nonlinear Multi-Agent Systems using Decentralized Learning Model Predictive Control [5.2647625557619815]
  We present a decentralized minimum-time trajectory optimization scheme based on learning model predictive control for multi-agent systems with nonlinear decoupled dynamics and coupled state constraints. Our framework results in a decentralized controller, which requires no communication between agents over each iteration of task execution, and guarantees persistent feasibility, finite-time closed-loop convergence, and non-decreasing performance of the global system over task iterations.
  arXiv  Detail & Related papers  (2020-04-02T23:04:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.