A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming (Q1720366): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129294635, #quickstatements; #temporary_batch_1730724369173 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129294635 / rank | |||
Normal rank |
Latest revision as of 13:47, 4 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming |
scientific article |
Statements
A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming (English)
0 references
8 February 2019
0 references
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.
0 references