A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming

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 t...

Full description

Bibliographic Details
Main Authors: Hao-xiang Chen, Ying Nan, Yi Yang
Format: Article
Language:English
Published: Hindawi Limited 2018-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2018/1092092
id doaj-5e5658bbcb6e4f1eba562a70ae3a22dd
record_format Article
spelling doaj-5e5658bbcb6e4f1eba562a70ae3a22dd2020-11-25T00:04:47ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472018-01-01201810.1155/2018/10920921092092A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic ProgrammingHao-xiang Chen0Ying Nan1Yi Yang2Nanjing University of Aeronautics and Astronautics, Nanjing 20016, ChinaNanjing University of Aeronautics and Astronautics, Nanjing 20016, ChinaNanjing University of Aeronautics and Astronautics, Nanjing 20016, ChinaWe 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.http://dx.doi.org/10.1155/2018/1092092
collection DOAJ
language English
format Article
sources DOAJ
author Hao-xiang Chen
Ying Nan
Yi Yang
spellingShingle Hao-xiang Chen
Ying Nan
Yi Yang
A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
Mathematical Problems in Engineering
author_facet Hao-xiang Chen
Ying Nan
Yi Yang
author_sort Hao-xiang Chen
title A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
title_short A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
title_full A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
title_fullStr A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
title_full_unstemmed A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
title_sort two-stage method for ucav tf/ta path planning based on approximate dynamic programming
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2018-01-01
description 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.
url http://dx.doi.org/10.1155/2018/1092092
work_keys_str_mv AT haoxiangchen atwostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
AT yingnan atwostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
AT yiyang atwostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
AT haoxiangchen twostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
AT yingnan twostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
AT yiyang twostagemethodforucavtftapathplanningbasedonapproximatedynamicprogramming
_version_ 1725428003694968832