Ant colony optimisation algorithm-based multi-robot exploration
by Benjie Xiao; Hongming Su; Yilu Zhao; Xiong Chen
International Journal of Modelling, Identification and Control (IJMIC), Vol. 18, No. 1, 2013

Abstract: The key problem of multi-robot exploration in unknown environment is how to appropriately select targets for the robots. In this paper, we present a new method to guide multi-robot exploration. Ant colony optimisation (ACO) is introduced to find the optimal target assignment for the robots. A new cost function is designed which takes into account distance, target position and robot density. The simulation results demonstrated that the proposed method effectively solves the problem of optimal target assignment and exploration efficiency is much increased.

Online publication date: Thu, 31-Jul-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