Multi-agent coordination over local indexes via clique-based distributed assignment

DOI10.1016/j.automatica.2019.108670zbMath1430.93013OpenAlexW2985221364WikidataQ126838112 ScholiaQ126838112MaRDI QIDQ2288673

Kazunori Sakurama, Hyo-Sung Ahn

Publication date: 20 January 2020

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2019.108670

zbMATH Keywords

distributed controlmulti-agent systemsformation controlcollaborative systemscoordination assignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Decentralized systems (93A14) Multi-agent systems (93A16)

Related Items (1)

Cooperative label-free moving target fencing for second-order multi-agent systems with rigid formation

Cites Work

• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
• Optimal role and position assignment in multi-robot freely reachable formations
• A survey of multi-agent formation control
• Distributed Controllers for Multi-Agent Coordination Via Gradient-Flow Approach
• Lyapunov stability theory of nonsmooth systems
• Monotonic Target Assignment for Robotic Networks
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory

This page was built for publication: Multi-agent coordination over local indexes via clique-based distributed assignment