Modern computer graphics applications commonly feature very large virtual environments and diverse characters which perform different kinds of motions. To accelerate path planning in such a scenario, we propose the subregion graph data structure. It consists of subregions, which are clusters of locally connected waypoints inside a region, as well as subregion connectivities. We also present a fast algorithm to automatically generate a subregion graph from an enhanced waypoint graph map representation, which also supports various motion types and can be created from large virtual environments. Nevertheless, a subregion graph can be generated from any graphbased map representation. Our experiments show that a subregion graph is very compact relative to the input waypoint graph. By firstly planning a subregion path, and then limiting waypoint-level planning to this subregion path, over 8 times average speedup can be achieved, while average length ratios remain as low as 102.5%.
Grand Theft Auto III (DVD). Rockstar Games, 2001.
Just Cause II(Steam). Eidos Interactive, 2010. Available at http://store.steampowered.com/app/81901.
The Elder Scrolls V: Skyrim (Steam). Bethesda Softworks, 2011. Available at http://store.steampowered.com/app/7282501.
Plaku, E.; Kavraki, L. E. Distributed sampling-based roadmap of trees for large-scale motion planning. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 3868–3873, 2005.
Samperi, K.; Hawes, N.; Beale, R. Improving map generation in large-scale environments for intelligent virtual agents. In: The AAMAS-2013 Workshop on Cognitive Agents for Virtual Environments, 2013. Available at http://www.cs.bham.ac.uk/~nah/bibtex/papers/samperietal2013cave.pdf.
Wardhana, N. M.; Johan, H.; Seah, H. S. Enhanced waypoint graph for surface and volumetric path planning in virtual worlds. The Visual Computer Vol. 29, No. 10, 1051–1062, 2013.
Hart, P. E.; Nilsson, N. J.; Raphael, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics Vol. 4, No. 2, 100–107, 1968.
Holtë, R. C.; Mkadmi, T.; Zimmer, R. M.; MacDonald, A. J. Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence Vol. 85, Nos. 1–2, 321–361, 1996.
Sturtevant, N.; Buro, M. Partial pathfinding using map abstraction and refinement. In: Proceedings of the 20th National Conference on Artificial Intelligence, Vol. 3, 1392–1397, 2005.
Bulitko, V.; Sturtevant, N.; Lu, J.; Yau, T. Graph abstraction in real-time heuristic search. Journal of Artificial Intelligence Research Vol. 30, No. 1, 51–100, 2007.
Frederickson, G. N. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing Vol. 6, No. 6, 1004–1022, 1987.
Köhler, E.; Möhring, R. H.; Schilling, H. Acceleration of shortest path and constrained shortest path computation. Lecture Notes in Computer Science Vol. 3503, 126–138, 2005.
Wagner, D.; Willhalm, T. Geometric speedup techniques for finding shortest paths in large sparse graphs. Lecture Notes in Computer Science Vol. 2832, 776–787, 2003.
Hilger, M.; Köhler, E.; Möhring, R. H.; Schilling, H. Fast point-to-point shortest path computations with arc-flags. In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge. Demetrescu, C.; Goldberg, A. V.; Johnson, D. S. Eds. American Mathematical Society, 41–72, 2009.
Lauther, U. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilität–von der Forschung zur praktischen Anwendung, Vol. 22, 219–230, 2004.
Möhring, R. H.; Schilling, H.; Schütz, B.; Wagner, D.; Willhalm, T. Partitioning graphs to speed up Dijkstra’s algorithm. Lecture Notes in Computer Science Vol. 3503, 189–202, 2005.
Harabor, D.; Botea, A. Hierarchical path planning for multi-size agents in heterogeneous environments. In: IEEE Symposium on Computational Intelligence and Games, 258–265, 2008.
Mould, D.; Horsch, M. C. A hierarchical terrain representation for approximately shortest paths. Lecture Notes in Computer Science Vol. 3157, 104–113, 2004.
Gutman, R. J. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 100–111, 2004.
Goldberg, A. V.; Kaplan, H.; Werneck, R. F. Reach for A*: Efficient point-to-point shortest path algorithms. In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 129–143, 2006.
Sanders, P.; Schultes, D. Highway hierarchies hasten exact shortest path queries. Lecture Notes in Computer Science Vol. 3669, 568–579, 2005.
Floyd, R. W. Algorithm 97: Shortest path. Communications of the ACM Vol. 5, No. 6, 345, 1962.
Warshall, S. A theorem on boolean matrices. Journal of the ACM Vol. 9, No. 1, 11–12, 1962.
Goldberg, A. V.; Harrelson, C. Computing the shortest path: A* search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 156–165, 2005.
Felner, A.; Sturtevant, N.; Schaeffer, J. Abstractionbased heuristics with true distance computations. In: Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 74–81, 2009.
Oliva, R.; Pelechano, N. NEOGEN: Near optimal generator of navigation meshes for 3D multi-layered environments. Computers & Graphics Vol. 37, No. 5, 403–412, 2013.
Van Toll, W. G.; Cook IV, A. F.; Geraerts, R. Navigation meshes for realistic multi-layered environments. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, 3526–3532, 2011.
Dijkstra, E. W. A note on two problems in connexion with graphs. Numerische Mathematik Vol. 1, No. 1, 269–271, 1959.
Pinter, M. Toward more realistic pathfinding. 2001. Available at http://www.gamasutra.com/features/20010314/pinter_01.htm.
Siek, J.; Lee, L.-Q.; Lumsdaine, A. The Boost Graph Library (BGL) (version 1.57). 2014. Available at http://www.boost.org/libs/graph/.
The OGRE Team. OGRE—Object-oriented Graphics Rendering Engine (version 1.7.3). 2011. Available at http://www.ogre3d.org/.
Wagner, D.; Willhalm, T. Speed-up techniques for shortest-path computations. Lecture Notes in Computer Science Vol. 4393, 23–36, 2007.
Garcia, F. M.; Kapadia, M.; Badler, N. I. GPU-based dynamic search on adaptive resolution grids. In: 2014 IEEE International Conference on Robotics and Automation, 1631–1638, 2014.
This article is published with open access at Springerlink.com
Nicholas Mario Wardhana is currently a project officer in the MultiplAtform Game Innovation Centre (MAGIC), Nanyang Technological University (NTU), Singapore, as well as a doctoral student in the School of Computer Engineering, NTU. He previously received a Sarjana Teknik degree in electrical engineering from Universitas Gadjah Mada (UGM), Yogyakarta, Indonesia, in 2007. His research interests include motion planning, computer graphics, and geometric computing.
Henry Johan is a senior research fellow in Fraunhofer IDM@NTU (Singapore). Previously he was a postdoctoral fellow in the Department of Complexity Science and Engineering at the University of Tokyo (Japan). Then, he joined the School of Computer Engineering at Nanyang Technological University (Singapore) as an assistant professor. His research interests in computer graphics include rendering, animation, and shape retrieval. He received his B.S., M.S., and Ph.D. degrees in computer science from the University of Tokyo in 1999, 2001, and 2004, respectively.
Hock Soon Seah is a professor at the School of Computer Engineering (SCE) at Nanyang Technological University (NTU), Singapore. He directs the National Research Foundation MultiplAtform Game Innovation Centre (MAGIC), which is supported by the Singapore Media Development Authority, to champion efforts in research, development, education, commercialization, and impact of digital games in Singapore. He is a Fellow of the Singapore Academy of Engineering.
About this article
Cite this article
Wardhana, N.M., Johan, H. & Seah, H.S. Subregion graph: A path planning acceleration structure for characters with various motion types in very large environments. Comp. Visual Media 1, 105–118 (2015). https://doi.org/10.1007/s41095-015-0018-0
- path planning acceleration
- very large environments
- motion types