Solving distance problems with concave bodies using simulated annealing

IEEE International Conference on Intelligent Robots and Systems

Volumn 3, Issue , 2001, Pages 1507-1512

  Carretero, Juan A ^a   Nahon, Meyer A ^a   Ma, Ou ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b Macdonald Dettwiler   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; GLOBAL OPTIMIZATION; GRADIENT METHODS; RANDOM PROCESSES; SIMULATED ANNEALING;

CONCAVE PROBLEM; DISTANCE DETERMINATION;

MOTION PLANNING;

EID: 0035558045     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1109/IROS.2001.977193     Document Type: Article

References (19)

1. Distance calculations in motion planning problems with interference situations
2. A distance determination algorithm for real-time simulation of contact dynamics
3. A procedure to determine intersection between polyhedral objects
4. Interference detection among solids and surfaces
5. Distance between boxes: Applications to collision detection and clipping
6. A fast algorithm for incremental distance determination
7. A fast procedure for computing the distance between complex objects in three-dimensional space
8. OBB-tree: A hierarchical structure for rapid interference detection
9. A direct minimization approach for obtaining the distance between convex polyhedra
10. A general method for computing the distance between two objects using optimization techniques
11. Incremental algorithms for collision detection between polygonal models
12. Interference detection of non-convex solids for manipulators
13. Interference detection between non-convex polyhedra revisited with a practical aim
14. Kinematic analysis and optimization of a new three degree-of-freedom spatial parallel manipulator
15. Optimization by simulated annealing
16. Simulated annealing algorithms: An overview
17. Performance of various computers using standard linear equations software