• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 8
  • 4
  • 2
  • Tagged with
  • 24
  • 24
  • 24
  • 11
  • 11
  • 7
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Computationally Driven Algorithms for Distributed Control of Complex Systems

Abou Jaoude, Dany 19 November 2018 (has links)
This dissertation studies the model reduction and distributed control problems for interconnected systems, i.e., systems that consist of multiple interacting agents/subsystems. The study of the analysis and synthesis problems for interconnected systems is motivated by the multiple applications that can benefit from the design and implementation of distributed controllers. These applications include automated highway systems and formation flight of unmanned aircraft systems. The systems of interest are modeled using arbitrary directed graphs, where the subsystems correspond to the nodes, and the interconnections between the subsystems are described using the directed edges. In addition to the states of the subsystems, the adopted frameworks also model the interconnections between the subsystems as spatial states. Each agent/subsystem is assumed to have its own actuating and sensing capabilities. These capabilities are leveraged in order to design a controller subsystem for each plant subsystem. In the distributed control paradigm, the controller subsystems interact over the same interconnection structure as the plant subsystems. The models assumed for the subsystems are linear time-varying or linear parameter-varying. Linear time-varying models are useful for describing nonlinear equations that are linearized about prespecified trajectories, and linear parameter-varying models allow for capturing the nonlinearities of the agents, while still being amenable to control using linear techniques. It is clear from the above description that the size of the model for an interconnected system increases with the number of subsystems and the complexity of the interconnection structure. This motivates the development of model reduction techniques to rigorously reduce the size of the given model. In particular, this dissertation presents structure-preserving techniques for model reduction, i.e., techniques that guarantee that the interpretation of each state is retained in the reduced order system. Namely, the sought reduced order system is an interconnected system formed by reduced order subsystems that are interconnected over the same interconnection structure as that of the full order system. Model reduction is important for reducing the computational complexity of the system analysis and control synthesis problems. In this dissertation, interior point methods are extensively used for solving the semidefinite programming problems that arise in analysis and synthesis. / Ph. D. / The work in this dissertation is motivated by the numerous applications in which multiple agents interact and cooperate to perform a coordinated task. Examples of such applications include automated highway systems and formation flight of unmanned aircraft systems. For instance, one can think of the hazardous conditions created by a fire in a building and the benefits of using multiple interacting multirotors to deal with this emergency situation and reduce the risks on humans. This dissertation develops mathematical tools for studying and dealing with these complex systems. Namely, it is shown how controllers can be designed to ensure that such systems perform in the desired way, and how the models that describe the systems of interest can be systematically simplified to facilitate performing the tasks of mathematical analysis and control design.
12

A Wavelet Packet Based Sifting Process and Its Application for Structural Health Monitoring

Shinde, Abhijeet Dipak 24 August 2004 (has links)
"In this work an innovative wavelet packet based sifting process for signal decomposition has been developed and its application for health monitoring of time-varying structures is presented. With the proposed sifting process, a signal can be decomposed into its mono-frequency components by examining the energy content in the wavelet packet components of a signal, and imposing certain decomposition criteria. The method is illustrated for simulation data of a linear three degree-of-freedom spring-mass-damper system and the results are compared with those obtained using the empirical mode decomposition (EMD) method. Both methods provide good approximations, as compared with the exact solution for modal responses from a conventional modal analysis. Incorporated with the classical Hilbert transform, the proposed sifting process may be effectively used for structural health monitoring by monitoring instantaneous modal parameters of the structure for both, cases of abrupt structural stiffness loss and progressive stiffness degradation. The effectiveness of this method for practical application is evaluated by applying the methodology for experimental data and the results obtained matched with the field observations. The proposed methodology has shown better results in a comparison study which is done to evaluate performance of the proposed approach with other available SHM techniques, namely EMD technique and Continuous Wavelet Transform (CWT) method, for cases characterized by different damage scenarios and noise conditions."
13

Balanced truncation model reduction for linear time-varying systems

Lang, Norman, Saak, Jens, Stykel, Tatjana 05 November 2015 (has links) (PDF)
A practical procedure based on implicit time integration methods applied to the differential Lyapunov equations arising in the square root balanced truncation method is presented. The application of high order time integrators results in indefinite right-hand sides of the algebraic Lyapunov equations that have to be solved within every time step. Therefore, classical methods exploiting the inherent low-rank structure often observed for practical applications end up in complex data and arithmetic. Avoiding the additional effort treating complex quantities, a symmetric indefinite factorization of both the right-hand side and the solution of the differential Lyapunov equations is applied.
14

Contribuições ao problema de filtragem H-infinito para sistemas dinâmicos / Contributions to the H-infinity problem for dynamical systems

Lacerda, Márcio Júnior, 1987- 25 August 2018 (has links)
Orientadores: Pedro Luis Dias Peres, Ricardo Coração de Leão Fontoura de Oliveira / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-25T15:07:40Z (GMT). No. of bitstreams: 1 Lacerda_MarcioJunior_D.pdf: 1206868 bytes, checksum: c5abb83323581461eb40c95f27c95097 (MD5) Previous issue date: 2014 / Resumo: Este trabalho apresenta novas condições na forma de desigualdades matriciais lineares para o projeto de filtros H-infinito de ordem completa em três diferentes contextos: i) sistemas lineares incertos discretos com um atraso variante no tempo afetando os estados; ii) sistemas lineares com parâmetros variantes no tempo, contínuos e discretos, sujeitos a incertezas nas medições dos parâmetros; iii) sistemas não lineares quadráticos contínuos e discretos no tempo. Para cada contexto, o objetivo é projetar filtros: i) com termos atrasados nos estados; ii) dependentes dos parâmetros incertos medidos; iii) com termos quadráticos. Em cada um dos casos, o ponto de partida é a existência de uma função de Lyapunov que assegure estabilidade e um limitante para a norma H-infinito do sistema aumentado, ou seja, o sistema original conectado com o filtro de ordem completa. As condições de projeto são obtidas impondo-se uma determinada estrutura para as variáveis de folga, resultando em desigualdades matriciais com parâmetros escalares. A eficácia das condições apresentadas é ilustrada por meio de comparações numéricas utilizando exemplos da literatura / Abstract: This work presents new conditions in the form of linear matrix inequalities for full order H-infinity filter design in three different contexts: i) uncertain linear discrete-time systems with a time-varying delay affecting the states ii) linear parameter-varying systems, continuous and discrete-time, subject to inexactly measured parameters; iii) continuous and discrete-time nonlinear quadratic systems. For each context, the aim is to design filters: i) with state-delayed terms; ii) dependent upon the inexactly measured parameters; iii) with quadratic terms. In each case, the starting point is the existence of a Lyapunov function that assures stability and a bound to the H-infinity norm of the augmented system, that is, the original system conected with the full order filter. The design conditions are obtained by imposing a given structure to the slack variables, resulting in matrix inequalities with scalar parameters. The effectiveness of the proposed conditions is illustrated by means of numerical comparisons and benchmark examples from the literature / Doutorado / Automação / Doutor em Engenharia Elétrica
15

Filtragem de Kalman aplicada à computação digital com abordagem de espaço de estado variante no tempo / Kalman filtering applied to a digital computing process with a time-varying state space approach

Battaglin, Paulo David, 1951- 26 August 2018 (has links)
Orientador: Gilmar Barreto / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-26T06:42:54Z (GMT). No. of bitstreams: 1 Battaglin_PauloDavid_D.pdf: 3180685 bytes, checksum: 5e1e9893bb97a4df42116a4c0d8b10d6 (MD5) Previous issue date: 2014 / Resumo: Este trabalho mostrará a aplicação do filtro de Kalman a um processo computacional discreto, o qual será representado por um modelo matemático que é um sistema de equações lineares, multivariáveis, discretas, estocásticas e variantes no tempo. As contribuições desta pesquisa evidenciam a construção de um modelo matemático apropriado de observabilidade instantânea para representar sistemas que variam rapidamente no tempo; a construção dos fundamentos teóricos do filtro de Kalman a ser aplicado em sistemas lineares, multivariáveis, discretos, estocásticos e variantes no tempo; bem como a construção deste filtro neste contexto e sua aplicação a um processo computacional discreto. Neste trabalho propomos um método para determinar: a matriz de observabilidade instantânea, o vetor de estimação de estado interno, a matriz de covariâncias de erros de estimação de estado interno e a latência de um processo computacional discreto, quando as medidas na saída do computador são conhecidas. Aqui mostramos que quando a propriedade observabilidade instantânea do sistema é verificada, a latência de um processo computacional pode ser estimada. Esta é uma vantagem comparada com os métodos de observabilidade usual, os quais são baseados em cenários estáticos. A aplicação potencial dos resultados deste trabalho é na predição de congestionamentos em processos que variam no tempo e acontecem em computadores digitais. Em uma perspectiva mais ampla, o método da observabilidade instantânea pode ser aplicado na identificação de patologias, na previsão de tempo, em navegação e rastreamento no solo, na água e no ar; no mercado de ações e em muitas outras áreas / Abstract: This work will show the application of the Kalman filter to a discrete computational process, which will be represented by a mathematical model: a system of linear, multivariable, discrete, stochastic and time-varying equations. The contributions of this research show the construction of an appropriate mathematical model of instantaneous observability to represent systems that vary quickly in time; the construction of the theoretical foundations of the Kalman filter to be applied to a linear, multivariable, discrete, stochastic and time-varying system; the construction of this filter in this context and its application to a discrete computational process. In this research we propose a method to determine: the instantaneous observability matrix, the internal state vector estimation, Covariance matrix of internal state estimation error and the latency of a digital computational process, when the measures on the computer output are known. Here we show that when the instantaneous observability property of the system comes true, a computing process latency can be estimated. This is an advantage compared to usual observability methods, which are based on static scenarios. The potential application of the results of this work is to predict bottlenecks in time-varying processes which happen inside the discrete computers. In a broader perspective, the instantaneous observability method can be applied on identification of a pathology, weather forecast, navigation and tracking on ground, in the water and in the air; in stock market prediction and many other areas / Doutorado / Automação / Doutor em Engenharia Elétrica
16

Análise e síntese de sistemas LPV polinomiais homogêneos usando funções de Lyapunov dependentes de sucessivos instantes de tempo / Analysis and synthesis of homogeneous polynomially LPV systems using path-dependent Lyapunov function

Rodrigues, Luis Antonio, 1987- 22 August 2018 (has links)
Orientador: Juan Francisco Camino dos Santos / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica / Made available in DSpace on 2018-08-22T01:28:47Z (GMT). No. of bitstreams: 1 Rodrigues_LuisAntonio_M.pdf: 1882720 bytes, checksum: efb662d3473168965c88de41357ef029 (MD5) Previous issue date: 2012 / Resumo: O presente trabalho investiga os problemas de estabilidade assintótica e desempenho H'INFINITO' de sistemas lineares a parâmetros variantes discretos no tempo. São fornecidas condições suficientes para análise de estabilidade, análise de desempenho H'INFINITO' e síntese de controladores estáticos de realimentação de saída robustos e por ganho escalonado. Além disso, é proposto um método de parametrização polinomial homogênea de sistemas LPV afins. Assume-se que a matriz do sistema tem dependência polinomial homogênea de grau arbitrário sobre os parâmetros que variam dentro de um politopo com conhecidos limitantes sobre suas taxas de variação. As propriedades geométricas do domínio politópico são exploradas para se obter um conjunto finito de desigualdades matriciais lineares que levam em consideração os limitantes sobre as taxas de variação dos parâmetros. As condições LMIs são obtidas usando uma função de Lyapunov quadrática nos estados com dependência polinomial homogênea dos parâmetros variantes em instantes sucessivos de tempo. As condições fornecidas são aplicadas no modelo LPV de um sistema vibroacústico. Comparações com resultados numéricos encontrados na literatura mostram os benefícios das técnicas propostas / Abstract: This work investigates stability and H'INFINITE' performance of discrete-time linear parameter varying systems. Sufficient conditions for stability analysis, H'INFINITE' performance analysis and synthesis of both robust and gain-scheduled static output feedback controller are provided. It is assumed that the system matrices have a homogeneous polynomial dependence of arbitrary degree on the time-varying parameters. Thus, a homogeneous-polynomially parametrization method for affine LPV systems is proposed. The parameters are assumed to vary inside a polytope and to have known bounds on their rates of variation. The geometric properties of the polytopic domain are exploited to derive a finite set of LMIs that take into account the bounds on the rates of variation of the scheduling parameters. The LMI conditions are obtained using a quadratic in the state Lyapunov function with a homogeneous polynomial dependence on the scheduling parameters at successive instants of time. The proposed techniques are applied to an LPV model of a vibroacoustic setup. Comparisons with numerical results found in literature show the benefits of the proposed approach / Mestrado / Mecanica dos Sólidos e Projeto Mecanico / Mestre em Engenharia Mecânica
17

Balanced truncation model reduction for linear time-varying systems

Lang, Norman, Saak, Jens, Stykel, Tatjana January 2015 (has links)
A practical procedure based on implicit time integration methods applied to the differential Lyapunov equations arising in the square root balanced truncation method is presented. The application of high order time integrators results in indefinite right-hand sides of the algebraic Lyapunov equations that have to be solved within every time step. Therefore, classical methods exploiting the inherent low-rank structure often observed for practical applications end up in complex data and arithmetic. Avoiding the additional effort treating complex quantities, a symmetric indefinite factorization of both the right-hand side and the solution of the differential Lyapunov equations is applied.:1 Introduction 2 Balanced truncation for LTV systems 3 Solving differential Lyapunov equations 4 Solving the reduced-order system 5 Numerical experiments 6 Conclusion
18

Sufficient conditions for assignability of nonuniform dichotomy spectrum of discrete time-varying linear systems

Babiarz, Artur, Czornik, Adam, Siegmund, Stefan 22 February 2024 (has links)
We consider a version of the pole placement problem for tempered one sided linear discrete time time varying linear systems. We prove a sufficient condition for assignability of the nonuniform dichotomy spectrum by linear feedback. The main result is that the nonuniform dichotomy spectrum is assignable if the system is completely controllable and certain lower asymptotic bound for the controllability Gramian holds.
19

On Integral Quadratic Constraint Theory and Robust Control of Unmanned Aircraft Systems

Fry, Jedediah Micah 11 September 2019 (has links)
This dissertation advances tools for the certification of unmanned aircraft system (UAS) flight controllers. We develop two thrusts to this goal: (1) the validation and improvement of an uncertain UAS framework based on integral quadratic constraint (IQC) theory and (2) the development of novel IQC theorems which allow the analysis of uncertain systems having time-varying characteristics. Pertaining to the first thrust, this work improves and implements an IQC-based robustness analysis framework for UAS. The approach models the UAS using a linear fractional transformation on uncertainties and conducts robustness analysis on the uncertain system via IQC theory. By expressing the set of desired UAS flight paths with an uncertainty, the framework enables analysis of the uncertain UAS flying about any level path whose radius of curvature is bounded. To demonstrate the versatility of this technique, we use IQC analysis to tune trajectory-tracking and path-following controllers designed via H2 or H-infinity synthesis methods. IQC analysis is also used to tune path-following PID controllers. By employing a non-deterministic simulation environment and conducting numerous flight tests, we demonstrate the capability of the framework in predicting loss of control, comparing the robustness of different controllers, and tuning controllers. Finally, this work demonstrates that signal IQCs have an important role in obtaining IQC analysis results which are less conservative and more consistent with observations from flight test data. With regards to the second thrust, we prove a novel theorem which enables robustness analysis of uncertain systems where the nominal plant and the IQC multiplier are linear time-varying systems and the nominal plant may have a non-zero initial condition. When the nominal plant and the IQC multiplier are eventually periodic, robustness analysis can be accomplished by solving a finite-dimensional semidefinite program. Time-varying IQC multipliers are beneficial in analysis because they provide the possibility of reducing conservatism and are capable of expressing uncertainties that have unique time-domain characteristics. A number of time-varying IQC multipliers are introduced to better describe such uncertainties. The utility of this theorem is demonstrated with various examples, including one which produces bounds on the UAS position after an aggressive Split-S maneuver. / Doctor of Philosophy / This work develops tools to aid in the certification of unmanned aircraft system (UAS) flight controllers. The forthcoming results are founded on robust control theory, which allows the incorporation of a variety of uncertainties in the UAS mathematical model and provides tools to determine how robust the system is to these uncertainties. Such a foundation provides a complementary perspective to that obtained with simulations. Whereas simulation environments provide a probabilistic-type analysis and are oftentimes costly, the following results provide worst-case guarantees—for the allowable disturbances and uncertainties—and require far less computational resources. Here we take two approaches in our development of certification tools for UAS. First we validate and improve on an uncertain UAS framework that relies on integral quadratic constraint (IQC) theory to analyze the robustness of the UAS in the presence of uncertainties and disturbances. Our second approach develops novel IQC theorems that can aid in providing bounds on the UAS state during its flight trajectory. Though the applications in this dissertation are focused on UAS, the theory can be applied to a wide variety of physical and nonphysical problems wherein uncertainties in the mathematical model cannot be avoided.
20

Consensus variant dans le temps : application à la formation de véhicles / Time-varying consensus : application to formation control of vehicles

Alvarez Jarquin, Nohemi 11 June 2015 (has links)
Les multiples applications liées aux systèmes multi-agents en réseau, tels que les satellites en formation, les oscillateurs couplés, les véhicules aériens sans pilote, entre autres, ont été, sans aucun doute, une motivation majeure dans le développement de cette thèse, qui est consacrée à l’étude du consensus de systèmes dynamiques et à la commande en formation de robots mobiles non holonomes. Dans le contexte du consensus, nous étudions la topologie en anneau avec de liens de communication variant dans le temps. Notamment, la communication peut être perdue pendant de longs intervalles de temps. Nous donnons de conditions suffisantes pour le consensus qui restent simples à vérifier, par exemple, en utilisant le théorème du petite gain. En suite, nous abordons le problème de consensus en supposant que la topologie de communication est variable. Nous établissons que le consensus est atteint à condition qu’il existe toujours un chemin de communication du type « spanning-tree » pendant un temps de séjour minimal. L'analyse s'appuie sur la théorie de stabilité des systèmes variant dans le temps et les systèmes à commutation. Dans le contexte de la commande en formation de véhicules autonomes nous adressons le problème de commande en suivi de trajectoire sur ligne droite en suivant une approche type maître-esclave. Nous montrons que le suivi global peut être obtenu à partir d’un contrôleur qui possède la propriété d’excitation persistante. En gros, le mécanisme de stabilisation dépend de l’excitation du système par une quantité qui est proportionnelle à l’erreur de suivi. Ensuite, la méthode est utilisée pour résoudre le problème de suivi de formation de plusieurs véhicules interconnectés sur la base d’une topologie « spanning-tree ». Nous donnons des conditions de stabilité concernant les modèles cinématique et dynamique, en utilisant la seconde méthode de Lyapunov. / The multiple applications related to networked multi-agent systems such as satellite formation flying, coupled oscillators, air traffic control, unmanned air vehicles, cooperative transport, among others, has been undoubtedly a watershed for the development of this thesis. The study of cooperative control of multi-agent systems is of great interest for his extensive field work and applications. This thesis is devoted to the study of consensus seeking of multi-agents systems and trajectory tracking of nonholonomic mobile robots.In the context of consensus seeking, first we study a ring topology of dynamic agents with time-dependent communication links which may disconnect for long intervals of time. Simple checkable conditions are obtained by using small-gain theorem to guarantee the achievement of consensus. Then, we deal with a network of dynamic agents with time-dependent communication links interconnected over a time-varying topology. We establish that consensus is reached provided that there always exists a « spanning-tree » for a minimal dwell-time by using stability theory of time-varying and switched systems. In the context of trajectory tracking, we investigate a simple leader-follower tracking controller for autonomous vehicles following straight lines. We show that global tracking may be achieved by a controller which has a property of persistency of excitation tailored for nonlinear systems. Roughly speaking the stabilisation mechanism relies on exciting the system by an amount that is proportional to the tracking error. Moreover, the method is used to solve the problem of formation tracking of multiple vehicles interconnected on the basis of a « spanning-tree » topology. We derive stability conditions for the kinematic and dynamic model by using a Lyapunov approach.

Page generated in 0.0843 seconds