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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
