The complexity of robot motion planning
The complexity of robot motion planning
A Configuration Space Approach for Efficient Animation of Human Figures
NAM '97 Proceedings of the 1997 IEEE Workshop on Motion of Non-Rigid and Articulated Objects (NAM '97)
Collision Detection
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
A mathematical formalism for the evaluation of c-space for redundant robots
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
| Hi-index | 0.00 |
Many applications in computer graphics require fast and robust collision detection algorithms. The problem of simulating motion in an articulated chain has been well studied using both dynamic and kinematics techniques. This paper describes an efficient method for obstacle representation in the configuration space (C-space) for articulated chains. The method is based on the analytical deconstruction of the C-space, i.e., the separated evaluation of the C-space portion contributed by the collisions of each link. The Deconstruction method is not limited to particular kinematic topologies and allows good collision detection times. The systematic application of a simple convolution of two functions describing each link in the kinematic chain and the workspace, respectively, is applied. The proposed method can naturally face the evaluation of high-dimensional C-spaces, since only non-colliding configurations are considered for the evaluation of the next link in the chain