This paper describes a graph search-based local path planner with an adaptive node sampling according to positions of obstacles. Randomly sampled nodes of a graph in a traversable region for finding a local path can generate a winding path due to connection between the randomly sampling nodes. Node sampling with constant intervals can fail to find a proper path in a case that an interval between adjacent obstacles are smaller than the sampling interval. To solve these problems, our path planner changes node sampling strategy according to obstacle positions; it samples nodes along a reference path, e.g., the center line of the lane, if there are no obstacles, but densely samples nodes around obstacles. After sampling, the planner searches the graph using Dijkstra's algorithm for finding an optimal trajectory. For efficient search for the optimal trajectory, the planner firstly generates a trajectory approximated by piecewise linear lines with minimum cost, and fine-tunes it by adjusting node positions with curved edges having smaller cost. We test the planner through simulations in which an ego vehicle drive along a reference path when there are no obstacles, and densely sample around obstacles to improve robustness against obstacle locations.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Graph Search Based Local Path Planning with Adaptive Node Sampling


    Beteiligte:
    Katsuki, Rie (Autor:in) / Tasaki, Tsuyoshi (Autor:in) / Watanabe, Tomoki (Autor:in)


    Erscheinungsdatum :

    2018-06-01


    Format / Umfang :

    1674988 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Adaptive Strike Planning With Search Path Allocation

    Collins, R. E. / Alltop, W. O. / Goodson, D. W. et al. | British Library Conference Proceedings | 1995


    Stochastic search and graph techniques for MCM path planning

    Piatko, C.D. / Diehl, C.P. / McNamee, P. et al. | Tema Archiv | 2002


    Two-Point Flight Path Planning Using A Fast Graph-Search Algorithm

    Wen-Ying Chang / Fei-Bin Hsiao / Donglong Sheu | AIAA | 2006



    Path planning for grasping operations using an adaptive PCA-based sampling method

    Rosell Gratacòs, Jan / Suárez Feijóo, Raúl / Pérez Ruiz, Alexander | BASE | 2013

    Freier Zugriff