1 March 1991 Path planning algorithm for a mobile robot*
Author Affiliations +
The task of path planning in mapped environments is well-known in robotics. Given an object and a set of obstacles located in space, the problem is to find a shortest path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. In this paper, we will present a path planning algorithm to solve the find-path problem. The advantages of this algorithm are that it is quite fast and it finds the shortest path which avoids obstacles generously rather than avoiding them barely.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kuo-Chin Fan, Kuo-Chin Fan, Po-Chang Lui, Po-Chang Lui, } "Path planning algorithm for a mobile robot*", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); doi: 10.1117/12.45454; https://doi.org/10.1117/12.45454


Hierarchical Path Planning In Complex Domains
Proceedings of SPIE (May 11 1987)
Robust mobility in human-populated environments
Proceedings of SPIE (May 25 2012)
3D Path Planning for Flying/Crawling Robots
Proceedings of SPIE (March 01 1990)
A Heuristic Route Planner For Autonomous Robots
Proceedings of SPIE (January 17 1985)
Algorithmic approaches to optimal route planning
Proceedings of SPIE (March 01 1991)

Back to Top