Aviation radio control systems as complex technical systems. Part 2. Multicriteria optimization based on a local modification of the statistical theory of optimal control

Author(s):  
V.S. Verba ◽  
V.I. Merkulov

The analysis of the known modifications of the statistical theory of optimal control (STOC) in the application to the problem of multicriteria optimization of radio control (RC) systems showed that for its solution, a variant that takes into account the measured perturbations in the state model can be used as a basis. The physical meaning of this approach is that of all the alternatives, one is chosen, conditionally the main one, for which a state model is formed. The remaining participants in the general synthesis procedure are considered as a set of perturbations acting on this model. Accordingly, in the quality functional used, the terms that ensure the minimization of these perturbations should be taken into account in the form of an additional linear combination of quadratic forms. Management that minimizes such functionality, to one degree or another, will be jointly the best for the entire set of requirements. The choice of the local optimization option is based on the desire to avoid the need to solve a very computationally expensive twopoint boundary value problem, which is characteristic of the optimization procedures of systems for the entire time of operation, and to ensure invariance to the time of operation. The analysis of the obtained control law allows us to formulate the following conclusions. The control contains two terms, one of which implements the main purpose of the system, providing an approximation of the real state to the required one, and the second takes into account the influence of alternative requirements. The optimized system should include optimal filters that form estimates of the necessary state coordinates, and a controller that forms a control signal. The obtained result indicates that it is possible to optimize management within the framework of solving a multicriteria task (MCT) without solving a complex two-point boundary value problem. If necessary, you can choose another version of the main model with a different set of auxiliary tasks and the corresponding functionality as the main task, with a different control option. In the process of comparing the obtained control options, you can choose the best solution to the general optimization problem. Considered as an example, the law of controlling a group of three initially geographically separated and moving in different directions unmanned aerial vehicles used for radar monitoring of large areas of the earth (water) surface, which at the same time should provide the collection of the group, the required trajectory of its flight and the required topology of participants implementing a given control band, confirmed the possibility of solving the MCT based on STOC.

2019 ◽  
Vol 20 (6) ◽  
pp. 367-375
Author(s):  
O. N. Korsun ◽  
A. V. Stulovskii

The article deals with the problem of program control design for a dynamic object defined by a nonlinear system of differential equations. Known methods of optimal control require the two-point boundary value problem solution, which in general is coupled with fundamental difficulties. Therefore, this paper proposes a technique that uses the direct method, in which the functional is minimized directly using a population-based algorithm. The use of direct methods is based on the assumption that control signals may be defined by a finite set of parameters. Then a scalar functional is formed, the numerical value of which measures the quality of the obtained solutions. In this case, the search for optimal control is reduced to the problem of single-criterion multi-parameter optimization. The practical importance of this approach is that it eliminates the need to solve a two-point boundary value problem. However, this results in another difficulty, since the approximation of control, in general, requires a large number of parameters. It is known that in this case, the effectiveness of conventional gradient numerical optimization methods decreases markedly. Therefore, it is proposed to take the next step and apply genetic or population-based optimization algorithms that have confirmed their performance in solving this class of problems. For this purpose the paper uses one of the modifications of the particle swarm algorithm. The technique is applied to a test problem describing the spatial movement of a maneuverable aircraft. The direct method is compared with two classical solutions based on the condition that the partial control derivatives of the Hamilton function are equal to zero and with the condition of Hamilton function maximum over controls (Pontryagin’s maximum principle). The presented results show the high degree of similarity between obtained controls for all considered methods of selecting the target functional. At the same time, the accuracy of classical algorithms turns out to be slightly worse, and they show a higher sensitivity to the quality of the initial approximation. Thus, the obtained results confirm the approximate equivalence of the direct method and the classical methods of program control design, at least for the class of problems under consideration. The practical significance of this research is that the use of the direct method is much simpler than solving a two-point boundary value problem necessary for classical algorithms.


2017 ◽  
Vol 24 (19) ◽  
pp. 4505-4512 ◽  
Author(s):  
Amin Jajarmi ◽  
Mojtaba Hajipour ◽  
Dumitru Baleanu

The aim of this study is to develop an efficient iterative approach for solving a class of time-delay optimal control problems with time-varying delay and external persistent disturbances. By using the internal model principle, the original time-delay model with disturbance is first converted into an augmented system without any disturbance. Then, we select a quadratic performance index for the augmented system to form an undisturbed time-delay optimal control problem. The necessary optimality conditions are then derived in terms of a two-point boundary value problem involving advance and delay arguments. Finally, a fast iterative algorithm is designed for the latter advance-delay boundary value problem. The convergence of the new iterative technique is also investigated. Numerical simulations verify that the proposed approach is efficient and provides satisfactory results.


2001 ◽  
Vol 42 (3) ◽  
pp. 324-340 ◽  
Author(s):  
Laurence Mays ◽  
John Norbury

AbstractAnalytical, approximate and numerical methods are used to study the Neumann boundary value problem− uxx + q2u = u2(1 + sin x), for 0 < x < π,subject to ux(0) = 0, ux(π) = 0,for q2 ∈ (0,∞). Asymptotic approximations to (1) are found for q2 small and q2 large. In the case where q2 is large u(x) ≈ 3qδ(x − π/2). When q2 = 0 we show that the only possible solution is u ≡ 0. However, there exist non-zero solutions for q2 > 0 as well as the trivial solution u ≡ 0. To O(q4) in the q2 small case u(x) = q2π(π + 2)−1, so that bifurcation occurs about the trivial solution branch u ≡ 0 at the first eigenvalue λ0 = 0 and in the direction of the first eigenfunction ξ0 = constant.We obtain a bifurcation diagram for (1), which confirms that there exists a positive solution for q2 ∈ (0, 10). Symmetry-breaking bifurcations and blow-up behaviour occur on certain regions of the diagram. We show that all non-trival solutions to the problem must be positive.The formal outer solution u = q2û appears to satisfy û = û2(1 + sin x), so that û ≡ 0 and û = (1 + sin x)−1 are possible limit solutions. However, in the non-trivial case ûx(0) = −1 and ûx(π) = 1; this means that û does not satisfy the boundary conditions required for a solution of (1). This behaviour usually implies that for q2 large a boundary layer exists near x = 0 (and one near x = π), which corrects the slope. However, we find no evidence for such a solution structure, and only find perturbations in the direction of a delta function about u ≡ 0. We show using the monotone convergence theorem for quadratic forms that the inverse of the operator on the left-hand side of (1) is strongly convergent as q2 → ∞. We show that strong convergence of the operator is sufficient to stop outer-layer behaviour occurring.


Sign in / Sign up

Export Citation Format

Share Document