Decentralized cooperative unmanned aerial vehicles conflict resolution by neural network-based tree search method

11Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this article, a tree search algorithm is proposed to find the near optimal conflict avoidance solutions for unmanned aerial vehicles. In the dynamic environment, the unmodeled elements, such as wind, would make UAVs deviate from nominal traces. It brings about difficulties for conflict detection and resolution. The back propagation neural networks are utilized to approximate the unmodeled dynamics of the environment. To satisfy the online planning requirement, the search length of the tree search algorithm would be limited. Therefore, the algorithm may not be able to reach the goal states in search process. The midterm reward function for assessing each node is devised, with consideration given to two factors, namely, the safe separation requirement and the mission of each unmanned aerial vehicle. The simulation examples and the comparisons with previous approaches are provided to illustrate the smooth and convincing behaviours of the proposed algorithm.

Cite

CITATION STYLE

APA

Yang, J., Yin, D., Cheng, Q., Shen, L., & Tan, Z. (2016). Decentralized cooperative unmanned aerial vehicles conflict resolution by neural network-based tree search method. International Journal of Advanced Robotic Systems, 13(5), 1–14. https://doi.org/10.1177/1729881416663371

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free