Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

A navigation mesh for dynamic environments

Published: 01 November 2012 Publication History

Abstract

Games and simulations frequently model scenarios where obstacles move, appear, and disappear in an environment. A city environment changes as new buildings and roads are constructed, and routes can become partially blocked by small obstacles many times in a typical day. This paper studies the effect of using local updates to repair only the affected regions of a navigation mesh in response to a change in the environment. The techniques are inspired by incremental methods for Voronoi diagrams. The main novelty of this paper is that we show how to maintain a 2D or 2.5D navigation mesh in an environment that contains dynamic polygonal obstacles. Experiments show that local updates are fast enough to permit real-time updates of the navigation mesh. Copyright © 2012 John Wiley & Sons, Ltd.

References

[1]
Snook G. Simplified 3d movement and pathfinding using navigation meshes, In Game Programming Gems, DeLoura M (ed), Charles River Media, 2000.
[2]
Geraerts R. Planning short paths with clearance using Explicit Corridors, IEEE International Conference on Robotics and Automation, Anchorage, Alaska, USA, 2010; 1997–2004.
[3]
Mononen M. Recast navigation, (2011). Google Project: http://code.google.com/p/recastnavigation {Accessed on Jauary 25, 2012}.
[4]
Olivia R, Pelechano N. Automatic generation of suboptimal navmeshes, In Motion in Games, vol.  7060, LNCS, 2011.
[5]
Pettré J, Laumond JP, Thalmann D. A navigation graph for real-time crowd animation on multilayered and uneven terrain, 1st International Workshop on Crowd Simulation, Lausanne, Switzerland, 2005; 1–9.
[6]
van Toll WG, Cook IV AF, Geraerts R. Navigation meshes for realistic multi-layered environments, IEEE/RSJ International Conference on Intelligent Robots and Systems, San Francisco, California, USA, 2011; 3526–3532.
[7]
van Toll WG, Cook IV A, Geraerts R. Real-time density-based crowd simulation. Computer Animation and Virtual Worlds 2012; 23(1): 59–69.
[8]
Kavraki LE, Švestka P, Latombe JC, Overmars MH. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 1996; 12: 566–580.
[9]
Kuffner JJ, LaValle SM. RRT-connect: An efficient approach to single-query path planning, IEEE International Conference on Robotics and Automation, San Francisco, California, USA, 2000; 995–1001.
[10]
Rabin S. AI Game Programming Wisdom 2, Charles River Media Inc.: Hingham, 2004.
[11]
Gayle R, Sud A, Lin MC, Manocha D. Reactive deformation roadmaps: motion planning of multiple robots in dynamic environments, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, San Diego, California, USA, 2007; 3777–3783.
[12]
van den Berg JP, Lin MC, Manocha D. Reciprocal Velocity Obstacles for real-time multi-agent navigation, IEEE International Conference on Robotics and Automation, Pasadena, California, USA, 2008; 1928–1935.
[13]
Karamouzas I, Heil P, van Beek P, Overmars MH. A predictive collision avoidance model for pedestrian simulation, 2nd International Workshop on Motion in Games, Zeist, The Netherlands, 2009; 41–52.
[14]
Dixit PN, Hale DH, Youngblood GM. Automatically-generated convex region decomposition for real-time spatial agent navigation in virtual worlds, 4th AAAI AI Interactive Digital Entertainment Conference, Stanford, California, USA, 2008; 173–178.
[15]
Kallmann M. Shortest paths with arbitrary clearance from navigation meshes, Eurographics/SIGGRAPH Symposium on Computer Animation, Madrid, Spain, 2010.
[16]
Wein R, van den Berg JP, Halperin D. The visibility–Voronoi complex and its applications. Computational Geometry: Theory and Applications 2007; 36(1): 66–78.
[17]
Preparata F. 1977. The medial axis of a simple polygon, In Mathematical foundations of computer science, Vol.  53, Springer: Springer Berlin/Heidelberg.
[18]
Sud A, Gayle R, Andersen E, Guy S, Lin MC, Manocha D. Real-time navigation of independent agents using adaptive roadmaps, ACM Symposium on Virtual Reality Software and Technology, Newport Beach, California, USA, 2007; 99–106.
[19]
Roos T, Noltemeier H. Dynamic Voronoi diagrams in motion planning. System Modelling and Optimization 1992; 180: 102–111.
[20]
Kallmann M, Matarić M. Motion planning using dynamic roadmaps, IEEE International Conference on Robotics and Automation, New Orleans, Louisiana, USA, 2004; 4399–4404.
[21]
Green PJ, Sibson R. Computing Dirichlet tessellations in the plane. The Computer Journal 1978; 21(2): 168–173.
[22]
Devillers O. On deletion in Delaunay triangulations, 15th Symposium on Computational Geometry, 1999; 181–188.
[23]
Mostafavi MA, Gold C, Dakowicz M. Delete and insert operations in Voronoi/Delaunay methods and applications. Computers and Geosciences 2003; 29(4): 523–530.
[24]
Gowda I, Kirkpatrick D, Lee D, Naamad A. Dynamic Voronoi diagrams. IEEE Transactions on Information Theory 1983; 29(5): 724–731.
[25]
Held M, Huber S. Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments. Computer-Aided Design 2009; 41(5): 327–338.
[26]
Kallmann M, Bieri H, Thalmann D. 2003. Fully dynamic constrained Delaunay triangulations, In Geometric Modelling for Scientific Visualisation, Brunnet G, Hamann B, Meuller H, Linsen L (eds), Springer-Verlag: Heidelberg, Germany.
[27]
de Moura Pinto F, Dal Sasso Freitas CM. Dynamic Voronoi diagram of complex sites. The Visual Computer: International Journal of Computer Graphics 2011; 27(6–8): 463–472.
[28]
de Berg M, Cheong O, van Kreveld M, Overmars MH. Computational Geometry: Algorithms and Applications, 3rd edition, Springer: Springer-Verlag Berlin Heidelberg, 2008.
[29]
Okabe A, Boots B, Sugihara K, Chiu SN. Spatial Tessellations: Concepts And Applications of Voronoi Diagrams, 2nd Edition, John Wiley and Sons, Ltd.: Baffins Lane, Chichester, West Sussex, England, 2000.
[30]
Shamos MI, Hoey D. Closest-point problems, IEEE Symposium on Foundations of Computer Science, Berkeley, California, USA, 1975; 151–162.
[31]
Fortune S. A sweepline algorithm for Voronoi diagrams, 2nd Symposium on Computational Geometry, Yorktown Heights, New York, USA, 1986; 313–322.
[32]
Hoff III KE, Culver T, Keyser J, Lin MC, Manocha D. Fast computation of generalized Voronoi diagrams using graphics hardware, International Conference on Computer Graphics and Interactive Techniques, Los Angeles, California, USA, 1999; 277–286.

Cited By

View all
  • (2023)Indoor fire emergency evacuation path planning based on improved NavMesh algorithmJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-23268145:6(10757-10768)Online publication date: 1-Jan-2023
  • (2021)AM-RRT*: Informed Sampling-based Planning with Assisting Metric2021 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48506.2021.9561604(10093-10099)Online publication date: 30-May-2021
  • (2021)Multi-Objective Optimization and Decision-Making in Context Steering2021 IEEE Conference on Games (CoG)10.1109/CoG52621.2021.9619155(1-8)Online publication date: 17-Aug-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Computer Animation and Virtual Worlds
Computer Animation and Virtual Worlds  Volume 23, Issue 6
November 2012
44 pages
ISSN:1546-4261
EISSN:1546-427X
Issue’s Table of Contents

Publisher

John Wiley and Sons Ltd.

United Kingdom

Publication History

Published: 01 November 2012

Author Tags

  1. Voronoi diagram
  2. dynamic environments
  3. medial axis
  4. navigation mesh

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Indoor fire emergency evacuation path planning based on improved NavMesh algorithmJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-23268145:6(10757-10768)Online publication date: 1-Jan-2023
  • (2021)AM-RRT*: Informed Sampling-based Planning with Assisting Metric2021 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48506.2021.9561604(10093-10099)Online publication date: 30-May-2021
  • (2021)Multi-Objective Optimization and Decision-Making in Context Steering2021 IEEE Conference on Games (CoG)10.1109/CoG52621.2021.9619155(1-8)Online publication date: 17-Aug-2021
  • (2018)The Medial Axis of a Multi-Layered Environment and Its Application as a Navigation MeshACM Transactions on Spatial Algorithms and Systems10.1145/32044564:1(1-34)Online publication date: 12-Jun-2018
  • (2017)Modeling space to support use-pattern simulation in buildingsProceedings of the Symposium on Simulation for Architecture and Urban Design10.5555/3289787.3289807(1-8)Online publication date: 22-May-2017
  • (2017)Compromise-free pathfinding on a navigation meshProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171714(496-502)Online publication date: 19-Aug-2017
  • (2016)Geometric and discrete path planning for interactive virtual worldsACM SIGGRAPH 2016 Courses10.1145/2897826.2927310(1-29)Online publication date: 24-Jul-2016
  • (2016)ACCLMeshComputer Animation and Virtual Worlds10.1002/cav.171027:3-4(195-204)Online publication date: 1-May-2016
  • (2015)ACCLMeshProceedings of the 8th ACM SIGGRAPH Conference on Motion in Games10.1145/2822013.2822043(97-102)Online publication date: 16-Nov-2015
  • (2015)Dynamically Pruned A* for re-planning in navigation meshes2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS.2015.7353649(2051-2057)Online publication date: 28-Sep-2015
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media