Robot navigation with range queries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Robot navigation with range queries

Full text

Pdf (1.12 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing table of contents

Philadelphia, Pennsylvania, United States

Pages: 469 - 478

Year of Publication: 1996

ISBN:0-89791-785-5

Authors

Dana Angluin	Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT
Jeffery Westbrook	Department of Computer Science, Yale University, P.O. Box 208285, New Haven CT
Wenhong Zhu	Department of Computer Science, Yale University, P.O. Box 208285, New Haven CT

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 15, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237814.237995 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E. Bar-Eli , Piotr Berman , A. Fiat , Peiyuan Yan, On-line navigation in a room, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.237-249, September 1992, Orlando, Florida, United States
	2	Piotr Berman , Avrim Blum , Amos Fiat , Howard Karloff , Adi Rosén , Michael Saks, Randomized robot navigation algorithms, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.75-84, January 28-30, 1996, Atlanta, Georgia, United States
	3	A. Blum and P. Chalasani. An on-line algorithm for improving perfomance in navigation. In Proc. 34th FO CS, pages 2-11, 1993.
	4	Avrim Blum , Prabhakar Raghavan , Baruch Schieber, Navigating in unfamiliar geometric terrain, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.494-504, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103419]
	5	V. Lumelsky and A. Stepanov. Dynamic path planning for a mobile automaton with limited information on the environment. IEEE Trans. on Automatic Control, AC-31:1058-1063, 1986.
	6	V. Lumelsky and A. Stepanov. Path planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 2:403-430, 1987.
	7	V. Lumelsky and S. Tiwari. An algorithm for maze searching with azimuth input. In Proc. IEEE Conference on Robotics and Automation, pages 111-116, 1994.
	8	Camillo J. Taylor , David J. Kriegman, Vision-based motion planning and exploration algorithms for mobile robots, Proceedings of the workshop on Algorithmic foundations of robotics, p.69-83, May 1995, San Francisco, California, United States

CITED BY 5

	Michael A. Bender , Antonio Fernández , Dana Ron , Amit Sahai , Salil Vadhan, The power of a pebble: exploring and mapping directed graphs, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.269-278, May 24-26, 1998, Dallas, Texas, United States
	Michael A. Bender , Antonio Fernández , Dana Ron , Amit Sahai , Salil Vadhan, The power of a pebble: exploring and mapping directed graphs, Information and Computation, v.176 n.1, p.1-21, July 2002
	Amitava Datta , Subbiah Soundaralakshmi, On-line path planning in an unknown polygonal environment, Information Sciences—Informatics and Computer Science: An International Journal, v.164 n.1-4, p.89-111, 2 August 2004
	Carlos Rodríguez Lucatero , Rafael Lozano Espinosa, Application of automata learning algorithms to robot motion tracking, Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation, p.1-6, February 13-15, 2005, Salzburg, Austria
	Yoav Gabriely , Elon Rimon, Spanning-tree based coverage of continuous areas by a mobile robot, Annals of Mathematics and Artificial Intelligence, v.31 n.1-4, p.77-98, 2001