Path Planning with a Lazy Significant Edge Algorithm (LSEA). (17th April 2013)

• Record Type: Journal Article
• Authors: Polden, Joseph; Pan, Zengxi; Larkin, Nathan; Van Duin, Stephen
• Is Part Of: International journal of advanced robotic systems. Volume 10:Number 4(2013)
• Publication Date: 2013-04-17
• Subjects: Path Planning -- Lazy Evaluation -- Probabilistic Roadmap (PRM) -- Bridge Test; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.5772/53516
• Languages: English
• ISSNs: 1729-8806

Abstract

Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet been navigated by the robot. A new method to reduce the number of samples required to navigate narrow passages is also proposed and tested. Experimental results show that the new algorithm is more efficient than the traditional path planning methodologies. It was able to generate solutions for a variety of path planning problems faster, using fewer samples to arrive at a valid solution.