首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 687 毫秒
1.
In this paper, a distributed time-varying convex optimization problem with inequality constraints is discussed based on neurodynamic system. The goal is to minimize the sum of agents’ local time-varying objective functions subject to some time-varying inequality constraints, each of which is known only to an individual agent. Here, the optimal solution is time-varying instead of constant. Under an undirected and connected graph, a distributed continuous-time consensus algorithm is designed by using neurodynamic system, signum functions and log-barrier penalty functions. The proposed algorithm can be understood through two parts: one part is used to reach consensus and the other is used to achieve gradient descent to track the optimal solution. Theoretical studies indicate that all agents will achieve consensus and the proposed algorithm can track the optimal solution of the time-varying convex problem. Two numerical examples are provided to validate the theoretical results.  相似文献   

2.
  相似文献   

3.
This paper considers a class of optimal control problems governed by Markov jump systems. Our focus is to develop a computational method, based on the control parametrization approach, for solving this class of optimal control problems. Due to the existence of the continuous-time Markov chain, the optimal control problem under consideration is a stochastic optimal control problem, and hence the control parametrization technique cannot be applied directly. For this, a derandomization approach is introduced to obtain a representative deterministic optimal control problem. Then, the control parametrization method is applied to obtain an approximate finite dimensional optimization problem which can be computed numerically using the gradient-based optimization method. For this, the gradient formulas of the cost function and the constraint functions with respect to control variables are derived. Finally, a practical application involving a RLC circuit model is solved using the method proposed.  相似文献   

4.
一种新的椭球算法   总被引：2，自引：0，他引：2  
基于更动约束的思想[1 ] 与方法 ,提出了求解线性规划问题的新椭球算法 .它与L .G .Khachian的椭球算法[2 ] 不同 ,在新算法的椭球迭代过程中 ,不仅用约束不等式割掉不含约束集的半个椭球 (椭球中心不在约束集内时 ) ,称之为约束割 ;而且在椭球中心落在约束集内时 ,它用目标不等式割掉含约束集的半个椭球 ,称之为目标割 .新算法的不等式系统是由原规划 (或对偶规划 )的约束不等式与目标不等式组成的 (规模小 ) ,而不是由原椭球算法的K K T条件[5] 组成的不等式系统 (规模大 ) .这种新椭球算法即有多项式计算复杂性的特性 ,又在迭代过程中得到一系列单调趋向最优解的可行解 (在解存在时 ) .如果认为已得满意解 ,可随时停机 .对于实际问题 ,大多数是变量有界的 ,初始椭球不大 ,因此新算法更为实际 ,有效 .  相似文献   

5.
《Journal of The Franklin Institute》2022,359(18):10392-10419
This paper proposes a high-precision three-dimensional nonlinear optimal computational guidance law in the terminal phase of an interceptor that ensures near-zero miss-distance as well as the desired impact angle. Additionally, it achieves these ambitious objectives while ensuring that the lead angle and lateral acceleration constraints are not violated throughout its trajectory. This ensures (i) the target does not escape the field of view of its seeker at any point in time (a state constraint) and (ii) it does not demand unreasonable lateral acceleration that cannot be generated (a control constraint). The guidance problem is formulated and solved using newly proposed Path-constrained Model Predictive Static Programming (PC-MPSP) framework. All constraints, both equality and inequality, are equivalently represented as linear constraints in terms of the errors in the control history, thereby reducing the complexity and dimensionality of the problem significantly. Coupled with a quadratic cost function in control, the problem is then reduced to a standard quadratic optimization problem with linear constraints, which is then solved using the computationally efficient interior-point method. Results clearly demonstrate the advantage of the proposed guidance scheme over the conventional Biased PN as well as the recently proposed GENeralized EXplicit (GENEX) guidance techniques. Numerical simulations with variation in initial conditions and Monte–Carlo simulations with parametric uncertainty demonstrate the robustness of the proposed guidance scheme.  相似文献   

6.
In this paper, a numerical method to solve nonlinear optimal control problems with terminal state constraints, control inequality constraints and simple bounds on the state variables, is presented. The method converts the optimal control problem into a sequence of quadratic programming problems. To this end, the quasilinearization method is used to replace the nonlinear optimal control problem with a sequence of constrained linear-quadratic optimal control problems, then each of the state variables is approximated by a finite length Chebyshev series with unknown parameters. The method gives the information of the quadratic programming problem explicitly (The Hessian, the gradient of the cost function and the Jacobian of the constraints). To show the effectiveness of the proposed method, the simulation results of two constrained nonlinear optimal control problems are presented.  相似文献   

7.
The optimal control strategy constructed in the form of a state feedback is effective for small state perturbations caused by changes in modeling uncertainty. In this paper, we investigate a robust suboptimal feedback control (RSPFC) problem governed by a nonlinear time-delayed switched system with uncertain time delay arising in a 1,3-propanediol (1,3-PD) microbial fed-batch process. The feedback control strategy is designed based on the radial basis function to balance the two (possibly competing) objectives: (i) the system performance (concentration of 1,3-PD at the terminal time of the fermentation) is to be optimal; and (ii) the system sensitivity (the system performance with respect to the uncertainty of the time-delay) is to be minimized. The RSPFC problem is subject to the continuous state inequality constraints. An exact penalty method and a novel time scaling transformation approach are used to transform the RSPFC problem into the one subject only to box constraints. The resulting problem is solved by a hybrid optimization algorithm based on a filled function method and a gradient-based algorithm. Numerical results are given to verify the effectiveness of the developed hybrid optimization algorithm.  相似文献   

8.
This paper considers a nonsmooth constrained distributed convex optimization over multi-agent systems. Each agent in the multi-agent system only has access to the information of its objective function and constraint, and cooperatively minimizes the global objective function, which is composed of the sum of local objective functions. A novel continuous-time algorithm is proposed to solve the distributed optimization problem and effectively characterize the appropriate gain of the penalty function. It should be noted that the proposed algorithm is based on an adaptive strategy to avoid introducing the primal-dual variables and estimating the related exact penalty parameters. Additional, it is demonstrated that the state solution of the proposed algorithm achieves consensus and converges to an optimal solution of the optimization problem. Finally, numerical simulations are given and the proposed algorithm is applied to solve the optimal placement problem and energy consumption problem.  相似文献   

9.
This paper proposes two-stage continuous-time triggered algorithms for solving distributed optimization problems with inequality constraints over directed graphs. The inequality constraints are penalized by adopting log-barrier penalty method. The first stage of the proposed algorithms is capable of finding the optimal point of each local optimization problem in finite time. In the second stage of the proposed algorithms, zero-gradient-sum algorithms with time-triggered and event-triggered communication strategies are considered in order to reduce communication costs. Then, with the help of LaSalle’s invariance principle, it is proved that the state solution of each agent reaches consensus at the optimal point of the considered penalty distributed optimization problem, and Zeno behavior is also excluded. Finally, numerical examples are given to illustrate the effectiveness of the proposed algorithms.  相似文献   

10.
The problem of optimal switching between different subsystems/configurations with minimum dwell time constraints is investigated in this study and a feedback solution, using the framework of approximate dynamic programming, is proposed. The method calls for a tuning stage in which parameters of a function approximator are tuned. Online control will then be conducted with a computational load as low as evaluating a few scalar-valued functions. Finite-horizon and infinite-horizon cost functions are investigated and convergence and stability are analyzed considering the presence of approximation errors. Moreover, the case of applying a full or partial constraint on the mode sequence, as well as having a mode-dependent minimum dwell time are investigated. Finally, performance of the scheme in handling different challenges is numerically evaluated through different examples.  相似文献   

11.
Traditional approximate/adaptive dynamic programming (ADP) methods can handle a very special class of systems subject to symmetry constraints. In this study, I extend the exiting ADP to a broader class of nonlinear dynamic systems with asymmetry constraints. Firstly, I propose a novel nonquadratic cost function, based on which the developed optimal controller by solving Hamilton–Jacobi–Bellman equation can limit its value to arbitrarily prescribed bound. Then, to avoid “curse of dimensionality”, I approximately implement the addressed controller via single-network adaptive critic design. Fuzzy Hyperbolic Model is introduced to construct the single critic network by approximating optimal cost function, from which I further derive the optimal control law. The potential advantages are that the control structure is simple and the computational load is low. Lyapunov synthesis proves the ultimately uniformly bounded stability of closed-loop control system. Finally, numerical simulation results verify the efficiency and superiority of the proposed approach.  相似文献   

12.
The main control goal of the fed-batch process is to maximize the yield of target product as well as to minimize the operation costs simultaneously. Considering the existence of time delay and the switching nature in the fed-batch process, a time-delayed switched system is proposed to formulate the 1,3-propanediol (1,3-PD) production process. Some important properties of the system are also discussed. Taking the switching instants and the terminal time as the control variables, a free terminal time delayed optimal control problem is then presented. Using a time-scaling transformation and parameterizing the switching instants into new parameters, an equivalently optimal control problem is investigated. A numerical solution method is developed to seek the optimal control strategy by the smoothing approximation method and the gradient of the cost functional together with that of the constraints. Numerical results show that the mass of target product per unit time at the terminal time is increased considerably.  相似文献   

13.
In this paper, a novel backstepping-based adaptive dynamic programming (ADP) method is developed to solve the problem of intercepting a maneuver target in the presence of full-state and input constraints. To address state constraints, a barrier Lyapunov function is introduced to every backstepping procedure. An auxiliary design system is employed to compensate the input constraints. Then, an adaptive backstepping feedforward control strategy is designed, by which the tracking problem for strict-feedback systems can be reduced to an equivalence optimal regulation problem for affine nonlinear systems. Secondly, an adaptive optimal controller is developed by using ADP technique, in which a critic network is constructed to approximate the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation. Therefore, the whole control scheme consists of an adaptive feedforward controller and an optimal feedback controller. By utilizing Lyapunov's direct method, all signals in the closed-loop system are guaranteed to be uniformly ultimately bounded (UUB). Finally, the effectiveness of the proposed strategy is demonstrated by using a simple nonlinear system and a nonlinear two-dimensional missile-target interception system.  相似文献   

14.
Constrained control for stochastic linear systems is generally a difficult task due to the possible infeasibility of state constraints. In this paper, we focus on a finite control horizon and propose a design methodology where the constrained control problem is formulated as a chance-constrained optimization problem depending on some parameter. This parameter can be tuned so as to decide the appropriate trade-off between control cost minimization and state constraints satisfaction. An approximate solution is computed via a randomized algorithm. Precise guarantees about its feasibility for the original chance-constrained problem are provided. A numerical example shows the efficacy of the proposed methodology.  相似文献   

15.
In this paper, we first develop an adaptive shifted Legendre–Gauss (ShLG) pseudospectral method for solving constrained linear time-delay optimal control problems. The delays in the problems are on the state and/or on the control input. By dividing the domain of the problem into a uniform mesh based on the delay terms, the constrained linear time-delay optimal control problem is reduced to a quadratic programming problem. Next, we extend the application of the adaptive ShLG pseudospectral method to nonlinear problems through quasilinearization. Using this scheme, the constrained nonlinear time-delay optimal control problem is replaced with a sequence of constrained linear-quadratic sub-problems whose solutions converge to the solution of the original nonlinear problem. The method is called the iterative-adaptive ShLG pseudospectral method. One of the most important advantages of the proposed method lies in the case with which nonsmooth optimal controls can be computed when inequality constraints and terminal constraints on the state vector are imposed. Moreover, a comparison is made with optimal solutions obtained analytically and/or other numerical methods in the literature to demonstrate the applicability and accuracy of the proposed methods.  相似文献   

16.
An Impact Angle, Speed and Acceleration Control Guidance (IASAG) law against the stationary target is proposed, which is critical for the effectiveness of the air-to-surface guided weapons. It is hard to address multiple terminal constraints problem for unpowered missile, especially including terminal speed constraint, which is uncontrollable state. Based on Line-of-Sight (LOS) angle, a fourth-order polynomial function is designed to make the number of coefficients of the function equal to number of boundary conditions. Through analytic calculation and transformation, the relation between the specified boundary conditions and the coefficients are established. The coefficient equations are reduced to a univariate nonlinear equation whose solution is determined by terminal speed constraint. Based on the characteristic of the nonlinear equation, we propose a Particle Swarm Optimization(PSO) method to find the coefficient that satisfies terminal speed constraint. According to Lyapunov stability theory, an asymptotically stable trajectory tracking controller is designed to track the reference leading angle with respect to range-to-go to guarantee the impact angle, speed and acceleration constraints. The effectiveness of the proposed guidance law is verified through numerical simulations.  相似文献   

17.
A solution of the periodic problem in a nonlinear system comprising a single-valued symmetric nonlinearity (Lure system) and linear dynamics is presented. The solution is designed as an iterative application of Periodic Signal Mapping to refine the approximate solution obtained through the describing function method. The algorithm is based upon the transformation of the original nonlinear system into an equivalent nonlinear system for which the filtering hypothesis is satisfied exactly, and for that reason the latter being suitable for application of the developed algorithm. The solution sought for is a fixed point of the periodic signal mapping. Conditions of asymptotic convergence of the proposed algorithm are given. The proposed approach is illustrated by two examples of analysis of periodic motions in a relay feedback system and chattering in a terminal sliding mode.  相似文献   

18.
This paper investigates the optimal tracking control problem (OTCP) for nonlinear stochastic systems with input constraints under the dynamic event-triggered mechanism (DETM). Firstly, the OTCP is converted into the stabilizing optimization control problem by constructing a novel stochastic augmented system. The discounted performance index with nonquadratic utility function is formulated such that the input constraint can be encoded into the optimization problem. Then the adaptive dynamic programming (ADP) method of the critic-only architecture is employed to approximate the solutions of the OTCP. Unlike the conventional ADP methods based on time-driven mechanism or static event-triggered mechanism (SETM), the proposed adaptive control scheme integrates the DETM to further lighten the computing and communication loads. Furthermore, the uniform ultimately boundedness (UUB) of the critic weights and the tracking error are analysed with the Lyapunov theory. Finally, the simulation results are provided to validate the effectiveness of the proposed approach.  相似文献   

19.
This paper considers a stability analysis problem for continuous-time Markovian jump linear systems under aperiodic samplings which are represented as Markovian jump linear systems with input delay. For the systems, this paper constructs a Lyapunov functional by utilizing a fragmented-delay state, which is defined between the last sampling instant and the present time, and a new state space model of the fragmented state. Based on the Lyapunov functional, a stability criterion is derived in terms of linear matrix inequalities by using reciprocally convex approach and integral inequality. Here, the reciprocally convex approach and integral inequality are associated not only with the current state, the delayed state, and the maximum-admissible delay state, but also with the fragmented-delay state. The simulation result shows the effectiveness of the proposed stability criterion.  相似文献   

20.
A new control design approach is proposed for a class of nonlinear systems expressed by Takagi–Sugeno (T-S) fuzzy model, considering several objectives including robustness against input time-varying delay, input constraint satisfaction, and reference tracking. The proposed controller is designed on the basis of an augmented model, Lyapunov–Krasovskii functional, linear matrix inequality (LMI) tools, and parallel distributed compensation (PDC) approach. Proof of the input-to-state stability (ISS) criterion is provided for the error dynamics. Input constraint satisfaction is performed using a reference-management algorithm based on the linearized closed-loop system from the reference input to the constrained variables. In order to illustrate the effectiveness of the proposed control approach, simulations are performed on three practical examples, including a flexible-joint robot and a continuous stirred tank reactor (CSTR).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号