Computer Science – Artificial Intelligence
Scientific paper
2009-12-01
Computer Science
Artificial Intelligence
8 pages, 7 figures. Presented at the XXVIII International Conference of the Chilean Computer Society 2009
Scientific paper
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be very efficient in solving high dimensional problems. Even though several RRT variants have been proposed to tackle the dynamic replanning problem, these methods only perform well in environments with infrequent changes. This paper addresses the dynamic path planning problem by combining simple techniques in a multi-stage probabilistic algorithm. This algorithm uses RRTs as an initial solution, informed local search to fix unfeasible paths and a simple greedy optimizer. The algorithm is capable of recognizing when the local search is stuck, and subsequently restart the RRT. We show that this combination of simple techniques provides better responses to a highly dynamic environment than the dynamic RRT variants.
Araya-López Mauricio
Barriga Nicolas A.
Solar Mauricio
No associations
LandOfFree
Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-507986