Finding a shortest path between two given locations is of importance for mobile robots, but also (e.g.) for identifying unique paths in a given surrounding region Π when (e.g.) evaluating vision software in test vehicles, or for calculating the free-space boundary in vision-based driver assistance. We assume that Π is given as a triangulated surface which is not necessary simply connected.
An approximate algorithm for solving shortest path problems for mobile robots or driver assistance
2009-06-01
1767238 byte
Conference paper
Electronic Resource
English
An Approximate Algorithm for Solving Shortest Path Problems for Mobile Robots or Driver Assistance
British Library Conference Proceedings | 2009
|Approximate Shortest Path Algorithms for Network-Tree Model
British Library Conference Proceedings | 2003
|A Multiple Pairs Shortest Path Algorithm
British Library Online Contents | 2005
|