Partitioning the Space to Calculate Shortest Paths to any Goal Around Polyhedral Obstacles
Varol Akman and W. Randolph Franklin.
Partitioning the space to calculate shortest paths to any goal around polyhedral obstacles.
In Proceedings of ROBEXS'85, the First Annual Workshop on Robotics and Expert Systems. NASA/Johnson Space Center, 27–28 June 1985.
[full text]
[BibTeX▼]
Full Text
[download]