In this paper, we study weakly dynamic undirected graphs, and we propose an efficient polynomial algorithm that computes in advance alternative shortest paths for all possible configurations. No additional computation is then needed after any change in the problem because shortest paths are already known in all cases. We use these results to compute critical values for the traversal duration and to pre-compute best paths, and we apply this result to one delivery problem for trucks from one regional storehouse to several local stores when one possible point has a variable traversal duration.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Route planning in a weakly dynamic undirected graph


    Beteiligte:


    Erscheinungsdatum :

    2013-05-01


    Format / Umfang :

    968542 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Distributed IE for MASs with Undirected Graph

    Zhu, Jun-Wei / Wang, Xin / Yang, Guang-Hong | Springer Verlag | 2022


    Rotation-Matrix-Based Attitude Tracking Under an Undirected Tree Graph

    Chen, Ti / Shan, Jinjun / Wen, Hao | Springer Verlag | 2022


    Dynamic Route Planning

    RAKAH YARON / SHOVAL OREN / RAMOT DANIEL et al. | Europäisches Patentamt | 2018

    Freier Zugriff

    Distributed adaptive time‐varying formation of multi‐UAV systems under undirected graph

    Cai, Xin / Zhu, Xiaozhou / Yao, Wen | Wiley | 2024

    Freier Zugriff

    Adaptive Fault-tolerant Attitude Tracking on SO(3) Under an Undirected Graph

    Chen, Ti / Shan, Jinjun / Wen, Hao | Springer Verlag | 2022