Pith. sign in

REVIEW 1 cited by

Decentralized Safe and Scalable Multi-Agent Control under Limited Actuation

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 2409.09573 v1 pith:6H2UUSPW submitted 2024-09-15 cs.RO cs.MAcs.SYeess.SY

classification cs.ROcs.MAcs.SYeess.SY
keywords controlsafetydeadlocksdecentralizedactuationagentsneuralsafe
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

To deploy safe and agile robots in cluttered environments, there is a need to develop fully decentralized controllers that guarantee safety, respect actuation limits, prevent deadlocks, and scale to thousands of agents. Current approaches fall short of meeting all these goals: optimization-based methods ensure safety but lack scalability, while learning-based methods scale but do not guarantee safety. We propose a novel algorithm to achieve safe and scalable control for multiple agents under limited actuation. Specifically, our approach includes: $(i)$ learning a decentralized neural Integral Control Barrier function (neural ICBF) for scalable, input-constrained control, $(ii)$ embedding a lightweight decentralized Model Predictive Control-based Integral Control Barrier Function (MPC-ICBF) into the neural network policy to ensure safety while maintaining scalability, and $(iii)$ introducing a novel method to minimize deadlocks based on gradient-based optimization techniques from machine learning to address local minima in deadlocks. Our numerical simulations show that this approach outperforms state-of-the-art multi-agent control algorithms in terms of safety, input constraint satisfaction, and minimizing deadlocks. Additionally, we demonstrate strong generalization across scenarios with varying agent counts, scaling up to 1000 agents.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. 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