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

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Hao-xiang Chen ◽  
Ying Nan ◽  
Yi Yang

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.

2001 ◽  
Vol 7 (2) ◽  
pp. 155-175 ◽  
Author(s):  
H. W. J. Lee ◽  
X. Q. Cai ◽  
K. L. Teo

A manpower planning problem is studied in this paper. The model includes scheduling different types of workers over different tasks, employing and terminating different types of workers, and assigning different types of workers to various trainning programmes. The aim is to find an optimal way to do all these while keeping the time-varying demand for minimum number of workers working on each different tasks satisfied. The problem is posed as an optimal discrete-valued control problem in discrete time. A novel numerical scheme is proposed to solve the problem, and an illustrative example is provided.


Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6919
Author(s):  
Tao Song ◽  
Xiang Huo ◽  
Xinkai Wu

The path planning for target searching in mobile robots is critical for many applications, such as warehouse inspection and caring and surveillance for elderly people in the family scene. To ensure visual complete coverage from the camera equipped in robots is one of the most challenging tasks. To tackle this issue, we propose a two-stage optimization model to efficiently obtain an approximate optimal solution. In this model, we first develop a method to determine the key locations for visual complete coverage of a two-dimensional grid map, which is constructed by drawing lessons from the method of corner detection in the image processing. Then, we design a planning problem for searching the shortest path that passes all key locations considering the frequency of target occurrence. The testing results show that the proposed algorithm can achieve the significantly shorter search path length and the shorter target search time than the current Rule-based Algorithm and Genetic Algorithm (GA) in various simulation cases. Furthermore, the results show that the improved optimization algorithm with the priori known frequency of occurrence of the target can further improve the searching with shorter searching time. We also set up a test in a real environment to verify the feasibility of our algorithm.


2004 ◽  
Vol 8 (2) ◽  
pp. 250-271 ◽  
Author(s):  
RAOUF BOUCEKKINE ◽  
CAGRI SAGLAM ◽  
THOMAS VALLE

Author(s):  
Jill Reid ◽  
Lotfi Tadj

We consider in this paper the integrated marketing – production planning problem and propose an optimal control approach to derive the optimal solution. The state variables are the inventory level and the stock of goodwill and the control variables are the production rate and the advertising rate. Both cases where the firm adopts a continuous-review and a periodic-review policy are considered. The optimal states and controls are obtained explicitly. Illustrative examples are presented. Sensitivity analysis shows the effect of some system parameters on the optimal solution.


Sign in / Sign up

Export Citation Format

Share Document