Journal of Northeastern University Natural Science ›› 2014, Vol. 35 ›› Issue (3): 347-350.DOI: 10.12068/j.issn.1005-3026.2014.03.010

• Information & Control • Previous Articles     Next Articles

A Multiagent Flocking Oriented Obstacle Avoidance Algorithm

ZHAO Hai, LIU Qian, SHAO Shiliang, LI Dazhou   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2013-06-17 Revised:2013-06-17 Online:2014-03-15 Published:2013-11-22
  • Contact: LIU Qian
  • About author:-
  • Supported by:
    -

Abstract: The problem of obstacle avoidance is important in multiagent flocking. Each agent should avoid obstacles safely, and then moves toward the target. Based on the existing artificial potential field flocking algorithm, an improved algorithm with obstacle avoidance capability was presented. In this algorithm, the obstacle was equivalent to a virtual agent for obstacle avoidance. Obstacle avoidance were not taken immediately when the agent perceived obstacles, but take the speed direction of the agent and the target point into consideration. According to different speed directions and position of the target, different obstacle avoidance measures will be taken. Through theoretical analysis and experimental verification, obstacles could be avoided efficiently based on the proposed algorithm, which can make the flocking faster.

Key words: multiagent, flocking, potential function, obstacle avoidance, tangent

CLC Number: