Article

Free access

Piecemeal graph exploration by a mobile robot (extended abstract)

Authors:

Baruch Awerbuch,

Margrit Betke,

Ronald L. Rivest,

Mona SinghAuthors Info & Claims

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

Pages 321 - 328

https://doi.org/10.1145/225298.225337

Published: 05 July 1995 Publication History

PDF eReader

References

[1]

Baruch Awerbuch and Robert G. Gallager. Distributed BFS algorithms. The 25th Symposvurn on Foundations of Computer,qczence, pages 250-256, October 1985.

Google Scholar

[2]

Baruch Awerbuch and Robert G. Gallager. A new distributed algorithm to find breadth first search trees. {EEE Transactwns on Information Theory, IT-33(3):315-322, 1987.

Digital Library

Google Scholar

[3]

E. Bar-Eli, P. Berman, A. Fiat, and P. Yan. On-line navigation in a roolYl. In Symposium on Discrete Algorithms, pages 237-249, 1992.

Digital Library

Google Scholar

[4]

R. Behringer and S. HStzel. Simultaneous estimation of pitch angle and lane width from the video image of a marked road. Ill IEEE/RSJ/GI International Conference on Intelligent flobols and,qysterns, September 1994.

Crossref

Google Scholar

[5]

Michael A. Bender and Donna K. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. In Proceedings of the Thirty-Fifth Annual Symposium on Foundatwns of Computer Science, pages 75-85, November 1994.

Google Scholar

[6]

Margrit Betke. Algorithms for exploring an unknown graph. Master's thesis, MIT Department of Electrical Engineering and Computer Science, February 1992. (Published as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-536, March, 1992).

Digital Library

Google Scholar

[7]

Margrit Betke and Leonid Gurvits. Mobile robot localization using landmarks. IEEE/RSJ/GI International Conference on }7~tellige~t Robots and Systems, September 1994. To appear in IEEE Transactions on Robotics and Automation.

Crossref

Google Scholar

[8]

Margrit Betke, Ronald Rivest, and Mona Singh. Piecemeal learning of an unknown environment. Machine Learnzng, 18(2/3):231-254, March 1995.

Digital Library

Google Scholar

[9]

Avrim Blum and P. Chalasani. An on-line algorithm for improving performance in navigation. In Proceedings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science, pages 2-11, November 1993.

Digital Library

Google Scholar

[10]

Avrim Blum, Prabhakar Raghavan, and Baruch Schieber. Navigating in unfamiliar geometric terra. in. In Proceedings of Twenty-Third ACM Symposium on Theory of Computing, pages 494-504. ACM, 1991.

Digital Library

Google Scholar

[11]

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introductwn to Algordhrns. MIT Press/McGraw-Hill, 1990.

Google Scholar

[12]

Xiaotie Deng, Tiko Kameda, and Christos H. Papadimitriou. How to learn an unknown environment. In Proceedings of the 32nd Symposzum on Foundatwns of Computer Science, pages 298-303. IEEE, 1991.

Digital Library

Google Scholar

[13]

Xiaotie Deng and Christos H. Papadimitriou. Exploring an unknown graph. In Proceedings of the 31st Symposium on Foundations of Computer Science, volume I, pages 355-361, 1990.

Digital Library

Google Scholar

[14]

Gregory Dudek, Michael Jenkin, Evangelos Milios, and David Wilkes. Using multiple markers in graph exploration. In SPIE Vol. 1195 Mobile Robots IV, pages 77 87, 1989.

Google Scholar

[15]

John Evans. HelpMaterM: An autonomous mobile robot courier for hospitals. In IEEE/RSJ/GI International Conference on IntelhgeT~l Robots and Systems, September {994.

Google Scholar

[16]

Rolf Klein. Walking an unknown street with bounded detour. Cornputatio,al geometry: theory and applications, 1(6):325-351, June 1992. Also published in The 32nd Symposium on Foundations of Computer Science, 1991.

Digital Library

Google Scholar

[17]

Jon IX{. Kteinberg. The localization problem for mobile robots. In Proceedings of the ThirIy-Flfih A~nual Symposium on Foundations of Cornp~tter Science, pages 521-531, May 1994.

Google Scholar

[18]

C. Y. Lee. An algorithm for path connection and its applications. IRE Transactwns o77 Electronic Computers, EC-10(3):346 365, 1961.

Crossref

Google Scholar

[19]

Edward F. Moore. The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pages 285-292 Harvard University Press, 1959.

Google Scholar

[20]

Christos H. Papadimitriou and Mihalis Yanakakis. Shortest paths without a map. Theoretical CornputerSczence, 84:127 150, 1991.

Digital Library

Google Scholar

[21]

Nagewara S. V. Rao, Srikumar Kareti, Weimin Shi, and S. Sitharama Iyengar. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, .July 1993.

Crossref

Google Scholar

[22]

Ronald L. Rivest and Robert E. Sehapire. Inference of finite automata using homing sequences. Information a~d Computaiw~, 103(2):299-347, April 1993.

Digital Library

Google Scholar

Cited By

View all

Chand PKumar MMolla A(2024)Agent-Driven BFS Tree in Anonymous Graphs with ApplicationsNetworked Systems10.1007/978-3-031-67321-4_4(67-82)Online publication date: 25-Aug-2024
https://doi.org/10.1007/978-3-031-67321-4_4
Miller APelc AHalldórsson MDolev S(2014)Time versus cost tradeoffs for deterministic rendezvous in networksProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611473(282-290)Online publication date: 15-Jul-2014
https://dl.acm.org/doi/10.1145/2611462.2611473
Dieudonné YPelc A(2014)Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic ReportsACM Transactions on Algorithms10.1145/259458111:2(1-29)Online publication date: 30-Oct-2014
https://dl.acm.org/doi/10.1145/2594581
Show More Cited By

Index Terms

Recommendations

Piecemeal Graph Exploration by a Mobile Robot

We study how a mobile robot can learn an unknown environment in a piecemeal manner. The robot's goal is to learn a complete map of its environment, while satisfying the constraint that it must return every so often to its starting position (for ...
Image-based exploration obstacle avoidance for mobile robot
CCDC'09: Proceedings of the 21st annual international conference on Chinese control and decision conference

Obstacle avoidance is a key component of autonomous systems. In particular, when dealing with large robots in unmodified environments, robust obstacle avoidance is vital. This paper presents a new image-based exploration algorithm for a mobile robot ...
A transformable wheel-legged mobile robot

This paper proposes a new type of transformable wheel-legged mobile robot that could be applied on both flat and rugged terrains. It integrates stability and maneuverability of wheeled robot and obstacle climbing capability of legged robot by means of a ...

Comments

Information & Contributors

Information

Published In

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

July 1995

464 pages

ISBN:0897917235

DOI:10.1145/225298

Chairman:
Wolfgang Maass
Technische Univ. Graz, Graz, Austria

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

8COLT95

Sponsor:

SIGAI
University of California
SIGACT

8COLT95: 8th Annual Conference on Computational Learning Theory

July 5 - 8, 1995

California, Santa Cruz, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
211
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)5

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chand PKumar MMolla A(2024)Agent-Driven BFS Tree in Anonymous Graphs with ApplicationsNetworked Systems10.1007/978-3-031-67321-4_4(67-82)Online publication date: 25-Aug-2024
https://doi.org/10.1007/978-3-031-67321-4_4
Miller APelc AHalldórsson MDolev S(2014)Time versus cost tradeoffs for deterministic rendezvous in networksProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611473(282-290)Online publication date: 15-Jul-2014
https://dl.acm.org/doi/10.1145/2611462.2611473
Dieudonné YPelc A(2014)Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic ReportsACM Transactions on Algorithms10.1145/259458111:2(1-29)Online publication date: 30-Oct-2014
https://dl.acm.org/doi/10.1145/2594581
Flocchini PIlcinkas DPelc ASantoro N(2013)Computing Without CommunicatingAlgorithmica10.1007/s00453-011-9611-565:3(562-583)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s00453-011-9611-5
Dieudonné YPelc A(2012)Deterministic network exploration by a single agent with Byzantine tokensInformation Processing Letters10.1016/j.ipl.2012.03.017112:12(467-470)Online publication date: 1-Jun-2012
https://dl.acm.org/doi/10.1016/j.ipl.2012.03.017
Dieudonné YPelc A(2012)Deterministic network exploration by anonymous silent agents with local traffic reportsProceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-31585-5_45(500-512)Online publication date: 9-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31585-5_45
Ambühl CGąsieniec LPelc ARadzik TZhang X(2011)Tree exploration with logarithmic memoryACM Transactions on Algorithms10.1145/1921659.19216637:2(1-21)Online publication date: 31-Mar-2011
https://dl.acm.org/doi/10.1145/1921659.1921663
Cabrera-Mora FJizhong Xiao Brass P(2010)Multi-robot flooding algorithm for the exploration of unknown indoor environments2010 IEEE International Conference on Robotics and Automation10.1109/ROBOT.2010.5509522(5478-5483)Online publication date: May-2010
https://doi.org/10.1109/ROBOT.2010.5509522
Flocchini PIlcinkas DPelc ASantoro N(2010)Remembering without memoryTheoretical Computer Science10.1016/j.tcs.2010.01.007411:14-15(1583-1598)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.01.007
Brass PGasparri ACabrera-Mora FXiao J(2009)Multi-robot tree and graph explorationProceedings of the 2009 IEEE international conference on Robotics and Automation10.5555/1703435.1703516(495-500)Online publication date: 12-May-2009
https://dl.acm.org/doi/10.5555/1703435.1703516
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations