For a nonlinear controlled system, a fixed-time approach problem is considered in which the target point location becomes known only at the start of motion. According to the proposed solution method, node resolving pr...
详细信息
For a nonlinear controlled system, a fixed-time approach problem is considered in which the target point location becomes known only at the start of motion. According to the proposed solution method, node resolving program controls corresponding to a finite collection of target points from the set of their admissible locations are computed in advance and a refined control for the target point given at the start of motion is determined via linear interpolation of the node controls. The procedure for designing such a resolving control is formulated in the form of two algorithms, one of which is run before the start of the motion, and the other is executed in real time while the system is moving. The error in the transfer of the system's state to the target point by applying these algorithms is estimated. As an example, we consider the approach problem for a modified Dubins car model and a target point about which only a compact set of its admissible locations is known before the start of motion.
The paper considers the evolutionary synthesis method of multi-criteria program control for dynamic systems. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimen...
详细信息
The paper considers the evolutionary synthesis method of multi-criteria program control for dynamic systems. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimensional multi-criteria optimization algorithms. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimensional multicriteria optimization algorithms. Finite-dimensional multi-criteria optimization evolutionary algorithms are used to construct a discrete approximation of epsilon-effective solutions set. Infinite-dimensional multicriteria optimization evolutionary algorithms implement the stage of clarifying search, represent generalization of possible directions methods and use epsilon-effective solutions as initial approximations. (C) 2021 The Authors. Published by Elsevier B.V.
The paper considers the evolutionary synthesis method of multi-criteria program control for dynamic systems. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimen...
详细信息
The paper considers the evolutionary synthesis method of multi-criteria program control for dynamic systems. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimensional multi-criteria optimization algorithms. A computational technology involves the combined using of evolutionary finite-dimensional and infinite-dimensional multicriteria optimization algorithms. Finite-dimensional multi-criteria optimization evolutionary algorithms are used to construct a discrete approximation of ε-effective solutions set. Infinite-dimensional multicriteria optimization evolutionary algorithms implement the stage of clarifying search, represent generalization of possible directions methods and use ε-effective solutions as initial approximations.
The method of statistical synthesis of algorithms for constructing training samples of neural network support of UAV's control process is developed. The statistical evaluation of UAV's effectiveness by means o...
详细信息
ISBN:
(纸本)9781728135649
The method of statistical synthesis of algorithms for constructing training samples of neural network support of UAV's control process is developed. The statistical evaluation of UAV's effectiveness by means of probability of achievement of the purpose on condition of the maximum and minimum of criterion of regularity is presented. The algorithm for generating control actions according to the target environment is implemented in the form of a trained onboard neural network.
Evolutionary algorithms for solving the problem of the optimal program control are considered. The most popular evolutionary algorithms, the genetic algorithm (GA), the differential evolution (DE) algorithm, the parti...
详细信息
Evolutionary algorithms for solving the problem of the optimal program control are considered. The most popular evolutionary algorithms, the genetic algorithm (GA), the differential evolution (DE) algorithm, the particle swarm optimization (PSO), the bat-inspired algorithm (BIA), the bees algorithm (BA), and the grey wolf optimizer (GWO) algorithm are described. An experimental analysis of these algorithms and their comparison with gradient methods are given. An experiment was carried out to solve the problem of the optimal control of a mobile robot with phase constraints. Indicators of the best objective functional value, the average value for several startups, and the standard deviation were used to compare the algorithms.
For an object whose dynamics obeys a system of ordinary differential equations, application of the methods of subdifferential and hypodifferential descent to the problem of program control of object dynamics was illus...
详细信息
For an object whose dynamics obeys a system of ordinary differential equations, application of the methods of subdifferential and hypodifferential descent to the problem of program control of object dynamics was illustrated.
Bstj 49: 10. December 1970: Tsps No. 1: Stored program control No. 1A. (Durney, G.R.; Kettler, H.W.; Prell, E.M.; Riddell, G.; Rohn, W.B. 2509-2560) by published by
Bstj 49: 10. December 1970: Tsps No. 1: Stored program control No. 1A. (Durney, G.R.; Kettler, H.W.; Prell, E.M.; Riddell, G.; Rohn, W.B. 2509-2560) by published by
The paper considers the problem of constructing program control for an object described by a system with nonsmooth (but only quasidifferentiable) right-hand side. The goal of control is to bring such a system from a g...
详细信息
The paper considers the problem of constructing program control for an object described by a system with nonsmooth (but only quasidifferentiable) right-hand side. The goal of control is to bring such a system from a given initial position to a given final state in certain finite time. The admissible controls are piecewise continuous and bounded vector-functions with values from some parallelepiped. The original problem is reduced to unconditional minimisation of some penalty functional which takes into account constraints in the form of differential equations, constraints on the initial and the final positions of the object as well as constraints on controls. Moreover, it is known that this functional vanishes on the solution of the original problem and only on it. The quasidifferentiability of this functional is proved, necessary and sufficient conditions for its minimum are written out in terms of quasidifferential. Further, in order to solve the obtained minimisation problem in the functional space the method of quasidifferential descent is applied. The algorithm developed is demonstrated by examples.
The paper proposes a constructive method for solving linear-quadratic problems of space-time control with amplitude constraints of controlling actions in systems with distributed parameters of parabolic type at a give...
详细信息
The paper proposes a constructive method for solving linear-quadratic problems of space-time control with amplitude constraints of controlling actions in systems with distributed parameters of parabolic type at a given accuracy of uniform approximation of the object final state to the required spatial distribution of the controlled quantity. The developed approach is based on the previously developed alternance method of constructing parameterizable algorithms of program control. It is demonstrated that the equations of optimal regulators are reduced to linear feedback algorithms on the measured state of the object with predetermined nonstationary transfer coefficients.
暂无评论