The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Coordination and Geometric Optimization via Distributed Dynamical Systems
Open accessAbstract
This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from geometric optimization and characterize their differentiable properties. We design and analyze a collection of distributed control laws that are related to nonsmooth gradient systems. The resulting dynamical systems promise to be of use in coordination problems for networked robots; in this setting the distributed control laws correspond to local interactions between the robots. The technical approach relies on concepts from computational geometry, nonsmooth analysis, and the dynamical system approach to algorithms. (A correction to this article has been appended to the pdf file.)
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
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
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
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
Self-citation(1999) · Choice Reviews Online · doi:10.5860/choice.36-5109 · Cited by 2,528
Centroidal Voronoi Tessellations: Applications and Algorithms
Du, Q., Faber, V., & Gunzburger, M. (1999) · SIAM Review · doi:10.1137/s0036144599352836 · Cited by 2,244
(2000) · Wiley Series in Probability and Statistics · doi:10.1002/9780470317013 · Cited by 1,811
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Virtual leaders, artificial potentials and coordinated control of groups
Leonard, N. E., & Fiorelli, E. (2003) · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · doi:10.1109/cdc.2001.980728 · Cited by 1,262
Ogren, P., Fiorelli, E., & Leonard, N. E. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.832203 · Cited by 1,234
Modeling and control of formations of nonholonomic mobile robots
Desai, J. P., Ostrowski, J. P., & Kumar, V. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976023 · Cited by 1,158
Lyapunov stability theory of nonsmooth systems
Shevitz, D., & Paden, B. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.317122 · Cited by 1,034
Linear and nonlinear programming
Sydsæter, K., Strøm, A., & Berck, P. (1999) · Economists’ Mathematical Manual · doi:10.1007/978-3-662-03995-3_15 · Cited by 864
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997) · Springer eBooks · doi:10.1007/978-3-662-03427-9 · Cited by 800
Paden, B., & Sastry, S. (1987) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1987.1086038 · Cited by 738
Optimization and Dynamical Systems
Helmke, U., & Moore, J. B. (1994) · Communications and Control Engineering · doi:10.1007/978-1-4471-3467-1 · Cited by 724
Stable flocking of mobile agents. II. Dynamic topology
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272911 · Cited by 527
Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions
Bacciotti, A., & Ceragioli, F. (1999) · ESAIM Control Optimisation and Calculus of Variations · doi:10.1051/cocv:1999113 · Cited by 384
Stability analysis of M-dimensional asynchronous swarms with a fixed communication topology
Liu, Y., Passino, K. M., & Polycarpou, M. M. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.806657 · Cited by 259
Efficient algorithms for geometric optimization
Agarwal, P. K., & Sharir, M. (1998) · ACM Computing Surveys · doi:10.1145/299917.299918 · Cited by 257
Agreement problems in networks with directed graphs and switching topology
Saber, R. O., & Murray, R. M. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1271796 · Cited by 211
A simple algorithm for computing the smallest enclosing circle
Skyum, S. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90030-l · Cited by 96
Cited by
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
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
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
Self-citationStability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Self-citation
Metadata
- Authors
- Cortés, J., & Bullo, F.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2005-01
- Volume
- 44
- Issue
- 5
- Pages
- 1543-1574
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2007403280
- Cited by
- 452
- References
- 28
- FWCI
- 26.47
- Type
- journal article
- Language
- en
- Open access
- green
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.