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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An approximate algorithm for solving shortest path problems for mobile robots or driver assistance


    Contributors:


    Publication date :

    2009-06-01


    Size :

    1767238 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Approximate Algorithm for Solving Shortest Path Problems for Mobile Robots or Driver Assistance

    Li, F. / Klette, R. / Morales, S. | British Library Conference Proceedings | 2009


    Approximate shortest path algorithms for network-tree model

    Guozhen Tan, / Xiaojun Han, / Yilin Zhao, | IEEE | 2003


    Approximate Shortest Path Algorithms for Network-Tree Model

    Tan, G. / Han, X. / Zhao, Y. et al. | British Library Conference Proceedings | 2003


    Solving partially observable stochastic shortest-path games

    Tomášek, Petr / Horák, Karel / Aradhye, Aditya et al. | BASE | 2021

    Free access

    A Multiple Pairs Shortest Path Algorithm

    Wang, I.-L. / Johnson, E. L. / Sokol, J. S. | British Library Online Contents | 2005