Ray Jarvis
ABSTRACT
The three essential requirements of sensor based robotic arm manipulation and mobile robot navigation are localization (position and pose determination), environmental mapping (forming a model of the working environment) and trajectory (for manipulators) or path (for mobile robots) planning. This paper concerns the last of these and compares a number of approaches with regard to complexity, flexibility and application scope. Knowledge about these aspects is crucial in choosing an effective strategy for particular application domains.
- 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.]] Google Scholar
Digital Library
- Nilsson, N. J., Problem Solving Methods in Artificial Intelligence, McGraw-Hill, (1971).]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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).]]Google Scholar
- 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.]]Google Scholar
- LaValle, S. M., Kuffner, J. J. Randomized kinodynamic planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, (1999).]]Google ScholarCross Ref
- 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).]]Google Scholar
- 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.]] Google ScholarDigital Library
- Dickerson, M., Duncan, C., Goodrich, M. K-D trees are better when cut on the longest side. In Proc. 8th Ann. European Sympos. On Algorithms, (2000) 179--190.]] Google ScholarDigital Library
- Duncan, C., Goodrich, M., Kobourov, S. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, (1999) 300--309.]] Google ScholarDigital Library
- Rosenfeld, A., Pfaltz, J. L. Sequential Operations in Digital Image Processing, J.A.C.M., Vol.13, No.4 (1966) 471--494.]] Google ScholarDigital Library
- 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).]]Google Scholar
- 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).]]Google Scholar
- 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).]]Google Scholar
- Marzouqi, M., Jarvis, J. Covert Robotics: Hiding in Known Environments. In proceedings from 2004 IEEE Conference on Robotics, Automation and Mechatronics, 1st- 3rd December 2004, Traders Hotel, Singapore (2004) 804--809.]]Google Scholar
- 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).]]Google Scholar
- Pavlidis, T. Structural Pattern Recognition, Springer-Verlag (1977).]]Google Scholar
Index Terms
- Robot path planning: complexity, flexibility and application scope
Recommendations
A novel collaborative path planning algorithm for 3-wheel omnidirectional Autonomous Mobile Robot
AbstractCollaboration of multiple mobile robots becomes important in situations where collaborative tasks are required. For this purpose, a method including obstacle detection based on collaborative path planning of multiple Autonomous Mobile Robots (...
Graphical abstractDisplay Omitted
Highlights- The most efficient collision-free trajectory planning for collaborative mobile robots.
- Path planning and obstacle avoidance algorithm at the safe following distance.
- Path planning of collaborative autonomous omnidirectional mobile ...
Vision Aided Path Planning for Mobile Robot
ICCCE '14: Proceedings of the 2014 International Conference on Computer and Communication EngineeringPath planning is very important for autonomous mobile robots to navigate from the beginning to the ending position. Vision aided path planning for mobile robot system is discussed in this paper. The paper reveals the accounts from a historical overview ...
On-line Planning for Collision Avoidance on the Nominal Path
In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles ...
Comments