Multi-robot exploration using wave front algorithm
by Anshika Pal; Ritu Tiwari; Anupam Shukla
International Journal of Rapid Manufacturing (IJRAPIDM), Vol. 2, No. 4, 2011

Abstract: In this paper, an approach to multi-robot exploration where key issue is to decrease the exploration time is presented. A popular concept for the exploration problem is based on the notion of frontiers from where target points are allocated to multiple robots. Exploring an environment is then about entering into the unexplored area by moving towards the targets. To do so, they must have an optimal path planning algorithm that finds the shortest route with minimum time. Our main contributions are three fold: (1) a wave front-based path planning algorithm for robot navigations; (2) an assignment method to better distribute the robots over the environment and (3) a concept of frontiers pruning for reducing the computation burden. The proposed approach has been tested through computer simulation.

Online publication date: Wed, 18-Feb-2015

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 Rapid Manufacturing (IJRAPIDM):
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