This paper presents a novel approach to computing minimum-time paths based on a technique originally developed for use in geophysics. The technique is based on a finite difference scheme and is quite efficient in terms of both computing effort and storage. A particular strength of the technique is that it provides optimal paths to all locations in the field, thus being useful in situations where the goal is not known at the outset of the search. Details are presented on the basic technique and extensions are derived to include the integrations of resources (such as fuel store), and to provide flexibility in the objective. Two examples are given: minimum-time planning for vehicles under the influence of drift, and planning to minimise the risk of detection for a stealth vehicle in the presence of threats.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finite difference vehicular path planning


    Contributors:

    Published in:

    The Journal of Navigation ; 52 , 2 ; 268-278


    Publication date :

    1999


    Size :

    11 Seiten, 11 Quellen




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Finite Difference Vehicular Path Planning

    Wharington, John | Online Contents | 1999


    VEHICULAR AUTONOMOUS PARKING SYSTEM WITH ENHANCED PATH PLANNING

    KRISHNAN PRASHANTH | European Patent Office | 2024

    Free access

    Driving Path Planning System under Vehicular Active Safety Constraint

    Xiong, Shengguang / Tan, Gangfeng / Guo, Xuexun et al. | British Library Conference Proceedings | 2016


    Driving Path Planning System under Vehicular Active Safety Constraint

    Huang, Bo / Tan, Gangfeng / Yang, Mengying et al. | SAE Technical Papers | 2016


    VEHICULAR SWEPT PATH RECORDING APPARATUS

    IMAI YUJI | European Patent Office | 2018

    Free access