The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Interconnected dynamic systems: An overview on distributed control
Abstract
Control problems such as multirobot control, distributed intelligence, swarm intelligence, distributed decision, distributed cognition, congestion control in networks, collective motion in biology, oscillator synchronization in physics, parallelization in optimization theory, distributed estimation, cooperative estimation, equilibria in economics, social interaction modeling, and game theory may be analyzed under the theory of interconnected dynamic systems. Those topics have several overlapping research communities; for that reason they are characterized by different definitions and a variety of approaches ranging from rigorous mathematical analysis to trial-and-error experimental study or emulation by observation of natural phenomena. The areas involved concern robotics, dynamic systems, computer science, signal theory, biology, economics, and mathematics. A shared taxonomy is missing; for example, dynamic systems can be identified in robots, agents, nodes, processors, and entities. An ensemble is called a group, network, platoon, swarm, team, and cluster, and the algorithms are defined as controllers, protocols, and dynamics. In the following, the term agent is used to denote the single dynamic system and network or collective the ensemble.
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 Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 10×
“The second smallest eigenvalue of L, the Fiedler eigenvalue, is the algebraic connectivity; it represents a metric on the speed convergence of the consensus algorithm [16].”
BackgroundMethodInfluentialConsensus 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 · cited 3×
“Rendezvous, Consensus Consensus is the process of reaching an agreement concerning a certain quantity of interest depending on the state of all the agents [13]; a consensus algorithm is an existence of a rooted directed spanning tree but not vice versa; in other words, the property of the existence of a rooted directe…”
BackgroundCoordination 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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799 · cited 2×
“A Bioinspired Perspective: A Note on Behavioral Control The concept of behavioral control has been introduced in [59] and [60], and a detailed discussion is given by [61].”
BackgroundGraph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 3×
“An alternative approach to formation control is achieved by considering a distributed algorithm that determines a target for each agent without a priori assignment; those are then driven to the corresponding target by common path planning techniques [34], [35], [6].”
BackgroundMethodDistributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Cited by
Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
Li, Z., Wen, G., Duan, Z., & Ren, W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2350391 · Cited by 1,137
Metadata
- Venue
- IEEE Control Systems
- Published
- 2013-02
- Volume
- 33
- Issue
- 1
- Pages
- 76-88
- ISSN
- 1066-033X (ISSN-L)
- 1941-000X
- OpenAlex
- W1990993867
- Cited by
- 217
- References
- 7
- FWCI
- 27.31
- 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.