Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1, 2003 | public
Report Open

Flocking with Obstacle Avoidance

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

cdstr-ros-03-006.pdf
Files (415.7 kB)
Name Size Download all
md5:81722adf5fe89853f6a15d4f62b1a847
415.7 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023