A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning

Details A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning

2009-12-01

arxiv.org/abs/0912.0224v1

Computer Science

Artificial Intelligence

7 pages, 5 figures. Presented in Ingelectra 2009 conference

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 efficient in solving high dimensional problems. Even though several RRT variants have been proposed for dynamic replanning, 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 for initial planning and informed local search for navigation. We show that this combination of simple techniques provides better responses to highly dynamic environments than the RRT extensions.

Affiliated with

Also associated with

No associations

Rating

A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning 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 A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507903