Flocking of Multi-Agents with Arbitrary Shape Obstacle
Flocking with obstacle avoidance of multi-agents is a significant problem.In this paper,a flocking algorithm in the presence of arbitrary shape obstacles avoidance is provided both in 2D space and 3D space.When obstacles are sensed by α- agents,β- agents which denote obstacles will guide the α- agent driving away from obstacles in a fastest route.We present an approach to determine the position and the velocity of β- agent which denote the repulsive 0effects of obstacles.Finally,simulation results show the effectiveness of our methods.
flocking obstacle avoidance arbitrary shape 2D space 3D space
DAI Bixia LI Wei
Research Institute of Electronic Science and Technology,University of Electronic Science and Technology of China,Chengdu 611731
国际会议
The 33th Chinese Control Conference第33届中国控制会议
南京
英文
1311-1316
2014-07-28(万方平台首次上网日期,不代表论文的发表时间)