Collision Detection : A Geometric Approach

[1]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Yunhui Liu,et al.  A new solid model HSM and its application to interference detection between moving objects , 1991, J. Field Robotics.

[3]  Li-Chen Fu,et al.  An efficient algorithm for finding a collision-free path among polyhedral obstacles , 1990, J. Field Robotics.

[4]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

[5]  Carme Torras,et al.  Interference detection between non-convex polyhedra revisited with a practical aim , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[6]  Vladimir J. Lumelsky,et al.  Path planning among unknown obstacles: the case of a three-dimensional Cartesian arm , 1992, IEEE Trans. Robotics Autom..

[7]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[8]  Kurt Mehlhorn,et al.  Intersecting two polyhedra one of which is convex , 1985, FCT.

[9]  Ronald C. Arkin,et al.  Active Avoidance: Escape and Dodging Behaviors for Reactive Control , 1993, Int. J. Pattern Recognit. Artif. Intell..

[10]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.