A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming
type: Item
instance of: scholarly article
title: A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming
zbMATH Open document ID: 1426.93202
DOI: 10.1155/2018/1092092
author: Hao-xiang Chen
author: Ying Nan
author: Yi Yang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: We present a two-stage method for solving the terrain following (TF)/terrain avoidance (TA) path-planning problem for unmanned combat air vehicles (UCAVs). The 1st stage of planning takes an optimization approach for generating a 2D path on a horizontal plane with no collision with the terrain. In the 2nd stage of planning, an optimal control approach is adopted to generate a 3D flyable path for the UCAV that is as close as possible to the terrain. An approximate dynamic programming (ADP) algorithm is used to solve the optimal control problem in the 2nd stage by training an action network to approximate the optimal solution and training a critical network to approximate the value function. Numerical simulations indicate that ADP can determine the optimal control variables for UCAVs; relative to the conventional optimization method, the optimal control approach with ADP shows a better performance under the same conditions.
Mathematics Subject Classification ID: 93C85
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68T40
zbMATH DE Number: 7018453
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/1092092
OpenAlex ID: W2891636205
cites work: A survey of motion planning algorithms from the perspective of autonomous UAV guidance
cites work: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
Wikidata QID: Q129294635
description: scientific article; zbMATH DE number 7018453