Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems

• URL: http://arxiv.org/abs/2608.30874v1
• Date: Mon, 31 Aug 2026 14:33:59 GMT
• Title: Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems
• Abstract summary: 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.
• Score: 1.5856188608650232
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper considers decentralized contingency MPC for multi-agent control under a state-only information pattern, with particular focus on limited sensing and plug-and-play operation. The objective is to retain recursive feasibility, safety, and Lyapunov-type convergence while reducing conservatism in local interaction handling. The framework relies on agent-wise fallback regions (safe sets) in which a feasible contingency maneuver to a safe equilibrium is always available. A novel safe-set update mechanism is introduced that supports less conservative decentralized interaction while preserving the underlying guarantees. This, in turn, enables memory-free local interaction and finite sensing ranges without requiring agents to reconstruct the exact neighbor geometry. The resulting scheme remains fully decentralized and preserves the shared-first-input contingency MPC structure. Theoretical guarantees and simulation results illustrate the effectiveness of the approach in dense multi-agent scenarios.

Related papers

• Decentralized Safe Multi-Agent Reinforcement Learning via Predictive Shielding [0.5461938536945722]
  We propose a decentralized framework that integrates predictive shielding with model-based finite horizon Q-learning.<n>This approach allows agents to safely adapt their pre-trained policies during deployment.
  arXiv  Detail & Related papers  (2026-09-07T15:22:16Z)
• 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)
• 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)
• Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance [1.5856188608650232]
  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.
  arXiv  Detail & Related papers  (2026-05-11T15:40:36Z)
• Mechanical Conscience: A Mathematical Framework for Dependability of Machine Intelligenc [0.0]
  This paper introduces mechanical conscience (MC), a novel concept and simplified mathematical framework.<n>MC operationalizes trajectory-level normative regulation for both single-agent and distributed intelligent systems.<n>Core theoretical properties are established: admissibility equivalence, existence of optimal regulation, and monotonic deviation reduction.
  arXiv  Detail & Related papers  (2026-05-05T15:14:02Z)
• Accelerated Online Risk-Averse Policy Evaluation in POMDPs with Theoretical Guarantees and Novel CVaR Bounds [9.269394037577177]
  This work introduces a theoretical framework for accelerating Conditional Value-at-Risk evaluation in partially observable domains.<n>We establish upper and lower bounds on the CVaR value function computable from a simplified belief-MDP.<n>We develop estimators for these bounds within a particle-belief MDP framework with probabilistic guarantees.
  arXiv  Detail & Related papers  (2026-02-26T15:01:40Z)
• MAD-PINN: A Decentralized Physics-Informed Machine Learning Framework for Safe and Optimal Multi-Agent Control [13.531665564516155]
  Co-optimizing safety and performance in large-scale multi-agent systems remains a fundamental challenge.<n>We propose MAD-PINN, a decentralized machine learning framework for solving the multi-agent state-constrained optimal control problem.<n> Experiments on multi-agent navigation tasks demonstrate that MAD-PINN achieves superior safety-performance trade-offs, maintains scalability as the number of agents grows, and consistently outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-09-28T16:31:22Z)
• Think Smart, Act SMARL! Analyzing Probabilistic Logic Shields for Multi-Agent Reinforcement Learning [3.7957452405531265]
  Shielded Multi-Agent Reinforcement Learning (SMARL) is a general framework for steering MARL towards norm-compliant outcomes.<n>Our key contributions are:.<n>a novel Probabilistic Logic Temporal Difference (PLTD) update for shielded, independent Q-learning;.<n>a probabilistic logic policy gradient method for shielded PPO with formal safety guarantees for MARL;.<n> comprehensive evaluation across symmetric and asymmetrically shielded $n$ of player game-theoretic benchmarks.
  arXiv  Detail & Related papers  (2024-11-07T16:59:32Z)
• Networked Communication for Mean-Field Games with Function Approximation and Empirical Mean-Field Estimation [59.01527054553122]
  Decentralised agents can learn equilibria in Mean-Field Games from a non-episodic run of the empirical system.<n>We introduce function approximation to the existing setting, drawing on the Munchausen Online Mirror Descent method.<n>We show theoretically that exchanging policy information helps networked agents outperform both independent and even centralised agents in function-approximation settings.
  arXiv  Detail & Related papers  (2024-08-21T13:32:46Z)
• Counterfactual Conservative Q Learning for Offline Multi-agent Reinforcement Learning [54.788422270960496]
  We propose a novel multi-agent offline RL algorithm, named CounterFactual Conservative Q-Learning (CFCQL) CFCQL calculates conservative regularization for each agent separately in a counterfactual way and then linearly combines them to realize an overall conservative value estimation. We prove that it still enjoys the underestimation property and the performance guarantee as those single agent conservative methods do, but the induced regularization and safe policy improvement bound are independent of the agent number.
  arXiv  Detail & Related papers  (2023-09-22T08:10:25Z)
• Monotonic Improvement Guarantees under Non-stationarity for Decentralized PPO [66.5384483339413]
  We present a new monotonic improvement guarantee for optimizing decentralized policies in cooperative Multi-Agent Reinforcement Learning (MARL) We show that a trust region constraint can be effectively enforced in a principled way by bounding independent ratios based on the number of agents in training.
  arXiv  Detail & Related papers  (2022-01-31T20:39:48Z)
• Scalable Multi-Agent Reinforcement Learning for Residential Load Scheduling under Data Governance [5.37556626581816]
  Multi-agent reinforcement learning (MARL) has made remarkable advances in solving cooperative residential load scheduling problems.<n> centralized training, the most common paradigm for MARL, limits large-scale deployment in communication-constrained cloud-edge environments.<n>Our proposed approach is based on actor-critic methods, where the global critic is a learned function of individual critics computed solely based on local observations of households.
  arXiv  Detail & Related papers  (2021-10-06T14:05:26Z)
• Dealing with Non-Stationarity in Multi-Agent Reinforcement Learning via Trust Region Decomposition [52.06086375833474]
  Non-stationarity is one thorny issue in multi-agent reinforcement learning. We introduce a $delta$-stationarity measurement to explicitly model the stationarity of a policy sequence. We propose a trust region decomposition network based on message passing to estimate the joint policy divergence.
  arXiv  Detail & Related papers  (2021-02-21T14:46:50Z)

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.