A fast algorithm for checking whether an autonomous vehicle can arrive at a position at a given arrival time and velocity is the key to Autonomous Intersection Management (AIM). This paper presents a complete set of closed form equations that fully describes the set of all reachable arrival configurations in longitudinal motion planning if the vehicle's controller is a double integrator with bounded acceleration. This result improves the running time of the algorithm for checking the reachability of an arrival configuration from logarithmic time to constant time. We also apply the result to check the reachability in a segmented road and discuss how the algorithm can be applied to real vehicles.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Constant-Time Algorithm for Checking Reachability of Arrival Times and Arrival Velocities of Autonomous Vehicles


    Beteiligte:
    Nguyen, Ty (Autor:in) / Au, Tsz-Chiu (Autor:in)


    Erscheinungsdatum :

    01.06.2019


    Format / Umfang :

    685259 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | Europäisches Patentamt | 2019

    Freier Zugriff

    Controlling autonomous vehicles using safe arrival times

    NISTER DAVID / VORONTSOV ANTON | Europäisches Patentamt | 2020

    Freier Zugriff

    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | Europäisches Patentamt | 2023

    Freier Zugriff

    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | Europäisches Patentamt | 2025

    Freier Zugriff