- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Abstract and Applied Analysis

Volume 2012 (2012), Article ID 808290, 16 pages

http://dx.doi.org/10.1155/2012/808290

## Well-Posedness of Reset Control Systems as State-Dependent Impulsive Dynamical Systems

^{1}Departamento de Informática y Sistemas, Universidad DE Murcia, 30071 Murcia, Spain^{2}Departamento de Ingenieria Sistemas y Automatica, Universidad Politécnica de Cartagena, Cartagena, Spain

Received 23 April 2012; Accepted 27 September 2012

Academic Editor: Elena Braverman

Copyright © 2012 Alfonso Baños and Juan I. Mulero. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Reset control systems are a special type of state-dependent impulsive dynamic systems, in which the time evolution depends both on continuous dynamics between resets and the discrete dynamics corresponding to the resetting times. This work is devoted to investigate well-posedness of reset control systems, taking as starting point the classical definition of Clegg and Horowitz. Well-posedness is related to the existence and uniqueness of solutions, and in particular to the resetting times to be well defined and distinct. A sufficient condition is developed for a reset system to have well-posed resetting times, which is also a sufficient condition for avoiding Zeno solutions and, thus, for a reset control system to be well-posed.

#### 1. Introduction

Reset control systems [1–3] are a type of impulsive hybrid systems, in which the system state (or part of it) is reset at the instants it crosses some reset set. Impulsive hybrid systems are an active area of systems theory that has been developed in the last years. Two classical monographs are [4, 5], where reset control systems without external inputs are a particular case of autonomous system with impulse effects.

In this work, reset control systems will be formulated as a particular type of impulsive dynamical systems (IDSs), more specifically as state-dependent IDS, following the impulsive/hybrid dynamic system framework developed in [6]. In this framework, existence and uniqueness of solutions over a forward time interval is based on the well-posedness of resetting times.

The main goal of this work is to investigate well-posedness of reset control systems taking as starting point the classical definition of Clegg and Horowitz. This formulation has been also followed in several recent works, for example [7, 8] and references therein, and also [9–12]. As it is well known, reset control systems and IDS in general can exhibit behaviors that can be pathological from a control point of view. As it has been shown in [6], definition of IDS solutions has to deal with the problem of beating, deadlock, and Zenoness. In general, a reset control system will be considered well-posed if the resetting times are well-posed (they are well defined and are distinct), meaning that a number of beating or pulse phenomena are avoided, and in addition Zeno solutions do not exist.

As it will be shown, simple geometric conditions will be derived for avoiding the presence of these pathological behaviours. In Section 2, preliminary material and basic results are given. Section 3 develops a result for reset control systems to have well-posed resetting times. Finally, Section 4 tackles with the problem of existence of Zeno solutions.

*Notation. *In this work, is the set of nonnegative real numbers, and denotes the column vector . In addition, stands for the unit vector in which the th-component is . For a set , is the closure of . On the other hand, for a linear and time-invariant system with state space matrices , the subspace of unobservable states is given by the null space of the observability matrix , where

#### 2. Preliminaries and Problem Setup

This work deals with a special class of hybrid systems called impulsive dynamical systems (IDSs, [6]). In particular, with state-dependent IDS having the form
where , , is the system state at the instant , is the reset set, and and are matrices of dimension . The following material, including definition of IDS solutions and well-posedness of resetting times, is strongly based on [6]. The first equation in (2.1) will be referred to as the *continuous-time dynamics* or simply *base system dynamics*, while the second equation in (2.1) will be referred to as the *resetting law*. When at some * resetting* time , is true (the reset condition is active, and a *crossing* is performed), the state jumps to ; it will be assumed that resetting times are * well-posed*, that is, they are well defined and distinct for any initial condition. Otherwise, the state evolves with the base system dynamics. The set will be referred to as the after-reset set.

A function is a *solution* of the IDS system (2.1) on the interval , with initial condition , if is left-continuous, and satisfies (2.1) for all . For further discussion on solutions to impulsive differential equations and IDS solutions, see [4–6]. In general, there exists a unique solution of the (continuous) base system with initial condition on , for any . Informally speaking, the solution of the IDS (2.1) from the initial condition is given by for , where is the first resetting time satisfying . Then, the state is instantaneously transferred to according to the resetting law. The solution , (being the second resetting time given by is given by , and so forth. Note that the solution of (2.1) is left-continuous, that is, it is continuous everywhere except at the resetting times , and

##### 2.1. Well-Posed Resetting Times and Zeno Solutions

Two standard assumptions for well-posedness of resetting times of state-dependent IDS [6], that will be used in this work, are (A1) there exists such that , for all .(A2).

Note that for a particular solution , the first resetting time is well defined since exists (and thus, it is unique by uniqueness of solutions of the base system). Analogously, for , the resetting time is well defined since again exists, and in addition , for any . Here, is a solution of the base system with initial condition , that is, . Therefore, if for any initial condition the resetting times are well defined, functions are defined for , where is the th resetting time, and by definition . Note that for a particular solution, there may exist no crossings, a finite or a infinite number of crossings, and in a finite or infinite time interval , and that functions are single valued by uniqueness of the base system solutions.

Since by assumptions A1 and A2, the resetting times are well defined and distinct, and since for a given initial condition, the solution to the base system differential equation exists and is unique, it follows that the solution of the IDS (2.1) also exists and is unique over a forward time interval [6]. For the IDS (2.1) with well-posed resetting times, a *Zeno solution * exists on the interval for some initial condition , if there exists an infinite sequence of resetting times , and a positive number , such as as . Note that the solution is not defined beyond the time . If there does not exist Zeno solutions for any initial condition, then the solutions of the IDS (2.1) exists and are unique for any initial condition on .

Note that conditions A1 and A2 can be interpreted as: (i) states that belong to the closure of , and does not belong to , evolve with the continuous base dynamics for some finite time interval (A1); (ii) after-reset states are not elements of the reset set (A2). In other words, for resetting times to be well-posed a IDS system solution can only reach through a point belonging to both and its boundary ; and if a solution reaches a point in that is on its boundary, then it is instantaneously removed from . Roughly speaking, condition A1 avoids the presence of deadlock, while condition A2 avoids beating or livelock (using these terms in the sense given in [6]).

In the following, two examples of ill-posed (not well-posed) second-order IDS are shown to illustrate conditions A1 and A2. In both cases, the base system corresponds to some matrix , making the equilibrium point a center, and the resetting law is . (a)(Figure 1(a)), here the reset set is the rectangle
and the after reset set is
that is, the interval in the -axis. From an initial condition in the point **,** the trajectory reaches the reset set at some point belonging to both and its boundary . Thus, the first resetting time is well defined, and then the trajectory jumps to the point . From the point , the system trajectory evolves as the base system until it reaches a point that belongs to but not to . Thus, condition A1 is not satisfied since the trajectory enters into for any arbitrarily small time after reaching the point (the second resetting time is undefined). (b)(Figure 1(b)), is the grey region (it contains its boundary), and the after reset set is . Note that the . In this case, a trajectory starting from the point reaches at the point which belongs both to and its boundary (thus, A1 is satisfied, and the first resetting time is well defined). After that, the trajectory jumps to the point that belongs both to and and then make an infinite number of resets (condition A2 is not satisfied).

##### 2.2. Reset Control Systems

In this work, reset control systems will be represented by the state-dependent IDS (2.1). Consider the feedback system given by Figure 2, where the (single input-single ouput) plant is described by the following:
and the (single input-single output) *reset* compensator is given by the impulsive differential equation:
Here is the dimension of the state , and is the dimension of the state . is a diagonal matrix with if the state of the compensator is to be reset, and otherwise. In general, it is assumed that the last compensator states are set to zero at the resetting times. In the case of a full-reset compensator, all the elements of are 0. Consider the closed loop autonomous unforced system given by , , and define the (closed loop) state of dimension , being . The result is that the reset control system is given by the state-dependent IDS
where

In control practice, it is required that reset control system solutions will be well-posed in the sense that they exist and are unique for . By definition, the reset control system (2.7)–(2.11) is *well-posed* if for any initial condition , a solution exists and is unique on . As a state-dependent IDS system, the reset control system is well-posed if resetting times are well-posed, and in addition, there do not exist Zeno solutions for any initial condition. In Section 3, the well-posedness of resetting times for reset control systems will be investigated. The existence of Zeno solutions is explored in Section 4.

#### 3. Reset Control Systems with Well-Posed Resetting Times

The reset control system (2.7)–(2.11) is a particular case of the state-dependent IDS (2.1), with a reset set (it will be referred to as * reset surface*) , the null space of , and with an after-reset set, or *after-reset surface*, . Since is a projector, it results that in general , and thus, without any modification, the reset control system (2.7)–(2.11) does not have well-posed resetting times. This problem was detected in [7, 8], and a partial solution was given by redefining both sets as , and , where after-reset states are simply removed from as given by (2.11). Since is a projector, then the set is the column space of , that is . Thus, the above definitions are equivalent to

Proposition 3.1. *The reset system (2.7), with and given by (3.1), has well-posed resetting times if
**
where is the base system observability matrix. *

*Proof. *If they do exist, by (3.1), resetting times are distinct since is equivalent to A2, thus, the proof is centered in their existence. Note that by (3.1), in A1. By time invariance, A1 is equivalent to for and some . Here depends on , but the dependence will not be explicitly shown by simplicity. In general, given , the first crossing with is at the instant , and finally A1 is equivalent to the existence of a lower bound for , for any given . From (3.1), is simply given by . If is by definition a lower bound of the set , and is by definition a lower bound of the set (both depending on ), then . By simplicity, consider in first instance that has distinct eigenvalues; in this case (see the Appendix)
Since is a sum of exponentials (in fact it is a Bohl function [13]), and thus, it is an analytical function, it is true that is either zero for all or has isolated zeros. As a result, two options are possible as follows if (, for all ), or there exist an interval in which for some . Now, if condition (3.2) is satisfied then for any only the second option is possible, and thus, , that is, A1 is satisfied (condition (3.2) is sufficient for A1). Finally, in the case in which the eigenvalues of may be repeated, similar expressions may be found for (see the Appendix), and the above arguments are again applied.

*Remark 3.2. *Note that, in particular, well-posedness of resetting times is obtained if the base system is observable, since in this case . But some unobservable base linear systems can also produce reset systems with well-posed resetting times, as far as the after-reset surface does not contain unobservable states (different to ).

*Remark 3.3. *Note that, in general, Proposition 3.1 may be applied to reset systems given by (2.7) with arbitrary values , , and as far as the developed conditions apply (not necessarily reset control systems).

*Remark 3.4. *For the reset and after-reset sets given by (3.1), functions , are homogenous (of degree 0), that is for any real number , since at a resetting time .

*Example 3.5 (III-posed reset system). *Consider a reset system (2.7), with the following system matrices
where the sets and are defined according to (3.1) as , and . This is due to the fact that the after-reset surface is a subset of the unobservable subspace of the linear base system, which is given in this case by
As a result, from any initial condition , the condition A1 is not satisfied. Note that the origin is a stable focus in the plane , and that the first resetting time is not well defined; in fact, the reset system is not well-posed.

*Example 3.6 (Unobservable base system and well-posed resetting times). *This example, adapted from [8], shows how an unobservable base system may define a reset system with well-posed resetting times, as far as the unobservable subspace does not contain after-reset states. Consider a reset control system (2.7) with
that has a unobservable mode corresponding to a stable pole-zero cancellation in the linear base system, where the plant has a transfer function , and the base compensator is (the reset compensator is a first-order reset element -FORE). In addition, the after-reset and reset surfaces are given by and , respectively. In this case, the set is not a subset of the linear base system unobservable subspace, given by
As a result, Proposition 3.1 may be used to ensure that the system has well-posed resetting times (see Figure 3 for system solutions corresponding to two initial conditions).

#### 4. Zeno Solutions of Reset Control Systems

In this Section, the existence of Zeno solutions is investigated for reset control systems described by (2.7)–(2.10), and with reset and after-reset surfaces given by (3.1). In principle, as discussed in Section 2.2, the reset control system may exhibit Zeno solutions even in the case in which resetting times are well-posed, that is, they are well defined and are distinct. However, as it will be shown in the following, well-posedness of resetting times is sufficient to avoid the existence of Zeno solutions in reset control systems, and thus, for reset control systems to be well-posed.

Proposition 4.1. *The reset control system (2.7)–(2.10), with reset and after-reset surfaces given by (3.1), will not have Zeno solutions if it has well-posed resetting times.*

*Proof. *It will be assumed that , and that there exist an infinite number of crossings for (otherwise no Zeno solution may exist), then reset intervals are given by , . In the following, the notation is used, and the argument is dropped by simplicity. Note that reset intervals are well defined and , , by well-posedness of the resetting times. The proof will be based on the fact that in general there can only exist a finite sequence of reset intervals such as , for some arbitrarily small but fixed, and some finite positive integer , being the dimension of the after reset surface . Thus, the sequence of resetting times , with , will not be a Cauchy sequence, and thus, , as . As a result, Zeno solutions does not exist. Assume that the plant state equations (2.5) are given in observer form (note that the plant has not to be necessarily observable), that is,
then , and is
where stands for a non(necessarily) zero term. By simplicity, the case of full reset is approached in first instance. An after-reset state is given by
for some values , being the number of plant states. Thus, in the case of full reset.

Let us start with the case . In this case, for any , it is clear that for some constant , since is homogenous (see Remark 3.4). In addition, since for some real number . As a result , , that is, resetting times are periodic with period , and no Zeno solution may exist.

The case is analyzed in the following. Consider an initial condition , that is, . If the solution crosses the reset surface at time for some arbitrarily small, and thus, , then
Now, since the control system (2.7)–(2.10) has well-posed resetting times, then the right hand of (4.4) is not identically zero for any . Now, using the special structure given in (4.2), it is obtained that
for arbitrarily small . In addition, the following after-reset state is . Repeating the above argument, the solution will cross again at the instant . If for some , then
where the properties for and , for a real constant , have been used. Now, using (4.5) and (4.6), the result is that given some arbitrarily small, then , which is absurd. Thus, by contradiction, it is true that , and thus any initial condition in the set that produces a first reset interval arbitrarily small, gives a larger second reset interval . Thus, Zeno solutions does not exist in this case either.

In the rest of the proof, the terms are directly neglected by simplicity. For the general case in which the dimension of is , with initial state , a similar reasoning results in the set of equations
which leads to an algebraic equation of order in , being its solutions , , , . And again, it can not exist a sequence of reset intervals , with and arbitrarily small, showing that a Zeno solution is not possible in the full-reset case.

The case of partial reset can be conveniently transformed into the full-reset form by a change of coordinates, by a simple resorting of coordinates so that the bijectivity is guaranteed. We will consider the system structure decomposition by writing the states as , where stands for the states of the plant, for the nonresetting compensator states and for the resetting compensator states. Define the linear transformation from to such that
that is,
Note that is a square matrix, all of whose entries are or , and in each row and column of there is precisely one . This means that is a permutation matrix. Clearly, such a matrix is unitary, hence orthogonal, so . The nonsingular matrix allows to rewrite the dynamical system via a similarity transformation (congruence transformation):
where , , and , and in addition, the reset surface is transformed into . Note that so that the output is not changed by the transformation, that is, as expected. Henceforth, (4.10) is in full-reset form. Since observability is invariant under similarity transformations, it is clear that (2.8) is well-posed if and only if (4.10) is well-posed. Finally, to complete the proof it is necessary to show that the observability matrix has the structure given in (4.2) (using state transformations if needed). This is simply done by considering the substate . In general, there always exists a state transformation of to , such that the state submatrix corresponding to is in the observer form, and thus, the observability matrix has the structure given in (4.2) once unobservable states are eliminated.

##### 4.1. Example: Well-Posed Reset Control System with Partial Reset

Consider a reset control system, where the plant, with state , is given by and the reset compensator, with state , by that is the reset control system has a partial reset compensator: it is a parallel connection of an integrator and a Clegg integrator, where only the state is set to zero at the resetting times. The closed-loop system is given by the matrices and the closed-loop state . This reset control system is well-posed, since and then, . Following the reasoning given in the proof of Proposition 4.1, the closed-loop state can be transformed into a state in which the observability matrix has the form (4.2). In this case, this is obtained with . Thus, the initial conditions that produces a crossing in a arbitrarily small time are of the form or equivalently Now, the second after-reset state is given by and according to Proposition 4.1, cannot produce a new crossing in a time less than or equal to . This fact can be verified by computing solutions to the implicit equation for , given . The solution is shown in Figure 3, where is given.

Note that for to be arbitrarily small, the initial condition in the after-reset surface must be given by (4.15), that is, . Then, as a result, the state after the first reset is given by (4.16). And then the value of the second resetting time can be obtained from Figure 4 with . The result is that if the first resetting time is arbitrarily small, then the second resetting time is arbitrarily close to a number (it can be approximately computed by numerically solving the implicit equation).

#### 5. Conclusions

Well-posedness of reset control system has been investigated using a state-dependent impulsive dynamic system (IDS) representation. Reset systems have been shown to be well-posed, in the sense that resetting times of the IDS are well defined and are distinct for any initial condition, and in addition, no Zeno solutions do exist. A sufficient condition for the well-posedness of resetting times has been elaborated, based on the observability of after-reset states. In addition, it has been shown that reset control systems do no exhibit Zeno solutions if resetting times are well-posed. On the other hand, it has also been revealed several properties related with the structure of the resetting times: (i) an initial condition in the after-reset surface (having dimension ) will have sequences of decreasing reset intervals with length at most ; (ii) resetting times as a function of the initial condition, is in general a discontinuous mapping, which explains to certain extent the complexity in the analysis of reset control systems.

#### Appendix

In the following, it is shown that .

By simplicity, consider in first instance that the closed-loop state matrix has distinct eigenvalues, then the matrix exponential may be computed by use the Caley-Hamilton method, that is, where , , are given by Using the notation , and , where stands for the unit in which the -component is , (A.2) can be compactly written as where is a (nonsingular) Vandermonde matrix. Now, by eliminating from (A.1) and (A.3), the equation is transformed into where .

In the case in which the eigenvalues of may be repeated, a similar argument may be applied. Note that may be written as the infinite series . Thus, the polynomial can be factorized by , with or . In addition, has degree no greater than , and thus, . Since the characteristic polynomial is zero for the eigenvalues of , then for . And then . This can be compactly expressed as , and the expression (A.3) is obtained. Now, if has different eigenvalues with multiplicity order , and as a consequence, the characteristic polynomial is . Again, there exists unique polynomials and such as , where y or . Here, can be expressed as , where the coefficients are unique. Since and its derivatives up to order are zero at , then This can be expressed by , where By using arguments based on the Lagrange-Hermite interpolation problem, it can be shown that in fact the matrix is invertible. And then, an expression similar to (A.4) may be obtained.

#### Acknowledgment

This work has been supported in part by FEDER funds and the Spanish Government (Ministerio de Ciencia y Innovacion) under project DPI2010-20466-C02-02.

#### References

- J. C. Clegg, “A nonlinear integrator for servomechnisms,”
*Transactions of The AIEE: Part II*, vol. 77, pp. 41–42, 1958. View at Google Scholar - I. M. Horowitz and Rosenbaum, “Nonlinear design for cost of feedback reduction in systems with large parameter uncertainty,”
*International Journal of Control*, vol. 24, no. 6, pp. 977–1001, 1975. View at Google Scholar - K. R. Krishman and I. M. Horowitz, “Synthesis of a nonlinear feedback system with significant plant-ignorance for prescribed system tolerances,”
*International Journal of Control*, vol. 19, no. 4, pp. 689–706, 1974. View at Google Scholar - D. D. Bainov and P. S. Simeonov,
*Systems with Impulse Effect: Stability, Theory and Applications*, Ellis Horwood, Chichester, UK, 1989. View at Zentralblatt MATH - V. Lakshmikantham, D. D. Bainov, and P. S. Simeonov,
*Theory of Impulsive Differential Equations*, vol. 6, World Scientific, Singapore, 1989. View at Zentralblatt MATH - W. M. Haddad, V. Chellaboina, and S. G. Nersesov,
*Impulsive and Hybrid Dynamical Systems: Stability, Dissipativity, and Control*, Princeton University Press, Princeton, NJ, USA, 2006. View at Zentralblatt MATH - O. Beker,
*Analysis of reset control systems [Ph.D. thesis]*, University of Massachusetts Amherst, Amherst, Mass, USA, 2001. - O. Beker, C. V. Hollot, Y. Chait, and H. Han, “Fundamental properties of reset control systems,”
*Automatica*, vol. 40, no. 6, pp. 905–915, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - A. Baños and A. Barreiro, “Delay-independent stability of reset systems,”
*IEEE Transactions on Automatic Control*, vol. 54, no. 2, pp. 341–346, 2009. View at Publisher · View at Google Scholar - A. Baños, J. Carrasco, and A. Barreiro, “Reset times-dependent stability of reset control systems,”
*IEEE Transactions on Automatic Control*, vol. 56, no. 1, pp. 217–223, 2011. View at Publisher · View at Google Scholar - A. Barreiro and A. Baños, “Delay-dependent stability of reset systems,”
*Automatica*, vol. 46, no. 1, pp. 216–221, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Carrasco, A. Baños, and A. J. van der Schaft, “A passivity-based approach to reset control systems stability,”
*Systems & Control Letters*, vol. 59, no. 1, pp. 18–24, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - H. L. Trentelman, A. A. Stoorvogel, and M. Hautus,
*Control Theory for Linear Systems*, Springer, London, UK, 2001. View at Publisher · View at Google Scholar