Containment Control in Mobile Networks
Georgia Institute of Technology · Institut national de recherche en informatique et en automatique · +2 more institutions
Indexed incrossref
Abstract
In this paper, the problem of driving a collection of mobile robots to a given target destination is studied. In particular, we are interested in achieving this transfer in an orderly manner so as to ensure that the agents remain in the convex polytope spanned by the leader-agents, while the remaining agents, only employ local interaction rules. To this aim we exploit the theory of partial difference equations and propose hybrid control schemes based on stop-go rules for the leader-agents. Non-Zenoness, liveness and convergence of the resulting system are also analyzed.
Citation impact
801
total citations
- FWCI
- 14.87
- Percentile
- 100%
- References
- 27
Citations per year
Authors
4Topics & keywords
Topics
Keywords
- Liveness
- Mobile robot
- Exploit
- Computer science
- Convergence (economics)
- Containment (computer programming)
- Control (management)
- Distributed computing
No related works found for this paper.