Iada*-rl: Anytime graph-based path planning with deep reinforcement learning for an autonomous uav

27Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

Path planning algorithms are of paramount importance in guidance and collision systems to provide trustworthiness and safety for operations of autonomous unmanned aerial vehicles (UAV). Previous works showed different approaches mostly focusing on shortest path discovery without a sufficient consideration on local planning and collision avoidance. In this paper, we propose a hybrid path planning algorithm that uses an anytime graph-based path planning algorithm for global planning and deep reinforcement learning for local planning which applied for a real-time mission planning system of an autonomous UAV. In particular, we aim to achieve a highly autonomous UAV mission planning system that is adaptive to real-world environments consisting of both static and moving obstacles for collision avoidance capabilities. To achieve adaptive behavior for real-world problems, a simulator is required that can imitate real environments for learning. For this reason, the simulator must be sufficiently flexible to allow the UAV to learn about the environment and to adapt to real-world conditions. In our scheme, the UAV first learns about the environment via a simulator, and only then is it applied to the real-world. The proposed system is divided into two main parts: optimal flight path generation and collision avoidance. A hybrid path planning approach is developed by combining a graph-based path planning algorithm with a learning-based algorithm for local planning to allow the UAV to avoid a collision in real time. The global path planning problem is solved in the first stage using a novel anytime incremental search algorithm called improved Anytime Dynamic A* (iADA*). A reinforcement learning method is used to carry out local planning between waypoints, to avoid any obstacles within the environment. The developed hybrid path planning system was investigated and validated in an AirSim environment. A number of different simulations and experiments were performed using AirSim platform in order to demonstrate the effectiveness of the proposed system for an autonomous UAV. This study helps expand the existing research area in designing efficient and safe path planning algorithms for UAVs.

References Powered by Scopus

Probabilistic roadmaps for path planning in high-dimensional configuration spaces

4980Citations
N/AReaders
Get full text

VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator

3245Citations
N/AReaders
Get full text

OctoMap: An efficient probabilistic 3D mapping framework based on octrees

2338Citations
N/AReaders
Get full text

Cited by Powered by Scopus

B-APFDQN: A UAV Path Planning Algorithm Based on Deep Q-Network and Artificial Potential Field

24Citations
N/AReaders
Get full text

A MINI REVIEW ON UAV MISSION PLANNING

23Citations
N/AReaders
Get full text

A Survey on UAV Applications in Smart City Management: Challenges, Advances, and Opportunities

20Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Maw, A. A., Tyan, M., Nguyen, T. A., & Lee, J. W. (2021). Iada*-rl: Anytime graph-based path planning with deep reinforcement learning for an autonomous uav. Applied Sciences (Switzerland), 11(9). https://doi.org/10.3390/app11093948

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 10

77%

Researcher 2

15%

Professor / Associate Prof. 1

8%

Readers' Discipline

Tooltip

Engineering 9

64%

Computer Science 5

36%

Save time finding and organizing research with Mendeley

Sign up for free