77 research outputs found

    Representing the model of impedance controlled robot interaction with feedback delay in polytopic LPV form: TP model transformation based approach

    Get PDF
    The aim of this paper is to transform the model of the impedance controlled robot interaction with feedback delay to a Tensor Product (TP) type polytopic LPV model whereupon Linear Matrix Inequality (LMI) based control design can be immediately executed. The paper proves that the impedance model can be exactly represented by a finite element TP type polytopic model under certain constrains. The paper also determines various further TP models with different advantages for control design. First, it derives the exact Higher Order Singular Value Decomposition (HOSVD) based canonical form, then it performs complexity trade-off to yield a model with less number of components but rather effective for LMI design. Then the paper presents various different types of convex TP model representations based on the non-exact model in order to investigate how convex hull manipulation can be performed on the model. Finally the presented models are analyzed to validate the accuracy of the transformation and the resulting TP type polytopic LPV models. The paper concludes that these prepared models are ready for convex hull manipulation and LMI based control design

    Contributions to nonlinear system modelling and controller synthesis via convex structures

    Full text link
    Esta tesis discute diferentes metodologías de modelado para extraer mejores prestaciones o resultados de estabilidad que aquéllas que el modelado convencional basado en sector no-lineal de sistemas Takagi-Sugeno (también denominados cuasi-LPV) es capaz de producir. En efecto, incluso si las LMIs pueden probar distintas cotas de prestaciones o márgenes de estabilidad (tasa de decaimiento, H\mathcal H_\infty, etc.) para sistemas politópicos, es bien conocido que las prestaciones probadas dependen del modelo elegido y, dado un sistema no-lineal, dicho modelo politópico no es único. Por tanto, se presentan exploraciones hacia cómo obtener el modelo que es menos perjudicial para la medida de prestaciones elegida. Como una última contribución, mejores resultados son obtenidos mediante la extensión del modelado politópico Takagi-Sugeno a un marco de inclusiones en diferencias cuasi-convexas con planificación de ganancia. En efecto, una versión sin planificación de ganancia fue propuesta por un equipo de investigadores de la Universidad de Sevilla (Fiaccini, Álamo, Camacho) para generalizar el modelado politópico, y esta tesis propone una version aún más general de algunos de dichos resultados que incorpora planificación de ganancia.This thesis discusses different modelling methodologies to eke out best performance/stability results than conventional sector-nonlinearity Takagi-Sugeno (also known as quasi-LPV) systems modelling techniques are able to yield. Indeed, even if LMIs can prove various performance and stability bounds (decay rate, H\mathcal H_\infty, etc.) for polytopic systems, it is well known that the proven performance depends on the chosen model and, given a nonlinear dynamic systems, the polytopic embeddings available for it are not unique. Thus, explorations on how to obtain the model which is less deletereous for performance are presented. As a last contribution, extending the polytopic Takagi-Sugeno setup to a gain-scheduled quasi-convex difference inclusion framework allows to improve the results over the polytopic models. Indeed, the non-scheduled convex difference inclusion framework was proposed by a research team in University of Seville (Fiacchini, Alamo, Camacho) as a generalised modelling methodology which included the polytopic one; this thesis poses a further generalised gain-scheduled version of some of these results.Aquesta tesi discuteix diferents metodologies de modelatge per extreure millors prestacions o resultats d'estabilitat que aquelles que el modelatge convencional basat en sector no-lineal de sistemes Takagi-Sugeno (també anomenats quasi-LPV) és capaç de produir. En efecte, fins i tot si les LMIs poden provar diferents cotes de prestacions o marges d'estabilitat (taxa de decaïment, H\mathcal H_\infty, etc.) per a sistemes politòpics, és ben conegut que les prestacions provades depenen del model triat i, donat un sistema no-lineal, el dit model politòpic no és únic. Per tant, es presenten exploracions cap a com obtenir el model que és menys perjudicial per a la mesura de prestacions triada. Com una darrera contribució, millors resultats són obtinguts mitjançant l'extensió del modelatge politòpic Takagi-Sugeno a un marc d'inclusions en diferències quasi-convexes amb planificació de guany. En efecte, una versió sense planificació de guany va ser proposada per un equip d'investigadors de la Universitat de Sevilla (Fiaccini, Álamo, Camacho) per a generalitzar el modelatge politòpic, i aquesta tesi proposa una versió més general d'alguns d'aquests resultats que incorpora planificació de guany.Robles Ruiz, R. (2018). Contributions to nonlinear system modelling and controller synthesis via convex structures [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/100848TESI

    Decentralized sliding mode control and estimation for large-scale systems

    Get PDF
    This thesis concerns the development of an approach of decentralised robust control and estimation for large scale systems (LSSs) using robust sliding mode control (SMC) and sliding mode observers (SMO) theory based on a linear matrix inequality (LMI) approach. A complete theory of decentralized first order sliding mode theory is developed. The main developments proposed in this thesis are: The novel development of an LMI approach to decentralized state feedback SMC. The proposed strategy has good ability in combination with other robust methods to fulfill specific performance and robustness requirements. The development of output based SMC for large scale systems (LSSs). Three types of novel decentralized output feedback SMC methods have been developed using LMI design tools. In contrast to more conventional approaches to SMC design the use of some complicated transformations have been obviated. A decentralized approach to SMO theory has been developed focused on the Walcott-Żak SMO combined with LMI tools. A derivation for bounds applicable to the estimation error for decentralized systems has been given that involves unknown subsystem interactions and modeling uncertainty. Strategies for both actuator and sensor fault estimation using decentralized SMO are discussed.The thesis also provides a case study of the SMC and SMO concepts applied to a non-linear annealing furnace system modelderived from a distributed parameter (partial differential equation) thermal system. The study commences with a lumped system decentralised representation of the furnace derived from the partial differential equations. The SMO and SMC methods derived in the thesis are applied to this lumped parameter furnace model. Results are given demonstrating the validity of the methods proposed and showing a good potential for a valuable practical implementation of fault tolerant control based on furnace temperature sensor faults

    Some Results on Reset Control systems

    Get PDF
    Hybrid controllers are flexible tools for achieving system stabilization and/or performance improvement tasks. More particularly, hybrid controllers enrich the spectrum of achievable trade-offs. Indeed, the interaction of continuous- and discrete-time dynamics in a hybrid controller leads to rich dynamical behavior and phenomena not encountered in purely continuous-time system. Reset control systems are a class of hybrid controllers whose states are reset depending on an algebraic condition. In this thesis, we propose constructive conditions (Linear Matrix Inequalities) to analyze stability and performance level of a closed-loop system including a reset element. More particularly, we consider a magnitude saturation which could be the source of undesirable effects on these performances, including instability. Proposed results estimate the stability domain and a performance level of such a system, by using Lyapunov-like approaches. Constructive algorithms are obtained by exploiting properties of quadratic - or piecewise quadratic - Lyapunov functions. Beyond analysis results, we propose design methods to obtain a stability domain as large as possible. Design methods are based on both continuous-time approaches (anti-windup compensator) and hybrid-time approaches (design of adapted reset rules)

    Unknown input observer approaches to robust fault diagnosis

    Get PDF
    This thesis focuses on the development of the model-based fault detection and isolation /fault detection and diagnosis (FDI/FDD) techniques using the unknown input observer (UIO) methodology. Using the UI de-coupling philosophy to tackle the robustness issue, a set of novel fault estimation (FE)-oriented UIO approaches are developed based on the classical residual generation-oriented UIO approach considering the time derivative characteristics of various faults. The main developments proposed are:- Implement the residual-based UIO design on a high fidelity commercial aircraft benchmark model to detect and isolate the elevator sensor runaway fault. The FDI design performance is validated using a functional engineering simulation (FES) system environment provided through the activity of an EU FP7 project Advanced Fault Diagnosis for Safer Flight Guidance and Control (ADDSAFE).- Propose a linear time-invariant (LTI) model-based robust fast adaptive fault estimator (RFAFE) with UI de-coupling to estimate the aircraft elevator oscillatory faults considered as actuator faults.- Propose a UI-proportional integral observer (UI-PIO) to estimate actuator multiplicative faults based on an LTI model with UI de-coupling and with added H∞ optimisation to reduce the effects of the sensor noise. This is applied to an example on a hydraulic leakage fault (multiplicative fault) in a wind turbine pitch actuator system, assuming that thefirst derivative of the fault is zero. - Develop an UI–proportional multiple integral observer (UI-PMIO) to estimate the system states and faults simultaneously with the UI acting on the system states. The UI-PMIO leads to a relaxed condition of requiring that the first time derivative of the fault is zero instead of requiring that the finite time fault derivative is zero or bounded. - Propose a novel actuator fault and state estimation methodology, the UI–proportional multiple integral and derivative observer (UI-PMIDO), inspired by both of the RFAFE and UI-PMIO designs. This leads to an observer with the comprehensive feature of estimating faults with bounded finite time derivatives and ensuring fast FE tracking response.- Extend the UI-PMIDO theory based on LTI modelling to a linear parameter varying (LPV) model approach for FE design. A nonlinear two-link manipulator example is used to illustrate the power of this method

    Robust Distributed Model Predictive Control Strategies of Chemical Processes

    Get PDF
    This work focuses on the robustness issues related to distributed model predictive control (DMPC) strategies in the presence of model uncertainty. The robustness of DMPC with respect to model uncertainty has been identified by researchers as a key factor in the successful application of DMPC. A first task towards the formulation of robust DMPC strategy was to propose a new systematic methodology for the selection of a control structure in the context of DMPC. The methodology is based on the trade-off between performance and simplicity of structure (e.g., a centralized versus decentralized structure) and is formulated as a multi-objective mixed-integer nonlinear program (MINLP). The multi-objective function is composed of the contribution of two indices: 1) closed-loop performance index computed as an upper bound on the variability of the closed-loop system due to the effect on the output error of either set-point or disturbance input, and 2) a connectivity index used as a measure of the simplicity of the control structure. The parametric uncertainty in the models of the process is also considered in the methodology and it is described by a polytopic representation whereby the actual process’s states are assumed to evolve within a polytope whose vertices are defined by linear models that can be obtained from either linearizing a nonlinear model or from their identification in the neighborhood of different operating conditions. The system’s closed-loop performance and stability are formulated as Linear Matrix Inequalities (LMI) problems so that efficient interior-point methods can be exploited. To solve the MINLP a multi-start approach is adopted in which many starting points are generated in an attempt to obtain global optima. The efficiency of the proposed methodology is shown through its application to benchmark simulation examples. The simulation results are consistent with the conclusions obtained from the analysis. The proposed methodology can be applied at the design stage to select the best control configuration in the presence of model errors. A second goal accomplished in this research was the development of a novel online algorithm for robust DMPC that explicitly accounts for parametric uncertainty in the model. This algorithm requires the decomposition of the entire system’s model into N subsystems and the solution of N convex corresponding optimization problems in parallel. The objective of this parallel optimizations is to minimize an upper bound on a robust performance objective by using a time-varying state-feedback controller for each subsystem. Model uncertainty is explicitly considered through the use of polytopic description of the model. The algorithm employs an LMI approach, in which the solutions are convex and obtained in polynomial time. An observer is designed and embedded within each controller to perform state estimations and the stability of the observer integrated with the controller is tested online via LMI conditions. An iterative design method is also proposed for computing the observer gain. This algorithm has many practical advantages, the first of which is the fact that it can be implemented in real-time control applications and thus has the benefit of enabling the use of a decentralized structure while maintaining overall stability and improving the performance of the system. It has been shown that the proposed algorithm can achieve the theoretical performance of centralized control. Furthermore, the proposed algorithm can be formulated using a variety of objectives, such as Nash equilibrium, involving interacting processing units with local objective functions or fully decentralized control in the case of communication failure. Such cases are commonly encountered in the process industry. Simulations examples are considered to illustrate the application of the proposed method. Finally, a third goal was the formulation of a new algorithm to improve the online computational efficiency of DMPC algorithms. The closed-loop dual-mode paradigm was employed in order to perform most of the heavy computations offline using convex optimization to enlarge invariant sets thus rendering the iterative online solution more efficient. The solution requires the satisfaction of only relatively simple constraints and the solution of problems each involving a small number of decision variables. The algorithm requires solving N convex LMI problems in parallel when cooperative scheme is implemented. The option of using Nash scheme formulation is also available for this algorithm. A relaxation method was incorporated with the algorithm to satisfy initial feasibility by introducing slack variables that converge to zero quickly after a small number of early iterations. Simulation case studies have illustrated the applicability of this approach and have demonstrated that significant improvement can be achieved with respect to computation times. Extensions of the current work in the future should address issues of communication loss, delays and actuator failure and their impact on the robustness of DMPC algorithms. In addition, integration of the proposed DMPC algorithms with other layers in automation hierarchy can be an interesting topic for future work

    Grasp Stability Analysis with Passive Reactions

    Get PDF
    Despite decades of research robotic manipulation systems outside of highly-structured industrial applications are still far from ubiquitous. Perhaps particularly curious is the fact that there appears to be a large divide between the theoretical grasp modeling literature and the practical manipulation community. Specifically, it appears that the most successful approaches to tasks such as pick-and-place or grasping in clutter are those that have opted for simple grippers or even suction systems instead of dexterous multi-fingered platforms. We argue that the reason for the success of these simple manipulation systemsis what we call passive stability: passive phenomena due to nonbackdrivable joints or underactuation allow for robust grasping without complex sensor feedback or controller design. While these effects are being leveraged to great effect, it appears the practical manipulation community lacks the tools to analyze them. In fact, we argue that the traditional grasp modeling theory assumes a complexity that most robotic hands do not possess and is therefore of limited applicability to the robotic hands commonly used today. We discuss these limitations of the existing grasp modeling literature and setout to develop our own tools for the analysis of passive effects in robotic grasping. We show that problems of this kind are difficult to solve due to the non-convexity of the Maximum Dissipation Principle (MDP), which is part of the Coulomb friction law. We show that for planar grasps the MDP can be decomposed into a number of piecewise convex problems, which can be solved for efficiently. Despite decades of research robotic manipulation systems outside of highlystructured industrial applications are still far from ubiquitous. Perhaps particularly curious is the fact that there appears to be a large divide between the theoretical grasp modeling literature and the practical manipulation community. Specifically, it appears that the most successful approaches to tasks such as pick-and-place or grasping in clutter are those that have opted for simple grippers or even suction systems instead of dexterous multi-fingered platforms. We argue that the reason for the success of these simple manipulation systemsis what we call passive stability: passive phenomena due to nonbackdrivable joints or underactuation allow for robust grasping without complex sensor feedback or controller design. While these effects are being leveraged to great effect, it appears the practical manipulation community lacks the tools to analyze them. In fact, we argue that the traditional grasp modeling theory assumes a complexity that most robotic hands do not possess and is therefore of limited applicability to the robotic hands commonly used today. We discuss these limitations of the existing grasp modeling literature and setout to develop our own tools for the analysis of passive effects in robotic grasping. We show that problems of this kind are difficult to solve due to the non-convexity of the Maximum Dissipation Principle (MDP), which is part of the Coulomb friction law. We show that for planar grasps the MDP can be decomposed into a number of piecewise convex problems, which can be solved for efficiently. We show that the number of these piecewise convex problems is quadratic in the number of contacts and develop a polynomial time algorithm for their enumeration. Thus, we present the first polynomial runtime algorithm for the determination of passive stability of planar grasps. For the spacial case we present the first grasp model that captures passive effects due to nonbackdrivable actuators and underactuation. Formulating the grasp model as a Mixed Integer Program we illustrate that a consequence of omitting the maximum dissipation principle from this formulation is the introduction of solutions that violate energy conservation laws and are thus unphysical. We propose a physically motivated iterative scheme to mitigate this effect and thus provide the first algorithm that allows for the determination of passive stability for spacial grasps with both fully actuated and underactuated robotic hands. We verify the accuracy of our predictions with experimental data and illustrate practical applications of our algorithm. We build upon this work and describe a convex relaxation of the Coulombfriction law and a successive hierarchical tightening approach that allows us to find solutions to the exact problem including the maximum dissipation principle. It is the first grasp stability method that allows for the efficient solution of the passive stability problem to arbitrary accuracy. The generality of our grasp model allows us to solve a wide variety of problems such as the computation of optimal actuator commands. This makes our framework a valuable tool for practical manipulation applications. Our work is relevant beyond robotic manipulation as it applies to the stability of any assembly of rigid bodies with frictional contacts, unilateral constraints and externally applied wrenches. Finally, we argue that with the advent of data-driven methods as well as theemergence of a new generation of highly sensorized hands there are opportunities for the application of the traditional grasp modeling theory to fields such as robotic in-hand manipulation through model-free reinforcement learning. We present a method that applies traditional grasp models to maintain quasi-static stability throughout a nominally model-free reinforcement learning task. We suggest that such methods can potentially reduce the sample complexity of reinforcement learning for in-hand manipulation.We show that the number of these piecewise convex problems is quadratic in the number of contacts and develop a polynomial time algorithm for their enumeration. Thus, we present the first polynomial runtime algorithm for the determination of passive stability of planar grasps

    Convex Optimisation for Communication Systems

    No full text
    In this thesis new robust methods for the efficient sharing of the radio spectrum for underlay cognitive radio (CR) systems are developed. These methods provide robustness against uncertainties in the channel state information (CSI) that is available to the cognitive radios. A stochastic approach is taken and the robust spectrum sharing methods are formulated as convex optimisation problems. Three efficient spectrum sharing methods; power control, cooperative beamforming and conventional beamforming are studied in detail. The CR power control problem is formulated as a sum rate maximisation problem and transformed into a convex optimisation problem. A robust power control method under the assumption of partial CSI is developed and also transformed into a convex optimisation problem. A novel method of detecting and removing infeasible constraints from the power allocation problem is presented that results in considerably improved performance. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations. The concept of cooperative beamforming for spectrum sharing is applied to an underlay CR relay network. Distributed single antenna relay nodes are utilised to form a virtual antenna array that provides increased gains in capacity through cooperative beamforming. It is shown that the cooperative beamforming problems can be transformed into convex optimisation problems. New robust cooperative beamformers under the assumption of partial and imperfect CSI are developed and also transformed into convex optimisation problems. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations. Conventional beamforming to allow efficient spectrum sharing in an underlay CR system is studied. The beamforming problems are formulated and transformed into convex optimisation problems. New robust beamformers under the assumption of partial and imperfect CSI are developed and also transformed into convex optimisation problems. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations
    corecore