Open Access
Translator Disclaimer
2014 An Improved Fast Flocking Algorithm with Obstacle Avoidance for Multiagent Dynamic Systems
Jialiang Wang, Hai Zhao, Yuanguo Bi, Shiliang Shao, Qian Liu, Xingchi Chen, Ruofan Zeng, Yu Wang, Le Ha
J. Appl. Math. 2014: 1-13 (2014). DOI: 10.1155/2014/659805

Abstract

Flocking behavior is a common phenomenon in nature, such as flocks of birds and groups of fish. In order to make the agents effectively avoid obstacles and fast form flocking towards the direction of destination point, this paper proposes a fast multiagent obstacle avoidance (FMOA) algorithm. FMOA is illustrated based on the status of whether the flocking has formed. If flocking has not formed, agents should avoid the obstacles toward the direction of target. If otherwise, these agents have reached the state of lattice and then these agents only need to avoid the obstacles and ignore the direction of target. The experimental results show that the proposed FMOA algorithm has better performance in terms of flocking path length. Furthermore, the proposed FMOA algorithm is applied to the formation flying of quad-rotor helicopters. Compared with other technologies to perform the localization of quad-rotor helicopter, this paper innovatively constructs a smart environment by deploying some wireless sensor network (WSN) nodes using the proposed localization algorithm. Finally, the proposed FMOA algorithm is used to conduct the formation flying of these quad-rotor helicopters in the smart environment.

Citation

Download Citation

Jialiang Wang. Hai Zhao. Yuanguo Bi. Shiliang Shao. Qian Liu. Xingchi Chen. Ruofan Zeng. Yu Wang. Le Ha. "An Improved Fast Flocking Algorithm with Obstacle Avoidance for Multiagent Dynamic Systems." J. Appl. Math. 2014 1 - 13, 2014. https://doi.org/10.1155/2014/659805

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131773
Digital Object Identifier: 10.1155/2014/659805

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
13 PAGES


SHARE
Vol.2014 • 2014
Back to Top