On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
Authors:
- Francesco BulloFBFrancesco Bullo
- Jorge CortesJCJorge Cortes
- Emilio FrazzoliEFEmilio Frazzoli
- 12 December 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 52 (12) , 2199-2213
Abstract
This paper proposes a formal model for a network of robotic agents that move and communicate. Building on concepts from distributed computation, robotics, and control theory, we define notions of robotic network, control and communication law, coordination task, and time and communication complexity. We illustrate our model and compute the proposed complexity measures in the example of a network of locally connected agents on a circle that agree upon a direction of motion and pursue their immediate neighbors.Keywords
This publication has 24 references indexed in Scilit:
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment AlgorithmsIEEE Transactions on Automatic Control, 2007
- Transfer Time Complexity of Conflict-free Vehicle Routing with no CommunicationsThe International Journal of Robotics Research, 2007
- Convergence Rates in Distributed Consensus and Averaging2006
- Communication constraints in coordinated consensus problems2006
- A hierarchical cyclic pursuit scheme for vehicle networksAutomatica, 2005
- Sensor and actuator networks - Distributed algorithms for cooperative controlIEEE Pervasive Computing, 2004
- Hybrid I/O automataInformation and Computation, 2003
- Dynamical properties of hybrid automataIEEE Transactions on Automatic Control, 2003
- Distributed Computations by Autonomous Mobile Robots2001
- Bounds for eigenvalues of certain stochastic matricesLinear Algebra and its Applications, 1981