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

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2018/1092092/figures/1092092.fig.007a.svgz" name="1092092.fig.007a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Flight states</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2018/1092092/figures/1092092.fig.007b.svgz" name="1092092.fig.007b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Control variables</td></tr></table>

<div>Flight states and control variables of the UCAV.</div>

Mathematical Problems in Engineering

fig7

Figure 7

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