Fast convex minimization to detect collisions between polyhedra

IEEE International Conference on Intelligent Robots and Systems

Volumn 3, Issue , 2000, Pages 1605-1610

  Mirolo, C ^a   Pagello, E ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER SIMULATION; MOBILE ROBOTS; MOTION PLANNING;

BIVARIATE CONVEX FUNCTION; COLLISION FREE PATHS; CONVEX POLYHEDRA; FAST CONVEX MINIMIZATION;

COLLISION AVOIDANCE;

EID: 0034449282     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Collision detection by four dimensional intersection testing
2. Dealing with geometric complexity in motion planning
3. A comparison of two fast algorithms for computing the distance between convex polyhedra
4. An opportunistic global path planner
5. I-Collide: An interactive and exact collision detection system for large-scaled environments
6. Fast detection of polyhedral intersection
7. Determining the separation of preprocessed polyhedra - A unified approach
8. A fast procedure for computing the distance between complex objects in three-Dim. Space
9. New distances for the separation and penetration of objects
10. Practical motion planning: An overview and state of the art
11. Benefits of applicability constraints in decomposition-free interference detection btw. Nonconvex polyhedral models
12. A framework for efficient minimum distance computations
13. Bound coherence for minimum distance computations
14. A fast algorithm for incremental distance calculation
15. Fast algorithms for penetration and contact determination between non-convex polyhedral models
16. Collision detection between geometric models: A survey
17. Very fast collision detection for practical motion planning - Part I: The spatial representation
18. Polylogarithmic algorithms for collision detection based on convex minimization
19. A practical motion planning strategy based on a plane-sweep approach
20. Convex minimization on a grid and applications
21. Exact geometry and robot motion planning: Speculations on a few numerical experiments
22. Properties of penetration between general objects
23. An incremental version of growth distance
24. Efficient distance computation between non-convex objects
25. Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects
26. Computing distances between NURBS-defined convex objects
27. Fast swept-volume distance for robust collision detection