Geometric and Discrete Path Planning for Interactive Virtual Worlds

Geometric and Discrete Path Planning for Interactive Virtual Worlds

Marcelo Kallmann, Mubbasir Kapadia
ISBN: 9781627057561 | PDF ISBN: 9781627057578
Copyright © 2016 | 201 Pages | Publication Date: January 28, 2016

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00687ED1V01Y201512VCP023

READ SAMPLE CHAPTER

Ordering Options: Paperback $70.00   E-book $56.00   Paperback & E-book Combo $87.50


Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:


This book reviews the evolution of several related techniques in path planning and navigation for controlling autonomous agents in interactive virtual worlds. It originated from a popular course presented by the authors at SIGGRAPH 2014. Given the growing demands on the size and complexity of modern virtual worlds, a number of new techniques have been developed for achieving intelligent navigation for the next generation of multi-agent simulations.

The covered topics create a useful resource relating to new directions of research in computer animation for students, researchers, and developers. The covered topics range from discrete search and geometric representations to planning under different types of constraints and harnessing the power of graphics hardware in order to address Euclidean shortest paths and discrete search for multiple agents under limited time budgets. The use of planning algorithms beyond path planning is also discussed in the areas of crowd animation and whole-body motion planning for virtual characters.

Table of Contents

Preface
Acknowledgments
Basic Approaches for World Representation
Discrete Search Algorithms
Euclidean Shortest Paths
Navigation Meshes and Geometric Structures with Clearance
Extending Basic Search Techniques
Constraint-Aware Navigation
Anytime Dynamic Search on the GPU
Dynamic Planning of Footstep Trajectories for Crowd Simulation
Planning using Multiple Domains of Control
Motion Planning for Character Motion Synthesis
Epilogue
Bibliography
Authors' Biographies

About the Author(s)

Marcelo Kallmann, University of California, Merced
Marcelo Kallmann is Founding Faculty and Associate Professor of Computer Science at the School of Engineering of the University of California, Merced. He holds a Ph.D. from the Swiss Federal Institute of Technology in Lausanne (EPFL), was Research Faculty at the University of Southern California (USC), and a scientist at the USC Institute for Creative Technologies (ICT) before moving to UC Merced in 2005. His areas of research include computer animation, virtual reality, and motion planning. At UC Merced, he established and leads the computer graphics research group. His research work has been supported by several awards from the US National Science Foundation, and his work on triangulations for path planning runs inside The Sims 4, the latest installment of one of the best-selling video game series of all time.

Mubbasir Kapadia, Rutgers University
Mubbasir Kapadia is an Assistant Professor in the Computer Science Department at Rutgers University. Previously, he was an Associate Research Scientist at Disney Research Zurich. He was a postdoctoral researcher and Assistant Director at the Center for Human Modeling and Simulation at University of Pennsylvania, under the directorship of Prof. Norman I. Badler. He was the project lead on the United States Army Research Laboratory (ARL) funded project Robotics Collaborative Technology Alliance (RCTA). He received his Ph.D. in computer science at University of California, Los Angeles under the advisement of Professor Petros Faloutsos. He is the co-author of the book Virtual Crowds: Steps Toward Behavioral Realism, Morgan & Claypool Publishers, 2015.

Reviews
Browse by Subject
Case Studies in Engineering
ACM Books
IOP Concise Physics
SEM Books
0 items
LATEST NEWS

Newsletter
Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: