In this work, we adopt the route reservation architecture proposed in [1] and adapt the reservation algorithm so that route reservations are made based on continuous-time intervals (instead of fixed discrete-time intervals). Using the continuous-time reservation architecture, we formulate a mixed integer linear programming (MILP) problem to obtain the optimal path of any vehicle, avoiding roads that are at-capacity. Since the MILP problem is hard to solve efficiently, we also propose a heuristic iterative algorithm that is based on Dijkstra's algorithm, is of low-complexity and provides close-to-optimal results, as compared to the MILP obtained solution (at least for small problems where MILP provided a solution in reasonable time). The simulation results further indicate that the Dijkstra-based heuristic can be solved more efficiently in continuous-time rather than discrete-time for high-demand scenarios.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal path selection in a continuous-time route reservation architecture


    Beteiligte:
    Menelaou, C. (Autor:in) / Timotheou, S. (Autor:in) / Kolios, P. (Autor:in) / Panayiotou, C. G. (Autor:in) / Polycarpou, M. M. (Autor:in)


    Erscheinungsdatum :

    2017-10-01


    Format / Umfang :

    201938 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Route Reservation Method

    HUGLA GUILLAUME | Europäisches Patentamt | 2018

    Freier Zugriff

    NAVIGATION ROUTE RESERVATION FOR WAREHOUSE ROBOT

    AI XIN / YANG HAO | Europäisches Patentamt | 2022

    Freier Zugriff


    ASSESSMENT OF PATH RESERVATION IN DISTRIBUTED REAL-TIME VEHICLE GUIDANCE

    Senge, S. / Institute of Electrical and Electronics Engineers | British Library Conference Proceedings | 2013


    OPTIMAL ROUTE SELECTION FOR AUTONOMOUS VEHICLES

    SINGHAL ABHISHEK / MURALIDHAR GAUTAM / POULIOT CHRISTOPHER et al. | Europäisches Patentamt | 2018

    Freier Zugriff