Theta* algorithm is a searching-based path planning algorithm that gives an optimal path with more flexibility on route angle than A* method. The dynamics of USV is characterized by large inertia, so that larger turning angle is preferred. In view of the shortcomings of traditional Theta* algorithm, such as being hard to balance overall situation and details in long-distance planning, and lacking of waypoint replacement scheme when a waypoint is unreachable, it is inappropriate to make long-distance planning through Theta* algorithm directly. In order to ensure safe navigation for unmanned surface vehicle (USV), this paper proposes a multi-scale Theta* algorithm to solve these defects. Simulation result manifests the proposed scheme can provide a path clear of obstacles with several fold reduction in time consumption. The proposed planning method simplifies path planning process and contributes to the development of marine transportation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-scale theta* algorithm for the path planning of unmanned surface vehicle


    Contributors:
    Han, Xu (author) / Zhang, Xianku (author)


    Publication date :

    2022-05-01


    Size :

    9 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Smoothed A* algorithm for practical unmanned surface vehicle path planning

    Song, R / Liu, Y / Bucknall, R | BASE | 2018

    Free access

    Multi-unmanned-surface-vehicle full-coverage path collaborative planning method

    HAN ZHIHAO / ZHOU JIANMIN | European Patent Office | 2020

    Free access

    Co-Evolutionary Algorithm-Based Multi-Unmanned Aerial Vehicle Cooperative Path Planning

    Yan Wu / Mingtao Nie / Xiaolei Ma et al. | DOAJ | 2023

    Free access


    PATH PLANNING FOR AN UNMANNED VEHICLE

    COHEN OFIR / APPELMAN DINA | European Patent Office | 2019

    Free access