This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optim...This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optimally controlled discrete-time system.The proposed method overcomes the limitations of previous approaches by eliminating the need for the invertible Jacobian assumption.It calculates the possible-solution spaces and their intersections sequentially until the dimension of the intersection space decreases to one.The remaining one-dimensional vector of the possible-solution space’s intersection represents the SIOC solution.The paper presents clear conditions for convergence and addresses the issue of noisy data by clarifying the conditions for the singular values of the matrices that relate to the possible-solution space.The effectiveness of the proposed method is demonstrated through simulation results.展开更多
A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which i...A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.展开更多
This paper investigates an analytical optimal pose tracking control problem for chaser spacecraft during the close-range proximity operations with a non-cooperative space target subject to attitude tumbling and unknow...This paper investigates an analytical optimal pose tracking control problem for chaser spacecraft during the close-range proximity operations with a non-cooperative space target subject to attitude tumbling and unknown orbital maneuvering.Firstly,the relative translational motion between the orbital target and the chaser spacecraft is described in the Line-of-Sight(LOS)coordinate frame along with attitude quaternion dynamics.Then,based on the coupled 6-Degree of Freedom(DOF)pose dynamic model,an analytical optimal control action consisting of constrained optimal control value,application time and its duration are proposed via exploring the iterative sequential action control algorithm.Meanwhile,the global closed-loop asymptotic stability of the proposed predictive control action is presented and discussed.Compared with traditional proximity control schemes,the highlighting advantages are that the application time and duration of the devised controller is applied discretely in light of the influence of the instantaneous pose configuration on the pose tracking performance with less energy consumptions rather than at each sample time.Finally,three groups of illustrative examples are organized to validate the effectiveness of the proposed analytical optimal pose tracking control scheme.展开更多
An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) ...An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) based algorithm that derives its search directions by solving quadratic programming(QP) subproblems via an infeasible interior point method(IIPM) and evaluates step length adaptively via a simple line search and/or a quadratic search algorithm depending on the termination of the IIPM solver.The task of tuning PI/PID parameters for the first-and second-order systems was modeled as constrained NLP problem. SQP/IIPM algorithm was applied to determining the optimum parameters for the PI/PID control systems.To assess the performance of the proposed method,a Matlab simulation of PID controller tuning was conducted to compare the proposed SQP/IIPM algorithm with the gain and phase margin(GPM) method and Ziegler-Nichols(ZN) method.The results reveal that,for both step and impulse response tests,the PI/PID controller using SQP/IIPM optimization algorithm consistently reduce rise time,settling-time and remarkably lower overshoot compared to GPM and ZN methods,and the proposed method improves the robustness and effectiveness of numerical optimization of PID control systems.展开更多
The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is n...The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is natural to extract two features connected with the classical theorem. The first of them consists in its possible “impracticability” (the Kuhn-Tucker vector does not exist). The second feature is connected with possible “instability” of the classical theorem with respect to the errors in the initial data. The article deals with the so-called regularized Kuhn-Tucker theorem in nondifferential sequential form which contains its classical analogue. A proof of the regularized theorem is based on the dual regularization method. This theorem is an assertion without regularity assumptions in terms of minimizing sequences about possibility of approximation of the solution of the convex programming problem by minimizers of its regular Lagrangian, that are constructively generated by means of the dual regularization method. The major distinctive property of the regularized Kuhn-Tucker theorem consists that it is free from two lacks of its classical analogue specified above. The last circumstance opens possibilities of its application for solving various ill-posed problems of optimization, optimal control, inverse problems.展开更多
为实现混合动力系统在电池荷电状态(state of charge,SOC)平衡以及动力性约束下的经济性提升,提出了基于偏好强化学习的混合动力能量管理策略,该策略将能量管理问题建模为马尔科夫决策过程,采用深度神经网络建立输入状态值到最优动作控...为实现混合动力系统在电池荷电状态(state of charge,SOC)平衡以及动力性约束下的经济性提升,提出了基于偏好强化学习的混合动力能量管理策略,该策略将能量管理问题建模为马尔科夫决策过程,采用深度神经网络建立输入状态值到最优动作控制输出的函数映射关系。与传统的强化学习控制算法相比,偏好强化学习算法无需设定回报函数,只需对多动作进行偏好判断即可实现网络训练收敛,克服了传统强化学习方法中回报函数加权归一化设计难题。通过仿真试验和硬件在环验证了所提出能量管理策略的有效性和可行性。结果表明,与传统强化学习能量管理策略相比,该策略能够在满足混合动力车辆SOC平衡和动力性约束下,提升经济性4.6%~10.6%。展开更多
储能配合风电参与调频可以改善一次调频效果,但储能荷电状态(state of charge,SOC)接近上下限值时会出现储能功率不足,此时储能SOC保护与调频效果很难兼顾。综合考虑风速和负荷随机变化的复杂工况下的调频需求,提出一种考虑储能SOC的风...储能配合风电参与调频可以改善一次调频效果,但储能荷电状态(state of charge,SOC)接近上下限值时会出现储能功率不足,此时储能SOC保护与调频效果很难兼顾。综合考虑风速和负荷随机变化的复杂工况下的调频需求,提出一种考虑储能SOC的风储联合调频控制策略,在SOC处于标准值附近时储能以最大下垂系数充放电,在储能SOC偏高或偏低时采用考虑SOC自适应的充放电控制策略保护SOC,同时风电机组通过变下垂控制弥补储能出力不足,以此改善调频效果。最后,通过MATLAB/Simulink仿真及风−储联合调频实验平台进行验证。实验结果表明,相比一次调频和SOC自适应调频方法,本文所提策略的频率偏移度及SOC偏移度均有明显降低,所提控制策略兼顾了调频效果及SOC保护。展开更多
提出一种考虑分布式光伏无功和储能有功参与的配电网电压分层控制方法。首先,分析了由分布式光伏与负荷时空不匹配引起的高/低电压问题,依据配电网拓扑以及线路参数计算得到配电网节点电压与注入功率的无功-电压、有功-电压近似灵敏度...提出一种考虑分布式光伏无功和储能有功参与的配电网电压分层控制方法。首先,分析了由分布式光伏与负荷时空不匹配引起的高/低电压问题,依据配电网拓扑以及线路参数计算得到配电网节点电压与注入功率的无功-电压、有功-电压近似灵敏度矩阵。其次,在第一层控制中,提出了分布式光伏参与配电网调压的无功-电压下垂系数优化控制方法,通过求解电压优化模型得到分布式光伏逆变器的最优下垂系数,从而计算出其无功输出。当光伏逆变器的无功容量不足时,提出了第二层控制,即储能参与调压的有功-电压自适应下垂控制策略,储能逆变器的下垂控制系数根据储能荷电状态(state of charge,SOC)与所在节点电压自适应调整,既考虑了储能的容量,又实现了储能功率和SOC的相对均衡控制。最后,以一实际10节点配电网系统作为算例验证了所提方法的有效性。展开更多
We show that“full-bang”control is optimal in a problem which combines features of(i)sequential least-squares estimation with Bayesian updating,for a random quantity observed in a bath of white noise;(ii)bounded cont...We show that“full-bang”control is optimal in a problem which combines features of(i)sequential least-squares estimation with Bayesian updating,for a random quantity observed in a bath of white noise;(ii)bounded control of the rate at which observations are received,with a superquadratic cost per unit time;and(iii)“fast”discretionary stopping.We develop also the optimal filtering and stopping rules in this context.展开更多
文摘This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optimally controlled discrete-time system.The proposed method overcomes the limitations of previous approaches by eliminating the need for the invertible Jacobian assumption.It calculates the possible-solution spaces and their intersections sequentially until the dimension of the intersection space decreases to one.The remaining one-dimensional vector of the possible-solution space’s intersection represents the SIOC solution.The paper presents clear conditions for convergence and addresses the issue of noisy data by clarifying the conditions for the singular values of the matrices that relate to the possible-solution space.The effectiveness of the proposed method is demonstrated through simulation results.
文摘A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.
基金This study was co-supported by the National Natural Science Foundation of China(Nos.62003371,62373379,62103446,61273351,62073343)the Outstanding Youth Fund of Hunan Provincial Natural Science,China(No.2022JJ20081)the Innovation Driven Project of Central South University,China(No.2023CXQD066).
文摘This paper investigates an analytical optimal pose tracking control problem for chaser spacecraft during the close-range proximity operations with a non-cooperative space target subject to attitude tumbling and unknown orbital maneuvering.Firstly,the relative translational motion between the orbital target and the chaser spacecraft is described in the Line-of-Sight(LOS)coordinate frame along with attitude quaternion dynamics.Then,based on the coupled 6-Degree of Freedom(DOF)pose dynamic model,an analytical optimal control action consisting of constrained optimal control value,application time and its duration are proposed via exploring the iterative sequential action control algorithm.Meanwhile,the global closed-loop asymptotic stability of the proposed predictive control action is presented and discussed.Compared with traditional proximity control schemes,the highlighting advantages are that the application time and duration of the devised controller is applied discretely in light of the influence of the instantaneous pose configuration on the pose tracking performance with less energy consumptions rather than at each sample time.Finally,three groups of illustrative examples are organized to validate the effectiveness of the proposed analytical optimal pose tracking control scheme.
基金Project(60874070) supported by the National Natural Science Foundation of ChinaProject(20070533131) supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject supported by the Scientific Research Foundation for the Returned Overseas Chinese Scholars,Ministry of Education of China
文摘An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) based algorithm that derives its search directions by solving quadratic programming(QP) subproblems via an infeasible interior point method(IIPM) and evaluates step length adaptively via a simple line search and/or a quadratic search algorithm depending on the termination of the IIPM solver.The task of tuning PI/PID parameters for the first-and second-order systems was modeled as constrained NLP problem. SQP/IIPM algorithm was applied to determining the optimum parameters for the PI/PID control systems.To assess the performance of the proposed method,a Matlab simulation of PID controller tuning was conducted to compare the proposed SQP/IIPM algorithm with the gain and phase margin(GPM) method and Ziegler-Nichols(ZN) method.The results reveal that,for both step and impulse response tests,the PI/PID controller using SQP/IIPM optimization algorithm consistently reduce rise time,settling-time and remarkably lower overshoot compared to GPM and ZN methods,and the proposed method improves the robustness and effectiveness of numerical optimization of PID control systems.
文摘The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is natural to extract two features connected with the classical theorem. The first of them consists in its possible “impracticability” (the Kuhn-Tucker vector does not exist). The second feature is connected with possible “instability” of the classical theorem with respect to the errors in the initial data. The article deals with the so-called regularized Kuhn-Tucker theorem in nondifferential sequential form which contains its classical analogue. A proof of the regularized theorem is based on the dual regularization method. This theorem is an assertion without regularity assumptions in terms of minimizing sequences about possibility of approximation of the solution of the convex programming problem by minimizers of its regular Lagrangian, that are constructively generated by means of the dual regularization method. The major distinctive property of the regularized Kuhn-Tucker theorem consists that it is free from two lacks of its classical analogue specified above. The last circumstance opens possibilities of its application for solving various ill-posed problems of optimization, optimal control, inverse problems.
文摘为实现混合动力系统在电池荷电状态(state of charge,SOC)平衡以及动力性约束下的经济性提升,提出了基于偏好强化学习的混合动力能量管理策略,该策略将能量管理问题建模为马尔科夫决策过程,采用深度神经网络建立输入状态值到最优动作控制输出的函数映射关系。与传统的强化学习控制算法相比,偏好强化学习算法无需设定回报函数,只需对多动作进行偏好判断即可实现网络训练收敛,克服了传统强化学习方法中回报函数加权归一化设计难题。通过仿真试验和硬件在环验证了所提出能量管理策略的有效性和可行性。结果表明,与传统强化学习能量管理策略相比,该策略能够在满足混合动力车辆SOC平衡和动力性约束下,提升经济性4.6%~10.6%。
文摘储能配合风电参与调频可以改善一次调频效果,但储能荷电状态(state of charge,SOC)接近上下限值时会出现储能功率不足,此时储能SOC保护与调频效果很难兼顾。综合考虑风速和负荷随机变化的复杂工况下的调频需求,提出一种考虑储能SOC的风储联合调频控制策略,在SOC处于标准值附近时储能以最大下垂系数充放电,在储能SOC偏高或偏低时采用考虑SOC自适应的充放电控制策略保护SOC,同时风电机组通过变下垂控制弥补储能出力不足,以此改善调频效果。最后,通过MATLAB/Simulink仿真及风−储联合调频实验平台进行验证。实验结果表明,相比一次调频和SOC自适应调频方法,本文所提策略的频率偏移度及SOC偏移度均有明显降低,所提控制策略兼顾了调频效果及SOC保护。
文摘提出一种考虑分布式光伏无功和储能有功参与的配电网电压分层控制方法。首先,分析了由分布式光伏与负荷时空不匹配引起的高/低电压问题,依据配电网拓扑以及线路参数计算得到配电网节点电压与注入功率的无功-电压、有功-电压近似灵敏度矩阵。其次,在第一层控制中,提出了分布式光伏参与配电网调压的无功-电压下垂系数优化控制方法,通过求解电压优化模型得到分布式光伏逆变器的最优下垂系数,从而计算出其无功输出。当光伏逆变器的无功容量不足时,提出了第二层控制,即储能参与调压的有功-电压自适应下垂控制策略,储能逆变器的下垂控制系数根据储能荷电状态(state of charge,SOC)与所在节点电压自适应调整,既考虑了储能的容量,又实现了储能功率和SOC的相对均衡控制。最后,以一实际10节点配电网系统作为算例验证了所提方法的有效性。
基金Erik Ekström acknowledges the support from the Swedish Research Council(Grant No.2019-03525)Ioannis Karatzas acknowledges the support from the National Science Foundation(Grant No.NSF-DMS-20-04977).
文摘We show that“full-bang”control is optimal in a problem which combines features of(i)sequential least-squares estimation with Bayesian updating,for a random quantity observed in a bath of white noise;(ii)bounded control of the rate at which observations are received,with a superquadratic cost per unit time;and(iii)“fast”discretionary stopping.We develop also the optimal filtering and stopping rules in this context.