To safely and effectively participate in road traffic, automated vehicles should explicitly consider compliance with traffic rules and high-level specifications. We propose a method that can incorporate traffic and handcrafted rules expressed in time-labeled propositional logic into our reach ability analysis, which computes the over-approximative set of states reachable by vehicles. These reachable sets serve as low-level trajectory planning constraints to expedite the search for specification-compliant trajectories. Depending on the adopted specifications, related semantic labels are generated from predicates considering positions, velocities, accelerations, and general traffic situations. We exhibit the applicability of the proposed method with scenarios from the CommonRoad benchmark suite.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computing Specification-Compliant Reachable Sets for Motion Planning of Automated Vehicles


    Contributors:


    Publication date :

    2021-07-11


    Size :

    2552210 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    COMPUTING SPECIFICATION-COMPLIANT REACHABLE SETS FOR MOTION PLANNING OF AUTOMATED VEHICLES

    Liu, Edmond Irani / Althoff, Matthias | British Library Conference Proceedings | 2021



    Using Reachable Sets for Trajectory Planning of Automated Vehicles

    Manzinger, Stefanie / Pek, Christian / Althoff, Matthias | IEEE | 2021



    OPTIMAL MOTION PLANNING WITH REACHABLE SETS OF VULNERABLE ROAD USERS

    Hartmann, Michael / Watzenig, Daniel | British Library Conference Proceedings | 2019