Jia Pan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jia Pan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dinesh Manocha
University of Maryland, College Park, USA
5 shared publications Dinesh Manocha
2 shared publicationsSachin Chitta
Willow Garage Inc
2 shared publicationsLiangjun Zhang
1 shared publication- Liangjun Zhang
University of North Carolina at Chapel Hill
1 shared publication Ming C. Lin
1 shared publication
Latest Publications
- 26 August 2016
- Published by Springer Nature
- p. 77-94
Probabilistic Collision Detection Between Noisy Point Clouds Using Robust Classification
- 26 August 2016
- Published by Springer Nature
- p. 77-94
Probabilistic Collision Detection Between Noisy Point Clouds Using Robust Classification
- Open Access
- 1 November 2013
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 32 (6) , 1-12
Efficient penetration depth approximation using active learning
We present a new method for efficiently approximating the global penetration depth between two rigid objects using machine learning techniques. Our approach consists of two phases: offline learning and performing run-time queries. In the learning phase, we precompute an approximation of the contact space of a pair of intersecting objects from a set of samples in the configuration space. We use active and incremental learning algorithms to accelerate the precomputation and improve the accuracy. During the run-time phase, our algorithm performs a nearest-neighbor query based on translational or rotational distance metrics. The run-time query has a small overhead and computes an approximation to global penetration depth in a few milliseconds. We use our algorithm for collision response computations in Box2D or Bullet game physics engines and complex 3D models and observe more than an order of magnitude improvement over prior PD computation techniques.link_to_subscribed_fulltex
- 1 November 2013
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 32 (6) , 1-12
Open AccessEfficient penetration depth approximation using active learning
We present a new method for efficiently approximating the global penetration depth between two rigid objects using machine learning techniques. Our approach consists of two phases: offline learning and performing run-time queries. In the learning phase, we precompute an approximation of the contact space of a pair of intersecting objects from a set of samples in the configuration space. We use active and incremental learning algorithms to accelerate the precomputation and improve the accuracy. During the run-time phase, our algorithm performs a nearest-neighbor query based on translational or rotational distance metrics. The run-time query has a small overhead and computes an approximation to global penetration depth in a few milliseconds. We use our algorithm for collision response computations in Box2D or Bullet game physics engines and complex 3D models and observe more than an order of magnitude improvement over prior PD computation techniques.link_to_subscribed_fulltex
- 1 January 2013
- Published by Springer Nature
- p. 181-186
Synthesizing Human-Like Walking in Constrained Environments
- 1 January 2013
- Published by Springer Nature
- p. 181-186
Synthesizing Human-Like Walking in Constrained Environments
- 1 January 2013
- Published by Springer Nature
- p. 381-396
Faster Sample-Based Motion Planning Using Instance-Based Learning
- 1 January 2013
- Published by Springer Nature
- p. 381-396
Faster Sample-Based Motion Planning Using Instance-Based Learning
- 19 December 2011
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 31 (2) , 187-200
GPU-based parallel collision detection for fast motion planning
We present parallel algorithms to accelerate collision queries for sample-based motion planning. Our approach is designed for current many-core GPUs and exploits data-parallelism and multi-threaded capabilities. In order to take advantage of the high number of cores, we present a clustering scheme and collision-packet traversal to perform efficient collision queries on multiple configurations simultaneously. Furthermore, we present a hierarchical traversal scheme that performs workload balancing for high parallel efficiency. We have implemented our algorithms on commodity NVIDIA GPUs using CUDA and can perform 500, 000 collision queries per second with our benchmarks, which is 10 times faster than prior GPU-based techniques. Moreover, we can compute collision-free paths for rigid and articulated models in less than 100 ms for many benchmarks, almost 50–100 times faster than current CPU-based PRM planners.
- 19 December 2011
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 31 (2) , 187-200
GPU-based parallel collision detection for fast motion planning
We present parallel algorithms to accelerate collision queries for sample-based motion planning. Our approach is designed for current many-core GPUs and exploits data-parallelism and multi-threaded capabilities. In order to take advantage of the high number of cores, we present a clustering scheme and collision-packet traversal to perform efficient collision queries on multiple configurations simultaneously. Furthermore, we present a hierarchical traversal scheme that performs workload balancing for high parallel efficiency. We have implemented our algorithms on commodity NVIDIA GPUs using CUDA and can perform 500, 000 collision queries per second with our benchmarks, which is 10 times faster than prior GPU-based techniques. Moreover, we can compute collision-free paths for rigid and articulated models in less than 100 ms for many benchmarks, almost 50–100 times faster than current CPU-based PRM planners.
- 25 May 2010
- Published by Wiley in Computer Animation and Virtual Worlds
- Vol. 21 (3-4) , 137-149
A hybrid approach for simulating human motion in constrained environments
We present a new algorithm to generate plausible motions for high‐DOF human‐like articulated figures in constrained environments with multiple obstacles. Our approach is general and makes no assumptions about the articulated model or the environment. The algorithm combines hierarchical model decomposition with sample‐based planning to efficiently compute a collision‐free path in tight spaces. Furthermore, we use path perturbation and replanning techniques to satisfy the kinematic and dynamic constraints on the motion. In order to generate realistic human‐like motion, we present a new motion blending algorithm that refines the path computed by the planner with motion capture data to compute a smooth and plausible trajectory. We demonstrate the results of generating motion corresponding to placing or lifting object, walking, and bending for a 38‐DOF articulated model. Copyright © 2010 John Wiley & Sons, Ltd.
- 25 May 2010
- Published by Wiley in Computer Animation and Virtual Worlds
- Vol. 21 (3-4) , 137-149
A hybrid approach for simulating human motion in constrained environments
We present a new algorithm to generate plausible motions for high‐DOF human‐like articulated figures in constrained environments with multiple obstacles. Our approach is general and makes no assumptions about the articulated model or the environment. The algorithm combines hierarchical model decomposition with sample‐based planning to efficiently compute a collision‐free path in tight spaces. Furthermore, we use path perturbation and replanning techniques to satisfy the kinematic and dynamic constraints on the motion. In order to generate realistic human‐like motion, we present a new motion blending algorithm that refines the path computed by the planner with motion capture data to compute a smooth and plausible trajectory. We demonstrate the results of generating motion corresponding to placing or lifting object, walking, and bending for a 38‐DOF articulated model. Copyright © 2010 John Wiley & Sons, Ltd.
- 1 January 2010
- Published by Springer Nature
- p. 211-228
GPU-Based Parallel Collision Detection for Real-Time Motion Planning
- 1 January 2010
- Published by Springer Nature
- p. 211-228
GPU-Based Parallel Collision Detection for Real-Time Motion Planning