Competitive Complexity of mobile Robot on Line Motion Planning Problems

Springer Tracts in Advanced Robotics

Volumn 17, Issue , 2005, Pages 155-170

  Gabriely, Yoav ^a   Rimon, Elon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE PERFORMANCE; CRITICAL PARAMETER; FUNCTIONAL RELATIONSHIP; LOWER AND UPPER BOUNDS; MOTION PLANNING PROBLEMS; ON-LINE ALGORITHMS; ON-LINE PERFORMANCE; RELATIVE PERFORMANCE;

COMPETITION; OPTIMAL SYSTEMS; OPTIMIZATION;

MOBILE ROBOTS;

EID: 84868294321     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: None     Document Type: Article

References (18)

1. R. Baeza-Yates, J. Culderson, and G. Rawline. Searching in the plane. J. of Information and Computation, 106:234-252, 1993
2. P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen, and M. Saks. Randomized robot navigation algorithms. In SODA, 75-84, 1996
3. A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM J. of Comput., 26:110-137, 1997
4. H. Choset and J. W. Burdick. Sensor based planning, part ii: Incremental construction of the generalized voronoi graph. In ICRA, 1643-1649, 1995
5. A. Datta and C. Icking. Competitive searching in a generalized street. In 10th ACM Symp. on Computational Geometry, 175-182, 1994
6. A. Datta and S. Soundaralakshmi. Motion planning in an unknown polygonal environment with bounded performance guarantee. In ICRA, 1032-1037, 1999
7. X. Deng and A. Mirzaian. Competitive robot mapping with homogeneous markers. IEEE Trans. on Robotics and Automation, 12(4):532-542, 1996
8. E. Bar Eli, P. Berman, A. Fiat, and P. Yan. Online navigation in a room. J. of Algorithms, 17(3):319-341, 1996
9. Y. Gabriely and E. Rimon. Competitive complexity of mobile robot on line problem. Tech. report, http://robots.technion.ac.il, March 2004
10. Y. Gabriely and E. Rimon. Competitive on-line coverage of grid environments by a mobile robot. Comp. Geom.: Theory and Applications (to appear).
11. F. Hoffmann, C. Icking, R. Klein, and K. Kriegel. The polygon exploration problem. SIAM J. of Computation, 2001
12. C. Icking, T. Kamphans, R. Klein, and E. Langetepe. On the competitive complexity of navigation tasks. In Sensor Based Intelligent Robots, Lecture Notes in Computer Science, volume 2238, 245-258. Springer Verlag, 2002
13. C. Icking and R. Klein. Competitive strategies for autonomous systems. In Modelling and Planning for Sensor Based Intelligent Robot Systems, 23-40. World Scientific, Singapore, 1995
14. I. Kamon, E. Rimon, and E. Rivlin. Tangentbug: A range-sensor based navigation algorithm. Int. Journal of Robotics Research, 17(9):934-953, 1998
15. V. J. Lumelsky and A. Stepanov. Path planning strategies for point automaton moving amidst unknown obstacles. Algorithmica, 2:403-430, 1987
16. B. Tovar, S. M. Lavalle, and R. Murrieta. Optimal navigation and object finding without geometric maps or localization. In ICRA, 464-470, 2003
17. I. A. Wagner, M. Lindenbaum, A. M. Bruckstein. Distributed covering by antrobots using evaporating traces. IEEE Trans. on Robotics and Aut., 15(5):918-933, 1999
18. G. Woeginger. Personal communication, Dept. of CS, University of Twente, Netherlands, Dec. 2003.