Affiliation:
1. The Polytechnic School, Arizona State University, Mesa, AZ 85281
Abstract
Abstract
Considering the application of flocking control on connected and automated vehicle (CAV) systems, the persistent interactions between CAVs (flocking agents) and road boundaries (permanent obstacles) are critical due to flocking constraints in a strictly confined environment. However, the existing flocking theories attempt to model and animate natural flocks by considering temporary obstacles, which only describe interactions between agents and obstacles that would eventually disappear during flocking. This paper proposes a novel flocking control algorithm to extend existing flocking theories and guarantee the desired flocking coordination of multi-agent systems (e.g., CAV systems) with permanent obstacles (constraints). By analyzing comprehensive behaviors of flocks via Hamiltonian functions, a zero-sum obstacle condition is developed to ensure the satisfaction of permanent obstacle avoidance. Then, an additional control term representing the resultant forces of permanent obstacles is introduced to tackle interactions between agents and permanent obstacles. Demonstrated and compared through simulation results, a CAV system steered by the proposed flocking control protocol can successfully achieve the desired flocking behaviors with permanent obstacles avoidance in a three-lane traffic environment, which is failed by existing flocking control theories solely considering temporary obstacles.
Reference23 articles.
1. A Novel Autonomous Trajectory Control for Vehicular Cyber-Physical Systems With Flocking Control Algorithms;Wang,2018
2. Fast-Convergence Flocking Control for Multi-Agent Systems with Switching Communication Topology;Wang,2020
3. A Novel Hierarchical Flocking Control Framework for Connected and Automated Vehicles;Wang;IEEE Trans. Intell. Trans. Syst.,2020
4. Recent Research in Cooperative Control of Multivehicle Systems;Murray;ASME J. Dyn. Syst. Meas. Control.,2007
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献