Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Hernan Haimovich is active.

Publication


Featured researches published by Hernan Haimovich.


IEEE Transactions on Automatic Control | 2004

A moving horizon approach to Networked Control system design

Graham C. Goodwin; Hernan Haimovich; Daniel E. Quevedo; James S. Welsh

This paper presents a control system design strategy for multivariable plants where the controller, sensors and actuators are connected via a digital, data-rate limited, communications channel. In order to minimize bandwidth utilization, a communication constraint is imposed which restricts all transmitted data to belong to a finite set and only permits one plant to be addressed at a time. We emphasize implementation issues and employ moving horizon techniques to deal with both control and measurement quantization issues. We illustrate the methodology by simulations and a laboratory-based pilot-scale study.


International Journal of Control | 2007

A systematic method to obtain ultimate bounds for perturbed systems

Ernesto Kofman; Hernan Haimovich; María M. Seron

In this paper, we develop a systematic method to obtain ultimate bounds for both continuous- and discrete-time perturbed systems. The method is based on a componentwise analysis of the system in modal coordinates and thus exploits the system geometry as well as the perturbation structure without requiring calculation of a Lyapunov function for the system. The method is introduced for linear systems having constant componentwise perturbation bounds and is then extended to the case of state-dependent perturbation bounds. This extension enables the method to be applied to non-linear systems by treating the perturbed non-linear system as a linear system with a perturbation bounded by a non-linear function of the state. Examples are provided where the proposed systematic method yields bounds that are tighter or at least not worse than those obtained via standard Lyapunov analysis. We also show how our method can be combined with Lyapunov analysis to improve on the bounds provided by either approach.


Automatica | 2010

Brief paper: Componentwise ultimate bound and invariant set computation for switched linear systems

Hernan Haimovich; María M. Seron

We present a novel ultimate bound and invariant set computation method for continuous-time switched linear systems with disturbances and arbitrary switching. The proposed method relies on the existence of a transformation that takes all matrices of the switched linear system into a convenient form satisfying certain properties. The method provides ultimate bounds and invariant sets in the form of polyhedral and/or mixed ellipsoidal/polyhedral sets, is completely systematic once the aforementioned transformation is obtained, and provides a new sufficient condition for practical stability. We show that the transformation required by our method can easily be found in the well-known case where the subsystem matrices generate a solvable Lie algebra, and we provide an algorithm to seek such transformation in the general case. An example comparing the bounds obtained by the proposed method with those obtained from a common quadratic Lyapunov function computed via linear matrix inequalities shows a clear advantage of the proposed method in some cases.


Automatica | 2008

Brief paper: Control design with guaranteed ultimate bound for perturbed systems

Ernesto Kofman; María M. Seron; Hernan Haimovich

We present a new control design method for perturbed multiple-input systems, which guarantees any desired componentwise ultimate bound on the system state. The method involves eigenvalue/eigenvector assignment by state feedback and utilises a componentwise bound computation procedure. This procedure directly takes into account both the system and perturbation structures by performing componentwise analysis, thus avoiding the need for bounds on the norm of the perturbation. The perturbation description adopted can accommodate numerous types of uncertainties, including uncertain time-delays in the feedback loop. We apply the method to an example taken from the literature to illustrate its simplicity and generality.


Automatica | 2007

Brief paper: Systematic ultimate bound computation for sampled-data systems with quantization

Hernan Haimovich; Ernesto Kofman; María M. Seron

We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The proposed method exploits the system geometry as well as the perturbation structure, and takes intersample behavior into account. The main features of the method are its systematic nature, whereby it can be readily computer coded, without requiring adjustment of parameters for its application, and its suitability for dealing with highly structured perturbation schemes, whereby the information on the perturbation structure is directly taken into account. The latter feature distinguishes the method from other approaches that require a bound on the norm of the perturbation and thus disregard information on the perturbation structure. We apply the method to a numerical example taken from the literature to illustrate its simplicity and potential.


Automatica | 2013

Bounds and invariant sets for a class of switching systems with delayed-state-dependent perturbations

Hernan Haimovich; María M. Seron

We present a novel method to compute componentwise transient bounds, componentwise ultimate bounds, and invariant regions for a class of switching continuous-time linear systems with perturbation bounds that may depend nonlinearly on a delayed state. The main advantage of the method is its componentwise nature, i.e. the fact that it allows each component of the perturbation vector to have an independent bound and that the bounds and sets obtained are also given componentwise. This componentwise method does not employ a norm for bounding either the perturbation or state vectors, avoids the need for scaling the different state vector components in order to obtain useful results, and may also reduce conservativeness in some cases. The present paper builds upon and extends to switching systems with delayed-state-dependent perturbations previous results by the authors. In this sense, the contribution is three-fold: the derivation of the aforementioned extension; the elucidation of the precise relationship between the class of switching linear systems to which the proposed method can be applied and those that admit a common quadratic Lyapunov function (a question that was left open in our previous work); and the derivation of a technique to compute a common quadratic Lyapunov function for switching linear systems with perturbations bounded componentwise by affine functions of the absolute value of the state vector components. In this latter case, we also show how our componentwise method can be combined with standard techniques in order to derive bounds possibly tighter than those corresponding to either method applied individually.


chinese control conference | 2011

Feedback Stabilization of Switching Discrete-Time Systems via Lie-Algebraic Techniques

Hernan Haimovich; Julio H. Braslavsky; Flavia Felicioni

This technical note addresses the stabilization of switching discrete-time linear systems with control inputs under arbitrary switching. A sufficient condition for the uniform global exponential stability (UGES) of such systems is the existence of a common quadratic Lyapunov function (CQLF) for the component subsystems, which is ensured when the closed-loop component subsystem matrices are stable and generate a solvable Lie algebra. The present work develops an iterative algorithm that seeks the feedback maps required for stabilization based on the previous Lie-algebraic condition. The main theoretical contribution of the technical note is to show that this algorithm will find the required feedback maps if and only if the Lie-algebraic problem has a solution. The core of the proposed algorithm is a common eigenvector assignment procedure, which is executed at every iteration. We also show how the latter procedure can be numerically implemented and provide a key structural condition which, if satisfied, greatly simplifies the required computations.


International Journal of Control | 2014

Bounds and invariant sets for a class of discrete-time switching systems with perturbations

Hernan Haimovich; María M. Seron

We present a novel method to compute componentwise ultimate bounds and invariant regions for a class of switching discrete-time linear systems with perturbation bounds that may depend nonlinearly on a delayed state. The method has the important advantage that it allows each component of the perturbation vector to have an independent bound and that the bounds and sets obtained are also given componentwise. This componentwise method does not employ a standard norm for bounding either the perturbation or state vectors, and thus may avoid conservativeness due to different perturbation or state vector components having substantially different bounds. We also establish the relationship between the class of switching linear systems to which the proposed method can be applied and those that admit a common quadratic Lyapunov function. We illustrate the application of our method via numerical examples, including the fault tolerance analysis of the feedback control of a winding machine.


IFAC Proceedings Volumes | 2008

Analysis and Improvements of a Systematic Componentwise Ultimate-bound Computation Method

Hernan Haimovich; Ernesto Kofman; María M. Seron

Abstract We perform in-depth analysis and provide improvements of a systematic componentwise ultimate-bound computation method recently introduced in the literature. This method was shown to have many advantages over traditional ultimate-bound computation methods based on the use of quadratic Lyapunov functions. The analysis performed enhances our understanding of the componentwise methodology, and simplifies the search for improvements. The improvements provided aim at reducing the conservatism of the componentwise ultimate-bound computation methods even further, hence leading to tighter bounds. These improvements do not alter the systematic nature of the method.


International Journal of Control | 2006

Geometric characterization of multivariable quadratically stabilizing quantizers

Hernan Haimovich; María M. Seron; Graham C. Goodwin

In this paper, we present an explicit geometric characterization of quadratically stabilizing state feedback laws that are based on the use of multivariable quantizers of minimum dimension. This characterization consists of a set of necessary and sufficient conditions for a quantized static state feedback to render a given quadratic function a Lyapunov function for the closed-loop system. These necessary and sufficient conditions provide a means to analyse and design such quantized feedback laws and are derived from set inclusion conditions that are necessarily satisfied by the quantization regions and values of a quadratically stabilizing quantizer.

Collaboration


Dive into the Hernan Haimovich's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Julio H. Braslavsky

Commonwealth Scientific and Industrial Research Organisation

View shared research outputs
Top Co-Authors

Avatar

Esteban N. Osella

National Scientific and Technical Research Council

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Alexis J. Vallarella

National Scientific and Technical Research Council

View shared research outputs
Top Co-Authors

Avatar

Ernesto Kofman

National Scientific and Technical Research Council

View shared research outputs
Top Co-Authors

Avatar

José Luis Mancilla-Aguilar

Instituto Tecnológico de Buenos Aires

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Tristan Perez

Queensland University of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge