Target attraction-based ant colony algorithm for mobile robots in rescue missions
by Xiaoyong Zhang; Jun Peng; Huosheng Hu; Kuo-Chi Lin; Jing Wang
International Journal of Modelling, Identification and Control (IJMIC), Vol. 17, No. 2, 2012

Abstract: After an earthquake, the road conditions are usually unknown and hazardous, which poses a great challenge for mobile robots to plan paths and reach the goal position safely for rescue operations. This paper presents a target attraction-based ant colony (TAAC) algorithm for the dynamic path planning of mobile robots operated in rescue missions. The global information of the road map is deployed to establish a target attraction function so that the probability of selecting an optimal path to the goal node is improved and the probability of converging to a local minimum path is reduced. Simulation results show that the proposed TAAC algorithm has a better dynamic performance and a faster convergence speed, compared with the existing max-min ant system algorithm.

Online publication date: Wed, 17-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com