Guiding Sampling-Based Motion Planning by Forward and Backward Discrete Search

  • Erion Plaku
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7508)


This paper shows how to effectively compute collision-free and dynamically-feasible robot motion trajectories from an initial state to a goal region by combining sampling-based motion planning over the continuous state space with forward and backward discrete search over a workspace decomposition. Backward discrete search is used to estimate the cost of reaching the goal from each workspace region. Forward discrete search provides discrete plans, i.e., sequences of neighboring regions to reach the goal starting from low-cost regions. Sampling-based motion planning uses the discrete plans as a guide to expand a tree of collision-free and dynamically-feasible motion trajectories toward the goal. The proposed approach, as shown by the experiments, offers significant computational speedups over related work in solving high-dimensional motion-planning problems with dynamics.


Motion Planning Goal Region Continuous State Space Computational Speedup Discrete Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press (2005)Google Scholar
  2. 2.
    LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)zbMATHCrossRefGoogle Scholar
  3. 3.
    LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. International Journal of Robotics Research 20(5), 378–400 (2001)CrossRefGoogle Scholar
  4. 4.
    Hsu, D., Kindel, R., Latombe, J.C., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research 21(3), 233–255 (2002)CrossRefGoogle Scholar
  5. 5.
    Tsianos, K.I., Sucan, I.A., Kavraki, L.E.: Sampling-based robot motion planning: Towards realistic applications. Computer Science Review 1, 2–11 (2007)CrossRefGoogle Scholar
  6. 6.
    Cheng, P., Frazzoli, E., LaValle, S.: Improving the performance of sampling-based motion planning with symmetry-based gap reduction. IEEE Transactions on Robotics 24(2), 488–494 (2008)CrossRefGoogle Scholar
  7. 7.
    Jaillet, L., Yershova, A., LaValle, S.M., Simeon, T.: Adaptive tuning of the sampling domain for dynamic-domain RRTs. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, Edmonton, Canada, pp. 4086–4091 (2005)Google Scholar
  8. 8.
    Jaillet, L., Cortes, J., Simeon, T.: Transition-based RRT for path planning in continuous cost spaces. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, Nice, France, pp. 2145–2150 (2008)Google Scholar
  9. 9.
    Dalibard, S., Laumond, J.P.: Control of probabilistic diffusion in motion planning. In: International Workshop on Algorithmic Foundations of Robotics, Guanajuato, Mexico, pp. 467–481 (2008)Google Scholar
  10. 10.
    Berenson, D., Srinivasa, S., Ferguson, D., Romea, A.C., Kuffner, J.: Manipulation planning with workspace goal regions. In: IEEE International Conference on Robotics and Automation, Kobe, Japan, pp. 618–624 (2009)Google Scholar
  11. 11.
    Gonzalez-Banos, H.H., Hsu, D., Latombe, J.C.: Motion planning: Recent developments. In: Autonomous Mobile Robots: Sensing, Control, Decision-Making and Applications. CRC Press (2006)Google Scholar
  12. 12.
    Plaku, E., Kavraki, L.E., Vardi, M.Y.: Motion planning with dynamics by a synergistic combination of layers of planning. IEEE Transactions on Robotics 26(3), 469–482 (2010)CrossRefGoogle Scholar
  13. 13.
    Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1-3), 21–74 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)Google Scholar
  15. 15.
    Brin, S.: Near neighbor search in large metric spaces. In: International Conference on Very Large Data Bases, pp. 574–584 (1995)Google Scholar
  16. 16.
    Ladd, A.M., Kavraki, L.E.: Motion planning in the presence of drift, underactuation and discrete system changes. In: Robotics: Science and Systems, Boston, MA, pp. 233–241 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Erion Plaku
    • 1
  1. 1.Dept. of Electrical Engineering and Computer ScienceCatholic University of AmericaWashington DCUSA

Personalised recommendations