Distributed Coordination Control for Multi-Robot Networks Using Lyapunov-Like Barrier Functions
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
This paper addresses the problem of multi-agent coordination and control under multiple objectives, and presents a set-theoretic formulation amenable to Lyapunov-based analysis and control design. A novel class of Lyapunov-like barrier functions is introduced and used to encode multiple, non-trivial control objectives, such as collision avoidance, proximity maintenance and convergence to desired destinations. The construction is based on recentered barrier functions and on maximum approximation functions. Thus, a single Lyapunov-like function is used to encode the constrained set of each agent, yielding simple, gradient-based control solutions. The derived control strategies are distributed, i.e., based on information locally available to each agent, which is dictated by sensing and communication limitations. Furthermore, the proposed coordination protocol dictates semi-cooperative conflict resolution among agents, which can be also thought as prioritization, as well as conflict resolution with respect to an agent (the leader) which is not actively participating in collision avoidance, except when necessary. The considered scenario is pertinent to surveillance tasks and involves nonholonomic vehicles. The efficacy of the approach is demonstrated through simulation results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710 · cited 1×
“Recently there has been significant interest in the deployment of robotic networks (or teams) for exploration, surveillance and patrolling of inaccessible, dangerous or even hostile (indoor and outdoor) environments, such as oil drilling platforms, nuclear reactors etc, see [16]–[22] and the references therein.”
BackgroundExact robot navigation using artificial potential functions
Rimon, E., & Koditschek, D. E. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163777 · Cited by 1,835 · cited 1×
“It is worth mentioning that the parameter δ of the Lyapunov-like function Vj essentially works in an analogous way as the tuning parameter κ of a navigation function in the Rimon-Koditschek sense [32], which implies that all undesired local minima of Vj disappear as κ increases.”
BackgroundSet-Theoretic Methods in Control
Blanchini, F., & Miani, S. (2008) · Systems & Control: Foundations & Applications · doi:10.1007/978-0-8176-4606-6 · Cited by 1,497
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
Flocking of Multi-Agents With a Virtual Leader
Su, H., Wang, X., & Lin, Z. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2010897 · Cited by 933
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
Ji, M., & Egerstedt, M. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900638 · Cited by 880 · cited 1×
“Such objectives are encountered in flocking [3]–[8], and in consensus, rendezvous and/or formation control [9]–[14].”
Background
Cited by
A Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
A Review of Safe Reinforcement Learning: Methods, Theories, and Applications
Gu, S., Yang, L., Du, Y., Chen, G., Walter, F., Wang, J., & Knoll, A. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3457538 · Cited by 315
Safety-Critical Control With Input Delay in Dynamic Environment
Molnar, T. G., Kiss, A. K., Ames, A. D., & Orosz, G. (2023) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2022.3227451 · Cited by 83
Metadata
- Authors
- Panagou, D., Stipanovic, D. M., & Voulgaris, P. G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2016-03
- Volume
- 61
- Issue
- 3
- Pages
- 617-632
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2291649624
- Cited by
- 248
- References
- 25
- FWCI
- 18.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.