Abstract
In this paper, considering the difference in social distancing among individuals, according to the extent of social distancing, a group composed of N mobile agents is divided into multiple different subgroups. Especially, from the perspective of differential game theory, the flocking problem of different subgroups can be regarded as collision avoidance between neighboring agents, or obstacle avoidance between agents and virtual static/dynamic obstacles. To explore the internal mechanism of this interesting problem, a novel flocking algorithm with multiple virtual leaders is designed. The proposed algorithm is a modified version of the traditional flocking and semi-flocking algorithms. Based on the Lyapunov stability theorem and LaSalle's invariance principle, the stability analysis of the proposed algorithm is then proven. Furthermore, considering the complex environment that swarm robots or unmanned aerial vehicles (UAVs) may face when performing military missions such as surveillance, reconnaissance, and rescue, etc., we also investigate the flocking problem of multi-agents in both virtual static and dynamic obstacles environment. Finally, three kinds of simulation results are provided to demonstrate the effectiveness of the proposed results.
Highlights
Flocking, a common phenomenon in nature, is characterized by self-organization, local interaction, and decentralization [1]–[3]
The flocking problem of different subgroups can be regarded as collision avoidance between neighboring agents, or obstacle avoidance between agents and virtual static/dynamic obstacles
Considering the complex environment that swarm robots or unmanned aerial vehicles (UAVs) may face when performing military missions such as surveillance, reconnaissance, and rescue, etc., we investigate the flocking problem of multi-agents in both virtual static and dynamic obstacles environment
Summary
Flocking (or collective behavior), a common phenomenon in nature, is characterized by self-organization, local interaction, and decentralization [1]–[3]. Chen: Flocking for Multiple Subgroups of Multi-Agents With Different Social Distancing. During the fight against COVID-19, social distancing for everyone has increased by more than 2-fold compared with that observed during the normal periods [26] It is of great theoretical and practical significance for the research on the flocking of multi-agents with different social distancing and sensing radii. The flocking problem of different subgroups can be regarded as collision avoidance between neighboring agents, or obstacle avoidance between agents and virtual static/dynamic obstacles (the virtual obstacles will be illustrated in Sections II and V) In this way, to some extent, the calculation difficulties for a single agent (or robot) can be reduced.
Sign-in/Register to view highlights & summary 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.
