Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

SAGETRACK

Sign In to gain access to subscriptions and/or personal tools.
The International Journal of Robotics Research
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Web of Science (7)
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Wagner, I. A.
Right arrow Articles by Bruckstein, A. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains

Israel A. Wagner

IBM Haifa Research Laboratory, Matam, Haifa 31905, IsraelIsraelwagner{at}il.ibm.com

Michael Lindenbaum

Department of Computer Science, Technion City, Haifa 32000, Israelmic{at}cs.technion.ac.il

Alfred M. Bruckstein

Department of Computer Science, Technion City, Haifa 32000, Israelfreddy{at}cs.technion.ac.il

Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no explicit communication. We formalize the problem, prove that its off-line version is NP-hard, and show a lower bound on the length of any solution. Then a deterministic mark and cover (MAC) algorithm is described for the on-line problem using short-lived navigational markers as a means of navigation and indirect communication. The convergence of the algorithm is proved, and its cover time is shown to be the asymptotically optimal O(A/a), where A is the total area and a is the area covered by the robot in a single step. The MAC algorithm is tested against an alternative randomized probabilistic covering (PC) method, which does not rely on sensors but is still able to cover an unknown region in an expected time that depends polynomially on the dimensions of the region. Both algorithms enable cooperation of several robots to achieve faster coverage. Finally, we show that the two methods can be combined to yield a third, hybrid algorithm with a better trade-off between performance and robustness.

The International Journal of Robotics Research, Vol. 19, No. 1, 12-31 (2000)
DOI: 10.1177/02783640022066716
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?