Robot path planning: Complexity, flexibility and application scope

ACM International Conference Proceeding Series

Volumn 213, Issue , 2006, Pages 3-14

  Jarvis, Ray ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

complexity analysis; configuration space; path planning

Indexed keywords

APPLICATION DOMAINS; COMPLEXITY ANALYSIS; CONFIGURATION SPACE; ENVIRONMENTAL MAPPING; MOBILE ROBOT NAVIGATION; PATH-PLANNING; POSE DETERMINATION; ROBOT PATH-PLANNING; WORKING ENVIRONMENT;

MOBILE ROBOTS; WAVE FUNCTIONS;

ROBOT PROGRAMMING;

EID: 77953490711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1232425.1232430     Document Type: Conference Paper

References (19)

1. Lozano-Perez, T. and Wesley, M.A., An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles, Commun. ACM, Vol.22, No. 10 (1979) 560-570.
2. Nilsson, N.J., Problem Solving Methods in Artificial Intelligence, McGraw-Hill, (1971).
3. Jarvis, R.A. Collision-Free Trajectory Planning Using Distance Transforms, Proc. National Conference and Exhibition on Robotics, Melbourne, 20-24th Aug. 1984, also in Mechanical Engineering Transactions, Journal of the Institution of Engineers, Vol.ME10, No.3, (1985) 187-191.
4. Jarvis, R.A. On Distance Transform Based Collision-Free Path Planning for Robot Navigation in Known, Unknown and Time-Varying Environments, invited chapter for a book entitled 'Advanced Mobile Robots' edited by Professor Yuan F. Zang, World Scientific Publishing Co. Pty. Ltd. (1994) 3-31.
5. Jarvis, R.A. Collision-Free Path Planning in Time-Varying Obstacle Fields Without Perfect Prediction, Proc. '93 ICAR, International Conference on Advanced Robotics, Tokyo, Japan, (1993) 701-706.
6. LaValle, S.M., Rapidly-Exploring Random Trees: A New Tool for Path Planning, Technical Report No. 98-11, Dept. of Computer Science, Iowa State University, (1998).
7. Jarvis, R.A. Polyhedra Obstacle Growing for Collision-Free Path Planning, Department of Computer Science, A.N.U., Technical Report TR-CS-81-16. Also Proc. Australian Computer Science Conference, Perth, (1982) 203-213.
8. LaValle, S.M., Kuffner, J.J. Randomized kinodynamic planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, (1999).
9. Deak, Z and Jarvis, R.A. Robotic Path Planning Using Rapidly Exploring Random Trees, Australian Conference on Robotics and Automation 2003, Brisbane 1-4 December, (2003).
10. Arya, S., Mount, D., Netanyahu, R., Silverman, R., and Wu. A. An optimal algorithm for approximate nearest neighbor searching. J. ACM, (1998) 45:891-923.
11. th Ann. European Sympos. On Algorithms, (2000) 179-190.
12. th ACM-SIAM Sympos. Discrete Algorithms, (1999) 300-309.
13. Rosenfeld, A., Pfaltz, J.L. Sequential Operations in Digital Image Processing, J.A.CM., Vol.13, No.4 (1966)471-494.
14. Marzouqi, M.S., Jarvis, R.A. Covert Robotics: Hiding in Known Environments," To appear in Proc. IEEE Conference on Robotics, Automation and Mechatronics (RAM), Singapore, (2004).
15. Marzouqi, M.S., Jarvis, R.A. Covert Path Planning in Unknown Environments with Known or Suspected Sentries Locations, submitted to The IEEE International Conference on Robotics and Automation (ICRA), Spain (2005).
16. Marzouqui, M., Jarvis, R. Covert Robotics: Covert Path Planning in Unknown Environments. In Proceedings of Australasian Conference on Robotics and Automation, 8 pages, 6-8th December 2004, Canberra, Australia (2004).
17. Marzouqi, M., Jarvis, J. Covert Robotics: Hiding in Known Environments. In proceedings from 2004 IEEE Conference on Robotics, Automation and Mechatronics, 1 st- 3rd December 2004, Traders Hotel, Singapore (2004) 804-809.
18. Marzouqi, M.S., Jarvis, R.A. Covert path planning for autonomous robot navigation in known environments, Proc. Australasian Conference on Robotics and Automation, Brisbane (2003).
19. Pavlidis, T. Structural Pattern Recognition, Springer-Verlag (1977).