Flocking with Obstacle Avoidance
- Creators
- Olfati-Saber, Reza
Abstract
In this paper, we provide a dynamic graph theoretical framework for flocking in presence of multiple obstacles. In particular, we give formal definitions of nets and flocks as spatially induced graphs. We provide models of nets and flocks and discuss the realization/embedding issues related to structural nets and flocks. This allows task representation and execution for a network of agents called alpha-agents. We also consider flocking in the presence of multiple obstacles. This task is achieved by introducing two other types of agents called beta-agents and gamma-agents. This framework enables us to address split/rejoin and squeezing maneuvers for nets/flocks of dynamic agents that communicate with each other. The problems arising from switching topology of these networks of mobile agents make the analysis and design of the decision-making protocols for such networks rather challenging. We provide simulation results that demonstrate the effectiveness of our theoretical and computational tools.
Files
Name | Size | Download all |
---|---|---|
md5:81722adf5fe89853f6a15d4f62b1a847
|
415.7 kB | Preview Download |
Additional details
- Eprint ID
- 28025
- Resolver ID
- CaltechCDSTR:2003.006
- Created
-
2003-09-08Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Control and Dynamical Systems Technical Reports