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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Li, Fajie (Autor:in) / Klette, Reinhard (Autor:in) / Morales, Sandino (Autor:in)


    Erscheinungsdatum :

    2009-06-01


    Format / Umfang :

    1767238 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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

    Freier Zugriff

    Driver assistance for high accelerations and velocities over shortest time paths

    BARRETT JOHN / DIAMOND BRUCE F / WESTON KEITH et al. | Europäisches Patentamt | 2024

    Freier Zugriff