Search
Now showing items 1-2 of 2
Solving the Find-Path Problem by Representing Free Space as Generalized Cones
(1982-05-01)
Free space is represented as a union of (possibly overlapping) generalized cones. An algorithm is presented which efficiently finds good collision free paths for convex polygonal bodies through space littered with ...
A Subdivision Algorithm in Configuration Space for Findpath with Rotation
(1982-12-01)
A hierarchical representation for configuration space is presented, along with an algorithm for searching that space for collision-free paths. The detail of the algorithm are presented for polygonal obstacles and a ...