Abstract
The feasibility problem is studied of achieving a specified formation among a group of autonomous unicycles by local distributed control. The directed graph defined by the information flow plays a key role. It is proved that formation stabilization to a point is feasible if and only if the sensor digraph has a globally reachable node. A similar result is given for formation stabilization to a line and to more general geometric arrangements.
Keywords
Affiliated Institutions
Related Publications
Local Control Strategies for Groups of Mobile Autonomous Agents
The problem of achieving a specified formation among a group of mobile autonomous agents by distributed control is studied. If convergence to a point is feasible, then more gene...
Graph rigidity and distributed formation stabilization of multi-vehicle systems
We provide a graph theoretical framework that allows us to formally define formations of multiple vehicles and the issues arising in uniqueness of graph realizations and its con...
Formation Control with Virtual Leaders and Reduced Communications
A feedback control law is given that can achieve a pre-specified formation for a group of mobile autonomous agents in an obstacle-free environment. This formation design uses vi...
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
Surviving Sepsis Campaign
To provide an update to the "Surviving Sepsis Campaign Guidelines for Management of Severe Sepsis and Septic Shock," last published in 2008. A consensus committee of 68 internat...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 50
- Issue
- 1
- Pages
- 121-127
- Citations
- 1034
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/tac.2004.841121