Advertisement

Scalable Precomputed Search Trees

  • Manfred Lau
  • James Kuffner
Conference paper
  • 1k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6459)

Abstract

The traditional A*-search method builds a search tree of potential solution paths during runtime. An alternative approach is to compute this search tree in advance, and then use it during runtime to efficiently find a solution. Recent work has shown the potential for this idea of precomputation. However, these previous methods do not scale to the memory and time needed for precomputing trees of a reasonable size. The focus of this paper is to take a given set of actions from a navigation scenario, and precompute a search tree that can scale to large planning problems. We show that this precomputation approach can be used to efficiently generate the motions for virtual human-like characters navigating in large environments such as those in games and films. We precompute a search tree incrementally and use a density metric to scatter the paths of the tree evenly among the region we want to build the tree in. We experimentally compare our algorithm with some recent methods for building trees with diversified paths. We also compare our method with traditional A*-search approaches. Our main advantage is a significantly faster runtime, and we show and describe the tradeoffs that we make to achieve this runtime speedup.

Keywords

Path Planning Search Tree Child Node Parent Node Depth Level 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Branicky, M.S., Knepper, R.A., Kuffner, J.: Path and trajectory diversity: Theory and algorithms. In: Int’l Conf. on Robotics and Automation (May 2008)Google Scholar
  2. 2.
    Chestnutt, J., Kuffner, J., Nishiwaki, K., Kagami, S.: Planning biped navigation strategies in complex environments. In: Proceedings of the 2003 Intl. Conference on Humanoid Robots (October 2003)Google Scholar
  3. 3.
    Erickson, L., LaValle, S.: Survivability: Measuring and ensuring path diversity. In: IEEE International Conference on Robotics and Automation (2009)Google Scholar
  4. 4.
    Green, C., Kelly, A.: Toward optimal sampling in the space of paths. In: 13th Intl. Symposium of Robotics Research (November 2007)Google Scholar
  5. 5.
    Kavraki, L.E., Svestka, P., Claude Latombe, J., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration space. Int’l Transactions on Robotics and Automation, 566–580 (1996)Google Scholar
  6. 6.
    Knepper, R.A., Mason, M.: Empirical sampling of path sets for local area motion planning. In: International Symposium on Experimental Robotics. IFRR (July 2008)Google Scholar
  7. 7.
    Lau, M., Kuffner, J.J.: Behavior planning for character animation. In: 2005 ACM SIGGRAPH / Eurographics Symposium on Computer Animation, pp. 271–280 (August 2005)Google Scholar
  8. 8.
    Lau, M., Kuffner, J.J.: Precomputed search trees: Planning for interactive goal-driven animation. In: 2006 ACM SIGGRAPH / Eurographics Symposium on Computer Animation, pp. 299–308 (September 2006)Google Scholar
  9. 9.
    LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), http://planning.cs.uiuc.edu/ CrossRefzbMATHGoogle Scholar
  10. 10.
    Lavalle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. Algorithmic and Computational Robotics: New Directions, 293–308 (2001)Google Scholar
  11. 11.
    Leven, P., Hutchinson, S.: A framework for real-time path planning in changing environments. Intl. J. Robotics Research (2002)Google Scholar
  12. 12.
    Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2002)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Manfred Lau
    • 1
    • 2
  • James Kuffner
    • 1
  1. 1.Carnegie Mellon UniversityUSA
  2. 2.JST ERATO Igarashi Design Interface ProjectTokyoJapan

Personalised recommendations