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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Nguyen, Ty (author) / Au, Tsz-Chiu (author)


    Publication date :

    2019-06-01


    Size :

    685259 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Controlling autonomous vehicles using safe arrival times

    NISTER DAVID / VORONTSOV ANTON | European Patent Office | 2020

    Free access

    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | European Patent Office | 2023

    Free access

    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | European Patent Office | 2019

    Free access

    CONTROLLING AUTONOMOUS VEHICLES USING SAFE ARRIVAL TIMES

    NISTER DAVID / VORONTSOV ANTON | European Patent Office | 2025

    Free access