Pith. sign in

REVIEW 2 cited by

Decentralized Safe Multi-agent Stochastic Optimal Control using Deep FBSDEs and ADMM

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.10658 v2 pith:P4RULCSE submitted 2022-02-22 cs.MA cs.LGcs.ROcs.SYeess.SY

classification cs.MAcs.LGcs.ROcs.SYeess.SY
keywords safecontrolstochasticapproachconsensusdecentralizedmulti-agentoptimization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we propose a novel safe and scalable decentralized solution for multi-agent control in the presence of stochastic disturbances. Safety is mathematically encoded using stochastic control barrier functions and safe controls are computed by solving quadratic programs. Decentralization is achieved by augmenting to each agent's optimization variables, copy variables, for its neighbors. This allows us to decouple the centralized multi-agent optimization problem. However, to ensure safety, neighboring agents must agree on "what is safe for both of us" and this creates a need for consensus. To enable safe consensus solutions, we incorporate an ADMM-based approach. Specifically, we propose a Merged CADMM-OSQP implicit neural network layer, that solves a mini-batch of both, local quadratic programs as well as the overall consensus problem, as a single optimization problem. This layer is embedded within a Deep FBSDEs network architecture at every time step, to facilitate end-to-end differentiable, safe and decentralized stochastic optimal control. The efficacy of the proposed approach is demonstrated on several challenging multi-robot tasks in simulation. By imposing requirements on safety specified by collision avoidance constraints, the safe operation of all agents is ensured during the entire training process. We also demonstrate superior scalability in terms of computational and memory savings as compared to a centralized approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Safe and Energy-Aware Multi-Robot Density Control via PDE-Constrained Optimization for Long-Duration Autonomy

    eess.SY 2026-04 unverdicted novelty 6.0 of 10

    Presents a PDE-constrained optimization framework for safe and energy-aware multi-robot density control using Fokker-Planck equation integrated with CLF and CBF solved as a quadratic program.

  2. Discrete GCBF Proximal Policy Optimization for Multi-agent Safe Optimal Control

    cs.RO 2025-02 conditional novelty 6.0 of 10

    DGPPO learns a discrete-time graph control barrier function and a distributed policy together, achieving high safety and task performance in multi-agent simulations with unknown dynamics, partial observability, and in...

Pith tools