Abstract
Path planning and navigation play a significant role in simulated virtual environments and computer games. Computing collisionfree paths, addressing clearance, and designing dynamic representations and re-planning strategies are examples of important problems with roots in computational geometry and discrete artificial intelligence search methods, and which are being re-visited with innovative new perspectives from researchers in computer graphics and animation. This course provides an overview of navigation structures and algorithms for achieving real-time dynamic navigation for the next generation of multi-agent simulations and virtual worlds. Building on top of classical techniques in computational geometry and discrete search, we review recent developments in real-time planning and discrete environment representations for the efficient and robust computation of paths addressing different constraints in large, complex, and dynamic environments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
