Author name cluster

Chonhyon Park

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

7 papers

1 author row

ICRA Conference 2017 Conference Paper

Efficient probabilistic collision detection for non-convex shapes

Jae Sung Park
Chonhyon Park
Dinesh Manocha

We present new algorithms to perform fast probabilistic collision queries between convex as well as non-convex objects. Our approach is applicable to general shapes, where one or more objects are represented using Gaussian probability distributions. We present a fast new algorithm for a pair of convex objects, and extend the approach to non-convex models using hierarchical representations. We highlight the performance of our algorithms with various convex and non-convex shapes on complex synthetic benchmarks and trajectory planning benchmarks for a 7-DOF Fetch robot arm.

Details

IROS Conference 2016 Conference Paper

HI Robot: Human intention-aware robot planning for safe and efficient navigation in crowds

Chonhyon Park
Jan Ondrej
Max Gilbert
Kyle Freeman
Carol O'Sullivan

We present an algorithmic framework for the early classification of human intentions, and use it to accurately predict future human motions when planning the path of a robot in an environment that is shared with humans. During an off-line learning phase, a classifier that can recognize when a human intends to interact with the robot is trained. At runtime, this trained classifier allows us to recognize humans who intend to interact with, or obstruct, the robot in some way. We validate our approach using both recorded and simulated data in an environment in which some humans intentionally obstruct the robot. Our classifier identifies these potential blockers, thus allowing the robot to safely and efficiently navigate the environment by minimizing the chances of being blocked.

Details

ICAPS Conference 2016 Conference Paper

Robot Motion Planning for Pouring Liquids

Zherong Pan
Chonhyon Park
Dinesh Manocha

We present a new algorithm to compute a collision-free trajectory for a robot manipulator to pour liquid from one container to the other. Our formulation uses a physical fluid model to predicate its highly deformable motion. We present simulation guided and optimization based method to automatically compute the transferring trajectory. Instead of abstract or simplified liquid models, we use the full-featured and accurate Navier-Stokes model that provides the fine-grained information of velocity distribution inside the liquid body. Moreover, this information is used as an additional guiding energy term for the planner. One of our key contributions is the tight integration between the fine-grained fluid simulator, liquid transfer controller, and the optimization-based planner. We have implemented the method using hybrid particle-mesh fluid simulator (FLIP) and demonstrated its performance on 4 benchmarks, with different cup shapes and viscosity coefficients.

Details

ICRA Conference 2014 Conference Paper

Poisson-RRT

Chonhyon Park
Jia Pan 0001
Dinesh Manocha

We present an RRT-based motion planning algorithm that uses the maximal Poisson-disk sampling scheme. Our approach exploits the free-disk property of the maximal Poisson-disk samples to generate nodes and perform tree expansion. Furthermore, we use an adaptive scheme to generate more samples in challenging regions of the configuration space. Our approach can be easily parallelized on multi-core CPUs and many-core GPUs. We highlight the performance of our algorithm on different benchmarks.

Details

ICRA Conference 2013 Conference Paper

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

Chonhyon Park
Jia Pan 0001
Dinesh Manocha

We present a novel algorithm to compute collision-free trajectories in dynamic environments. Our approach is general and does not require a priori knowledge 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 a high number of cores on commodity graphics processors (GPUs) to compute a high-quality path in a given time interval. We derive bounds on how parallelization can improve the responsiveness of the planner and the quality of the trajectory.

Details

ICAPS Conference 2012 Conference Paper

ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments

Chonhyon Park
Jia Pan 0001
Dinesh Manocha

We present a novel optimization-based algorithm for motion planning in dynamic environments. Our approach uses a stochastic trajectory optimization framework to avoid collisions and satisfy smoothness and dynamics constraints. Our algorithm does not require a priori knowledge about global motion or trajectories of dynamic obstacles. Rather, we compute a conservative local bound on the position or trajectory of each obstacle over a short time and use the bound to compute a collision-free trajectory for the robot in an incremental manner. Moreover, we interleave planning and execution of the robot in an adaptive manner to balance between the planning horizon and responsiveness to obstacle. We highlight the performance of our planner in a simulated dynamic environment with the 7-DOF PR2 robot arm and dynamic obstacles.

Details

SoCS Conference 2012 Conference Paper

Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs

Chonhyon Park
Jia Pan 0001
Dinesh Manocha

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 high-quality path in a given time interval. Overall, we show that search in configuration spaces can be significantly accelerated by using GPU parallelism.

Details