Real-time optimization-based planning in dynamic environments using GPUs

1Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

We present a novel algorithm to compute collision-free trajectories in dynamic environments. Our approach is general and makes no assumption about the obstacles or their motion. We use a replanning framework that interleaves optimization based planning with execution. Furthermore, we describe a parallel formulation that exploits high number of cores on commodity graphics processors (GPUs) to compute a highquality path in a given time interval. Overall, we show that search in configuration spaces can be significantly accelerated by using GPU parallelism. Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Park, C., Pan, J., & Manocha, D. (2012). Real-time optimization-based planning in dynamic environments using GPUs. In Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 (pp. 168–170). https://doi.org/10.1609/socs.v3i1.18263

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free