Upload

Loading...

This video is unavailable.

ClearPath: Highly Parallel Collision Avoidance for Multi-agent Simulation

Like this video?

Sign in to make your opinion count.

Don't like this video?

Sign in to make your opinion count.

Want to watch this again later?

Sign in to add this video to a playlist.

Uploaded on Nov 1, 2009

We present a new local collision avoidance algorithm between multiple agents for real-time simulations. Our approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimization problem. We use a discrete optimization method to efficiently compute the motion of each agent. This resulting algorithm can be parallelized by exploiting data-parallelism and thread-level parallelism. The overall approach, ClearPath, is general and can robustly handle dense scenarios with tens or hundreds of thousands of heterogeneous agents in a few milliseconds. As compared to prior collision avoidance algorithms, we observe more than an order of magnitude performance improvement [Stephen. J. Guy, Jatin Chhugani, Changkyu Kim, Nadathur Satish, Ming C. Lin, Dinesh Manocha, and Pradeep Dubey].

http://gamma.cs.unc.edu/CA/

Loading...

Loading...

Loading...

Transcript

The interactive transcript could not be loaded.

Loading...

Loading...

Ratings have been disabled for this video.
Rating is available when the video has been rented.
This feature is not available right now. Please try again later.

Loading...

Loading...
Working...
to add this to Watch Later

Add to