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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Erickson, L., LaValle, S.: Survivability: Measuring and ensuring path diversity. In: IEEE International Conference on Robotics and Automation (2009)
Green, C., Kelly, A.: Toward optimal sampling in the space of paths. In: 13th Intl. Symposium of Robotics Research (November 2007)
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)
Knepper, R.A., Mason, M.: Empirical sampling of path sets for local area motion planning. In: International Symposium on Experimental Robotics. IFRR (July 2008)
Lau, M., Kuffner, J.J.: Behavior planning for character animation. In: 2005 ACM SIGGRAPH / Eurographics Symposium on Computer Animation, pp. 271–280 (August 2005)
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)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), http://planning.cs.uiuc.edu/
Lavalle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. Algorithmic and Computational Robotics: New Directions, 293–308 (2001)
Leven, P., Hutchinson, S.: A framework for real-time path planning in changing environments. Intl. J. Robotics Research (2002)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lau, M., Kuffner, J. (2010). Scalable Precomputed Search Trees. In: Boulic, R., Chrysanthou, Y., Komura, T. (eds) Motion in Games. MIG 2010. Lecture Notes in Computer Science, vol 6459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16958-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-16958-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16957-1
Online ISBN: 978-3-642-16958-8
eBook Packages: Computer ScienceComputer Science (R0)