Planning near-minimum-length collision-free paths for robots
IEEE Transactions on Systems, Man, and Cybernetics
First page number:
Last page number:
This paper describes an algorithm for the automatic generation of near-minimum-length collision-free paths for robots. Obstacles are assumed to have polygonal cross sections. This algorithm requires very small data storage. Expansion of obstacles and shrinkage of robots to a point are used to simplify the analysis of the robot collision detection problem. The robot path is considered to be composed of straight line segments. Collision detection criteria between the robot path and the obstacles are discussed. A scheme to search for near-minimum length collision-free paths is presented. This scheme has the benefit of being concise and suitable for real-time implementation, especially for robots working in cluttered environments. Examples to show the above ideas are included.
Equations; Fuzzy sets; Gas insulated transmission lines; Path planning; Robot – Kinematics; Robots – Motion – Programming; Robotics and automation; Signal detection; Signal processing; Signal processing algorithms; Testing
Applied Mathematics | Artificial Intelligence and Robotics | Computer-Aided Engineering and Design | Computer Sciences | Electrical and Computer Engineering | Mechanical Engineering | Robotics | Signal Processing
Use Find in Your Library, contact the author, or use interlibrary loan to garner a copy of the article. Publisher copyright policy allows author to archive post-print (author’s final manuscript). When post-print is available or publisher policy changes, the article will be deposited
Trabia, M.B.; , "Planning near-minimum-length collision-free paths for robots," Systems, Man and Cybernetics, IEEE Transactions on , vol.23, no.5, pp.1481-1488, Sep/Oct 1993 doi: 10.1109/21.260680 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=260680&isnumber=6588
Planning near-minimum-length collision-free paths for robots.
IEEE Transactions on Systems, Man, and Cybernetics, 23(5),