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.     

Robust optimisation of sustainable food grain transportation with uncertain supply and intentional disruptions

The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances.     

Robust predictive extended state observer for a class of nonlinear systems with time-varying input delay

ABSTRACT

This paper deals with asymptotic stabilisation of a class of nonlinear input-delayed systems via dynamic output feedback in the presence of disturbances. The proposed strategy has the structure of an observer-based control law, in which the observer estimates and predicts both the plant state and the external disturbance. A nominal delay value is assumed to be known and stability conditions in terms of linear matrix inequalities are derived for fast-varying delay uncertainties. Asymptotic stability is achieved if the disturbance or the time delay is constant. The controller design problem is also addressed and a numerical example with an unstable system is provided to illustrate the usefulness of the proposed strategy.     

Adaptive robust boundary control of shaft vibrations under perturbations with unknown upper bounds

This paper presents robust and adaptive boundary control designs to stabilize the two‐dimensional vibration of hybrid shaft model. The hybrid shaft is mathematically represented by a set of partial differential equations, governing the shaft vibrations, coupled to ordinary differential equations, describing rigid body spinning and dynamic boundary conditions. The control objective is to stabilize the transverse vibrations of the perturbed shaft while regulating the spinning rate. To achieve this, the paper first establishes robust boundary control laws that fulfil the control objective in the presence of modeling uncertainties and external disturbances operating over the shaft domain and boundary. Lyapunov‐based analyses show that the proposed robust control exponentially stabilizes the shaft with vanishing distributive perturbations, while assuring ultimately bounded vibrations in the case of nonvanishing perturbations. Then, adaptive control philosophy is utilized to achieve redesigned robust controllers that only use online adaptation of control gains without acquiring the knowledge of bounds on perturbations, as well as dynamic parameters. An advantage of this design is avoiding an overconservative robust control law, which may induce poor stability and chattering in tackling system perturbations with unknown upper bounds. Simulations through finite element method illustrate the results. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Robust Control of Permanent Magnet Synchronous Motors

In this paper, permanent magnet synchronous motors (PMSMs) are investigated. According to the feature of PMSMs, a novel state equation of PMSMs is obtained by choosing suitable state variables. Based on the state equation, robust controllers are designed via interval matrix and PI control idea. In terms of bilinear matrix inequations, sufficient conditions for the existence of the robust controller are derived. In order to reduce the conservation and the dependence on parameter, the control inputs of PMSMs are divided into two parts, a feedforward control input and a feedback control input, and relevant sufficient conditions for the existence of the controller are obtained. Because of the suitable choice of state variables, the proposed control strategies can cope with the load uncertainty and have robustness for disturbance. Finally, simulations are carried out via Matlab/Simulink soft to verify the effectiveness of the proposed control strategies. The performance of the proposed control strategies are demonstrated by the simulation results.      

大系统分散鲁棒容错控制的进展及主要成果

综述了近２０年来关联大系统分散鲁棒容错控制的研究动态及取得的主要成果。说明了统一地研究分散鲁棒容错控制的必要性。在分散控制、鲁棒控制和容错控制研究领域内，分析了各种设计方法的主导思想及实质；指出了这些研究成果的意义与存在的问题。文中着重论述了分散、鲁棒、容错控制研究方法的发展途径。     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.