共查询到20条相似文献，搜索用时 703 毫秒
1.
《Journal of The Franklin Institute》2022,359(2):859-869
In this paper, we considered a time-optimal control problem for a new type of linear parameter varying (LPV) system which is obtained through data identification in the process of dealing with actual problems. The addition of non-linear terms is compensation for the method that does not require linear expansion at the equilibrium point. Since the objective function is the terminal time which is an implicit function concerning decision variables, it is a non-standard optimal control problem with uncertain terminal time. To find the global optimal solution to this problem, firstly, the control parameterization method is used to transform it into a nonlinear optimization problem of parameter selection, and then the modifed particle swarm optimization (PSO) algorithm is combined to solve the equivalent nonlinear programming problem. Numerical examples are used to illustrate the effectiveness of the proposed algorithm. 相似文献
2.
3.
Application of non-dominated sorting genetic algorithm-II technique for optimal FACTS-based controller design 总被引：1，自引：0，他引：1
Sidhartha Panda 《Journal of The Franklin Institute》2010,347(7):1047-1064
Design of an optimal controller requires optimization of multiple performance measures that are often noncommensurable and competing with each other. Design of such a controller is indeed a multi-objective optimization problem. Non-dominated sorting in genetic algorithms-II (NSGA-II) is a popular non-domination based genetic algorithm for solving multi-objective optimization problems. This paper investigates the application of NSGA-II technique for the design of a flexible AC transmission system (FACTS)-based controller. The design objective is to improve the stability of the power system with minimum control effort. The proposed technique is applied to generate Pareto set of global optimal solutions to the given multi-objective optimization problem. Further, a fuzzy-based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto solution set. Further, a detailed analysis on the selection of control signals (both local and remote signals) on the effectiveness of the proposed controller is carried out and simulation results are presented under various loading conditions and disturbances to show the effectiveness and robustness of the proposed approach. 相似文献
4.
《Journal of The Franklin Institute》2002,339(4-5):479-498
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. 相似文献
5.
《Journal of The Franklin Institute》2022,359(8):3575-3596
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. 相似文献
6.
In this paper, the linear-quadratic-Gaussian (LQG) optimal control problem is considered and a robust minimax controller composed of the Kalman filter and the optimal regulator is synthesized to guarantee the asymptotic stability of the discrete time-delay systems under both parametric uncertainties and uncertain noise covariances. Designed procedures are finally elaborated with an illustrative example. 相似文献
7.
8.
9.
《Journal of The Franklin Institute》2019,356(12):6352-6372
In precision motion systems, well-designed feedforward control can effectively compensate for the reference-induced error. This paper aims to develop a novel data-driven iterative feedforward control approach for precision motion systems that execute varying reference tasks. The feedforward controller is parameterized with the rational basis functions, and the optimal parameters are sought to be solved through minimizing the tracking error. The key difficulty associated with the rational parametrization lies in the non-convexity of the parameter optimization problem. Hence, a new iterative parameter optimization algorithm is proposed such that the controller parameters can be optimally solved based on measured data only in each task irrespective of reference variations. Two simulation cases are presented to illustrate the enhanced performance of the proposed approach for varying tasks compared to pre-existing results. 相似文献
10.
Bond graph formulation of an optimal control problem for linear time invariant systems 总被引：1，自引：0，他引：1
A recent communication has proposed a conjectural procedure for representing a category of optimal control problems in bond graph language [W. Marquis-Favre, B. Chereji, D. Thomasset, S. Scavarda, Bond graph representation of an optimal control problem: the dc motor example, in: ICBGM’05 International Conference of Bond Graph Modelling and Simulation, New Orleans, USA, January 23-27, 2005, pp. 239-244]. This paper aims at providing a fundamental theory for proving the effectiveness of this procedure. The class of problem that the procedure can deal with has been extended. Its application was formerly restricted to linear time invariant siso system. The systems considered now are linear time invariant mimo systems. The optimization objective is the minimization of dissipation and input. The developments concerning the optimal control problem are based on the Pontryagin maximum principle and the proof of the effectiveness of the procedure makes a broad use of the port-Hamiltonian concept. As a result, the bond graph representation of the given optimization problem enables the analytical system, which provides the optimal solution, to be derived. The work presented in this paper is the first step in research with perspectives towards formulating dynamic optimization problems in bond graph and, towards coupling this formulation with a sizing methodology using bond graph language and a state-space inverse model approach. This sizing methodology, however, is not the topic of this paper and thus is not presented here. 相似文献
11.
《Journal of The Franklin Institute》2022,359(2):786-815
This paper addresses the design of a sampled-data model predictive control (MPC) strategy for linear parameter-varying (LPV) systems. A continuous-time prediction model, which takes into account that the samples are not necessarily periodic and that plant parameters vary continuously with time, is considered. Moreover, it is explicitly assumed that the value of the parameters used to compute the optimal control sequence is measured only at the sampling instants. The MPC approach proposed by Kothare et al. [1], where the basic idea consists in solving an infinite horizon guaranteed cost control problem at each sampling time using linear matrix inequalities (LMI) based formulations, is adopted. In this context, conditions for computing a sampled-data stabilizing LPV control law that provides a guaranteed cost for a quadratic performance criterion under input saturation are derived. These conditions are obtained from a parameter-dependent looped-functional and a parameter-dependent generalized sector condition. A strategy that consists in solving convex optimization problems in a receding horizon policy is therefore proposed. It is shown that the proposed strategy guarantees the feasibility of the optimization problem at each step and leads to the asymptotic stability of the origin. The conservatism reduction provided by the proposed results, with respect to similar ones in the literature, is illustrated through numerical examples. 相似文献
12.
《Journal of The Franklin Institute》2023,360(4):2955-2975
This paper focuses on binary optimal control of fed-batch fermentation of glycerol by Klebsiella pneumoniaewith pH feedback considering limited number of switches. To maximize the concentration of 1,3-propanediol at terminal time, we propose a binary optimal control problem subjected to time-coupled combinatorial constraint with the ratio of feeding rate of glycerol to that of NaOH as control variables. Based on time-scaling transformation and discretization, the binary optimal control problem is first transformed into a mixed binary parameter optimization problem consisting of not only continuous variables but also binary variables, which is then divided into two subproblems via combinatorial integral approximation decomposition. Finally, a novel fruit fly optimizer with modified sine cosine algorithm and adaptive maximum dwell rounding are applied to solve the obtained subproblems numerically. Numerical results show the rationality and feasibility of the proposed method. 相似文献
13.
Yueyang Li Hamid Reza Karimi Choon Ki Ahn Yuan Xu Dong Zhao 《Journal of The Franklin Institute》2018,355(7):3330-3353
This work deals with the problem of optimal residual generation for fault detection (FD) in linear discrete time-varying (LDTV) systems subject to uncertain observations. By introducing a generalized fault detection filter (FDF) with four parameter matrices as the residual generator, a novel FDF design scheme is formulated as two bi-objective optimization problems such that the sensitivity of residual to fault is enhanced and the robustness of residual to unknown input is simultaneously strengthened. A generalized operator based optimization approach is proposed to deduce solutions to the corresponding optimization problems in operator forms, where the related H∞/H∞ or FD performance index is maximized. With the aid of the addressed methods, the connections among the derived solutions are explicitly announced. The parameter matrices of the FDF are analytically derived via solving simple matrix equations recursively. It is revealed that our proposed results establish an operator-based framework of optimal residual generation for some kinds of linear discrete-time systems. Illustrative examples are given to show the applicability and effectiveness of the proposed methods. 相似文献
14.
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. 相似文献
15.
《Journal of The Franklin Institute》2001,338(2-3):113-132
This paper describes an investigation of dive recovery maneuvers of a jet fighter aircraft capable of flying at angles of attack in the post-stall region. In a dive recovery maneuver, the pilot attempts to return the aircraft to level flight at an airspeed such that level flight can be maintained afterward. This maneuver is needed after either an intentional dive or an unintentional dive, or as the terminal recovery stage from some unusual attitude, namely, combination of extremely low airspeed and very high flight path angle. The optimization criterion is the minimization of the maximum loss of altitude during the dive recovery; hence, the optimization problem is a minimax problem of optimal control. The flight dynamics model accounts for all of the factors necessary to accurately characterize the aircraft motion.The results show that the optimal dive recovery trajectories consist of one to three segments, depending on the initial speed and flight path angle. For relatively high initial speed, the optimal trajectory consists of a single segment: a pitch-up at the limiting load factor. For very low initial speed, the optimal trajectory consists of two segments: a supermaneuver flown at very large angles of attack, followed by a pitch-up at the limiting load factor. For unusual attitude recovery from the combination of very low initial speed and very high initial flight path angle, the optimal trajectory consists of three segments: a dive initiation segment, followed by a supermaneuver at very large angles of attack, followed by a pitch-up at the limiting load factor. For aircraft without supermaneuver capability, the supermaneuver segment is to be replaced by a maximum angle of attack segment. The paper concludes with a discussion of the design benefits accrued via supermaneuver capability as well as the operational benefits accrued via afterburner usage. 相似文献
16.
Nassim Tahouni M. Hassan Panjeshahi Abtin Ataei 《Journal of The Franklin Institute》2011,348(7):1456-2446
A great deal of attention has been paid to design and optimization of low-temperature liquefaction and gas separation problems over the past years, due to their difficult nature. In this paper, two approaches featuring sequential and simultaneous methods for selection and arrangement of sub-ambient separation systems and their associated refrigeration cycles are compared. The effect of ignoring heat integration within the separation system and between the separation and refrigeration systems is addressed as well as fixing the sequence order of separation. The optimization is carried out using two famous stochastic search methods i.e. Genetic Algorithm (GA) and Simulated Annealing (SA). Three case studies are examined to illustrate the significant differences between optimization results. Also, the design optimality is re-checked with respect to usage of different refrigerants and the resulting structure is verified by application of a comprehensive exergy analysis. 相似文献
17.
The identification of linear, discrete time, scalar output systems which are driven exclusively by white, zero mean, inaccessible noise sequences is discussed. Two principal results are presented. First, two methods (least squares and an autocorrelation technique) for identifying the system characteristic equation coefficients are compared. The least squares approach is shown to be biased except for special cases. In general, the bias cannot be removed. If the state transition matrix is of the phase variable form, bias removal requires a knowledge of the measurement noise variance and all but one of the state driving noise variances. The autocorrelation technique is not biased asymptotically and does not require a knowledge of the noise variances.Secondly, it is shown that the m2 elements of the state transition matrix cannot be identified uniquely from the scalar output sequence autocorrelation coefficients if the system order is higher than one. The implication of this uncertainty in the state transition matrix on optimal filtering of the output sequence is briefly discussed. 相似文献
18.
《Journal of The Franklin Institute》2023,360(10):6929-6952
Self-driving vehicles must be equipped with path tracking capability to enable automatic and accurate identification of the reference path. Model Predictive Controller (MPC) is an optimal control method that has received considerable attention for path tracking, attributed to its ability to handle control problems with multiple constraints. However, if the data acquired for determining the reference path is contaminated by non-Gaussian noise and outliers, the tracking performance of MPC would degrades significantly. To this end, Correntropy-based MPC (CMPC) is proposed in this paper to address the issue. Different from the conventional MPC model, the objective of CMPC is constructed using the robust metric Maximum Correntropy Criterion (MCC) to transform the optimization problem of MPC to a non-concave problem with multiple constraints, which is then solved by the Block Coordinate Update (BCU) framework. To find the solution efficiently, the linear inequality constraints of CMPC are relaxed as a penalty term. Furthermore, an iterative algorithm based on Fenchel Conjugate (FC) and the BCU framework is proposed to solve the relaxed optimization problem. It is shown that both objective sequential convergence and iterate sequence convergence are satisfied by the proposed algorithm. Simulation results generated by CarSim show that the proposed CMPC has better performance than conventional MPC in path tracking when noise and outliers exist. 相似文献
19.
《Journal of The Franklin Institute》2021,358(18):9909-9928
In this paper, the finite horizon tracking control problem of probabilistic Boolean control networks (PBCNs) is studied. For a given reference output trajectory, two trackability definitions are introduced according to whether the tracking probability is 1. Under the framework of the semi-tensor product, some necessary and sufficient conditions are obtained to determine whether the reference output trajectory is trackable with probability (probability one) by a PBCN starting from a given initial state. Based on this, two algorithms are proposed to determine the maximum tracking probability and the corresponding optimal control policy sequence. By determining the tracking error of the reference output trajectory, two related optimal control problems are considered: one is to minimize the expected value of the total tracking error, and the other is to minimize the maximum tracking error. Inspired by dynamic programming, corresponding algorithms are given to solve these two problems. Finally, two examples are given to verify the validity and correctness of the results. 相似文献
20.
This paper addresses the problem of local exponential stabilization via boundary feedback controllers for a class of nonlinear distributed parameter processes described by a scalar semi-linear parabolic partial differential equation (PDE). Both the domain-averaged measurement form and the boundary measurement form are considered. For the boundary measurement form, the collocated boundary measurement case and the non-collocated boundary measurement case are studied, respectively. For both domain-averaged measurement case and collocated boundary measurement case, a static output feedback controller is constructed. An observer-based output feedback controller is constructed for the non-collocated boundary measurement case. It is shown by the contraction semigroup theory and the Lyapunov’s direct method that the resulting closed-loop system has a unique classical solution and is locally exponentially stable under sufficient conditions given in term of linear matrix inequalities (LMIs). The estimation of domain of attraction is also discussed for the resulting closed-loop system in this paper. Finally, the effectiveness of the proposed control methods is illustrated by a numerical example. 相似文献