Emergency vehicle characteristics amplify the stochastic nature of transportation networks. The emergency vehicle operator who aims at reaching his destination in the fastest time possible cannot rely on “average” data alone. Each emergency event has its own implications (accident, fire, injury, security event, etc.) and must be dealt with as an individual incident. The need to deal with each event separately led, first, to the development of a stochastic shortest-path algorithm that refers to the dynamic traffic flow and then to a presentation method of the results so as to incorporate the operator's accumulated knowledge. The whole algorithm is based on a K shortest-path model incorporated with a simulation element in order to consider stochastic characteristics. The stochastic model uses a new definition, namely, the probability that a given path is the shortest. In contrast to a deterministic model, which yields a single shortest path, the stochastic model yields a set of paths, each having a different probability. This set of paths, along with relevant information for the emergency vehicle, is presented in a particular way to the operator. In addition, it was found that the arrangement of information is vital to the selection of the most promising path.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Shortest Path of Emergency Vehicles under Uncertain Urban Traffic Conditions


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:
    Hadas, Y. (Autor:in) / Ceder, A. (Autor:in)


    Erscheinungsdatum :

    1996-01-01




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Shortest Path of Emergency Vehicles Under Uncertain Urban Traffic Conditions

    Hadas, Y. / Ceder, A. | Transportation Research Record | 1996


    Shortest Path of Emergency Vehicles Under Uncertain Urban Traffic Conditions

    Hadas, Y. / Ceder, A. / National Research Council; Transportation Research Board | British Library Conference Proceedings | 1996


    Urban K shortest path obtaining method based on shortest path tree

    DING JIANXUN / YANG BEINUO / DUAN RUI et al. | Europäisches Patentamt | 2024

    Freier Zugriff

    Shortest safe path planning for vehicles

    Lambert, A. / Bouaziz, S. / Reynaud, R. | IEEE | 2003