Path planning is a crucial part of autonomous navigation when regarding autonomous aerial vehicles, often demanding different priorities such as the length, safety or energy consumption. Dynamic programming and geometric methods have been applied to solve this problem, but in recent years, more work has been developed using artificial intelligence approaches, such as reinforcement learning. In this paper we propose an offline path planning method for static environments using Q-learning. An optimal policy is found weighting three important factors: path length, safety and energy consumption. Due to a well balanced exploring/exploiting ratio, the proposed method can lead the agent to the desired destination starting from anywhere in the map. Simulations are done in different scenarios to address the performance of the proposed method and it showcased that the algorithm is able to find feasible paths in each scenario while regarding different set of priorities.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Q-learning based Path Planning Method for UAVs using Priority Shifting




    Publication date :

    2022-06-21


    Size :

    1264850 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Multi-Regional Path-Planning Method for Rescue UAVs with Priority Constraints

    Lexu Du / Yankai Fan / Mingzhen Gui et al. | DOAJ | 2023

    Free access

    Path Planning for Multiple UAVs

    Tsourdos, Antonios / White, Brian / Shanmugavel, Madhavan | Wiley | 2010


    Probabilistic Path Planning for UAVs

    Dogan, Atilla | AIAA | 2003


    A 3D Q-Learning Algorithm for Offline UAV Path Planning with Priority Shifting Rewards

    de Carvalho, Kevin Braathen / Batista, Hiago B. / de Oliveira, Iure L. et al. | IEEE | 2022


    Dynamic Scene Path Planning of UAVs Based on Deep Reinforcement Learning

    Jin Tang / Yangang Liang / Kebo Li | DOAJ | 2024

    Free access