The sensor-based random graph method for cooperative robot exploration

Franchi, A; Freda, L; Oriolo, G; Vendittelli, M

doi:10.1109/TMECH.2009.2013617

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The sensor-based random graph method for cooperative robot exploration

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4806032
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Franchi, A., Freda, L., Oriolo, G., & Vendittelli, M. (2009). The sensor-based random graph method for cooperative robot exploration. IEEE/ASME Transactions on Mechatronics, 14(2), 163-175. doi:10.1109/TMECH.2009.2013617.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-C531-2

Abstract

We present a decentralized cooperative exploration strategy for a team of mobile robots equipped with range finders. A roadmap of the explored area, with the associate safe region, is built in the form of a sensor-based random graph (SRG). This is expanded by the robots by using a randomized local planner that automatically realizes a tradeoff between information gain and navigation cost. The nodes of the SRG represent view configurations that have been visited by at least one robot, and are connected by arcs that represent safe paths. These paths have been actually traveled by the robots or added to the SRG to improve its connectivity. Decentralized cooperation and coordination mechanisms are used so as to guarantee exploration efficiency and avoid conflicts. Simulations and experiments are presented to show the performance of the proposed technique.