Replanning: A powerful planning strategy for hard kinodynamic problems

  • Tsianos K
  • Kavraki L
  • 23


    Mendeley users who have this article in their library.
  • 9


    Citations of this article.


A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, offline sampling-based planners only work in static and known environments, suffer from unbounded memory requirements and the produced paths tend to contain a lot of unnecessary maneuvers. This paper describes an online replanning algorithm which is flexible and extensible. Our results show that using a sampling-based planner in a loop, we can guide the robot to its goal using a low dimensional navigation function. We obtain higher success rates and shorter solution paths in a series of problems using only bounded memory.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Konstantinos I. Tsianos

  • Lydia E. Kavraki

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free