Adaptive Path Planning in a Dynamic Environment using a Receding Horizon Probabilistic Roadmap: Experimental Demonstration


  1. If dynamics and constraints are nonlinear, there is no closed-form analytical solution
  2. Gradient and potential field methods can be useful in nonlinear domains, with restricted observability, but are strongly influenced by initial search location, as nonlinear constraints can introduce many maxima/minima
    1. Gradient methods may require special differentiation because of non-smooth constraints
  3. The main idea of the paper is to use PRMs to build a global connectivity graph, which may need to have edges removed as the agent only senses obstacles nearby, so replanning is still needed as locations that were thought to be free turn out to be closed
    1. Planning is done purely in state space, then motion primitives stitch the states together.
  4. They plan in a quadratic cost function
  5. The use a helicopter domain that they provide simple dynamics equations for
  6. The motion primitives used for planning ensure the helicopter does not enter a bad state
  7. They also tested the approach on an actual helicopter
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: