Robust optimal operation of continuous catalytic reforming process under feedstock uncertainty

The continuous catalytic regenerative (CCR) reforming process is one of the most significant sources of hydrogen production in the petroleum refining process. However, the fluctuations in feedstock composition and flow rate could significantly affect both product distribution and energy consumption. In this study, a robust deviation criterion based multi-objective optimization approach is proposed to perform the optimal operation of CCR reformer under feedstock uncertainty, with simultaneous maximization of product yields and minimization of energy consumption. Minimax approach is adopted to handle these uncertain objectives, and the Latin hypercube sampling method is then used to calculate these robust deviation criteria. Multi-objective surrogate-based optimization methods are next introduced to effectively solve the robust operational problem with high computational cost. The level diagram method is finally utilized to assist in multi-criteria decision-making. Two robust operational optimization problems with different objectives are solved to demonstrate the effectiveness of the proposed method for robust optimal operation of the CCR reforming process under feedstock uncertainty.     

Finite-time adaptive fuzzy control for a class of output constrained nonlinear systems with dead-zone

The article investigates the finite-time adaptive fuzzy control for a class of nonlinear systems with output constraint and input dead-zone. First, by skillfully combining the barrier Lyapunov function, backstepping design method, and finite-time control theory, a novel adaptive state-feedback tracking controller is constructed, and the output constraint of the nonlinear system is not violated. Second, the fuzzy logic system is used to approximate unknown function in the nonlinear system. Third, the finite-time command filter is introduced to avoid the problem of “complexity explosion” caused by repeated differentiations of the virtual control signal in conventional backstepping control schemes. Meanwhile, a new saturation function is added in the compensating signal for filter error to improve control accuracy. Finally, based on Lyapunov stability analysis, all the signals of the closed-loop are proved to be semi-globally uniformly ultimately bounded, and the tracking error converges to a small neighborhood region of the origin in a finite time. A simulation example is presented to demonstrate the effectiveness for the proposed control scheme.     

Identification and U-control of a state-space system with time-delay

This article presents a state-space model with time-delay to map the relationship between known input-output data for discrete systems. For the given input-output data, a model identification algorithm combining parameter estimation and state estimation is proposed in line with the causality constraints. Consequently, this article proposes a least squares parameter estimation algorithm, and analyzes its convergence for the studied systems to prove that the parameter estimation errors converge to zero under the persistent excitation conditions. In control system design, the U-model based control is introduced to provide a unilateral platform to improve the design efficiency and generality. A simulation portfolio from modeling to control is provided with computational experiments to validate the derived results.     

基于误差估值累加开环校正的诱导式欺骗检测方法

诱导式卫星欺骗干扰可诱导航空器逐渐偏离预定航迹，难以被发现，因此及时有效地检测干扰是飞行安全的保障。在现有紧组合导航体制基础上，设计了一种基于误差估值累加开环校正的紧组合导航结构，并证明了其性能与传统闭环校正紧组合导航性能等效。在此结构中，将紧组合导航系统与自适应序贯概率比检测方法结合，提出了一种基于误差估值累加开环校正的诱导式欺骗检测方法，融合紧组合导航信息与其他不受欺骗影响的导航信息，构建欺骗检测统计量进行诱导式欺骗检测。仿真结果表明，开环校正结构可避免随时间累加的惯性导航系统误差所导致的组合导航滤波器发散问题，同时欺骗检测方法可进一步提高算法对“最坏”情形下微小诱导式欺骗的检测效果。     

Integral barrier Lyapunov function-based adaptive fuzzy output feedback control for nonlinear delayed systems with time-varying full-state constraints

In this article, an adaptive fuzzy output feedback control method is presented for nonlinear time-delay systems with time-varying full state constraints and input saturation. To overcome the problem of time-varying constraints, the integral barrier Lyapunov functions (IBLFs) integrating with dynamic surface control (DSC) are applied for the first time to keep the state from violating constraints. The effects of unknown time delays can be removed by using designed Lyapunov-Krasovskii functions (LKFs). An auxiliary design system is introduced to solve the problem of input saturation. The unknown nonlinear functions are approximated by the fuzzy logic systems (FLS), and the unmeasured states are estimated by a designed fuzzy observer. The novel controller can guarantee that all signals remain semiglobally uniformly ultimately bounded and satisfactory tracking performance is achieved. Finally, two simulation examples illustrate the effectiveness of the presented control methods.     

Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.