## Mathematical Modeling, Analysis, and Control of Hybrid Dynamical Systems

View this Special IssueResearch Article | Open Access

Josep Ferrer, Juan R. Pacha, Marta Peña, "Controllability of Continuous Bimodal Linear Systems", *Mathematical Problems in Engineering*, vol. 2013, Article ID 342548, 14 pages, 2013. https://doi.org/10.1155/2013/342548

# Controllability of Continuous Bimodal Linear Systems

**Academic Editor:**Rongni Yang

#### Abstract

We consider bimodal linear systems consisting of two linear dynamics acting on each side of a given hyperplane, assuming continuity along the separating hyperplane. We prove that the study of controllability can be reduced to the unobservable case, and for these ones we obtain a simple explicit characterization of controllability for dimensions 2 and 3, as well as some partial criteria for higher dimensions.

#### 1. Introduction

A switched linear system (see, e.g., [1]) is a hybrid system (see, e.g., [2]) which consists of several linear subsystems and a rule that orchestrates the switching among them. The classical piecewise linear systems (see [3]) occur when the switching law depends only on the state. In recent years, piecewise linear dynamical/control systems have again attracted the attention of the researchers, indeed, because they are the most natural extension to linear systems in order to capture nonlinear phenomena as, for instance, limit cycles, heteroclinic and homoclinic orbits, and strange attractors. Also, their application has been especially successful in many engineering problems, such as the analysis and design of electronic oscillators (see [4]) or control systems.

They consist of two or more linear subsystems, each one acting in a different region—separated from the others by hypersurfaces—of the entire state space. In the basic case of bimodal systems, a couple of linear subsystems act at each side of a hyperplane. One says that the piecewise linear system is continuous if both adjacent subsystems coincide on the separating hypersurface.

For elementary circuits (see [4]), the number of state variables is typically two or three. Moreover, most of the nonlinear behavior appears already in low dimensions, even in the bimodal case. For example, the study in [5] gives a complete characterization of the focus-center limit cycle bifurcation for planar bimodal linear systems. Later works (see [6–8]) extended this analysis to the 3D case. Contrarily to what happens in 2D, in 3D, a remarkable phenomenon occurs, involving bimodal linear systems. Thus, whereas in 2D, a point placed on the separating hyperplane is asymptotically stable when both subsystems are stable; in 3D, unstable global dynamics might arise under the same hypotheses.

Concerning structural stability (i.e., with regard to small perturbations), we point the reader to [9] for an account of generic properties and to [10] for a full characterization (both studies on the 2D case). About control systems see, for example, [11] (again for the planar case).

To investigate continuous bimodal systems, several authors have used reduced forms of the matrices involved, both for dynamical systems (e.g., in [4]) and control systems (e.g., in [12, 13]). Here, we will use the reduced forms in [14, 15]. For a MAPLE program useful to compute them in 2D and 3D, see http://www.ma1.upc.edu/joanr/html/cfbpwls.html.

The goal of this paper is to find explicit and effective criteria for controllability of continuous bimodal linear control systems (for a study of the discrete-time planar case, see [16], where explicit necessary and sufficient conditions for controllability and reachability are given). Other problems concerning discrete-time systems are considered in [17], where a controller is designed. In other cases as in [18] or in [19], the system is continuous and the controller is digital. A state feedback controller for piecewise linear systems is designed in [20]. Problems as stability and stabilization of switched systems are considered in [18, 21–23] or in [24]. In [25], the problem of controllability is addressed for linear time-invariant dynamical multiagent systems. Further contributions include switched systems with stochastic perturbations (see [26] and the references therein). In our approach, the key point in the study of the controllability relies on applying the implicit general conditions in [27] to the matrices in the reduced form given in [15]. We thoroughly achieve this objective for the 2D and 3D cases (Propositions 18 and 19) and obtain partial criteria for higher dimensions (Lemma 12 and Proposition 14).

We stress that we have included the unobservable case (which appears in a natural way, e.g., when considering parametrized families of systems), and we have proved that the study of the controllability for observable systems can be reduced to the unobservable ones (Proposition 17).

The structure of this paper is as follows. First, in Section 2, we recall the definition of continuous bimodal linear control system (CBLCS), the concept of controllability, and the implicit criterion in [27]. In Section 3, we provide the reduced forms for the matrices defining the subsystems of the CBLCS (see [15]). Later on, in Section 4 we obtain some partial criteria for controllability and uncontrollability of observable systems in higher dimensions and show that observable systems can, generically, become unobservable by adding the appropriate feedback (previously, Definitions 10 and 15 suit the necessary notions of observability and feedback system to the present context). As feedbacks preserve controllability (see Remark 16), there is no loss of generality in assuming that the system is unobservable. Subsequently, Section 5 tackles the controllability of unobservable CBLCS in dimensions 2 and 3. Last section illustrates the above results with an example of a 3D system (an occasional unobservable circuit). To complete the paper, conclusions appear at the end.

To summarize, the main contribution of this paper is twofold. First, we prove that one can reduce the study of the controllability of continuous bimodal linear control systems to the study of the controllability of the unobservable ones. Secondly, we provide effective and explicit criteria for controllability. Our main motivation is to give effective tools for the study of the controllability of systems of this kind (such as circuits; see Section 6). In comparison with the previous criteria in [27], the characterization of controllability given in this paper is simple and explicit, especially for dimensions and . Up to our knowledge, there are no criteria for the study of the controllability of the systems at hand focused on unobservable systems. In addition, we discuss the practical use of the theoretic results presented by means of an example.

Throughout the paper, will denote the set of real numbers; the set of matrices having rows, columns, and entries in ; the transpose matrix of . We will simply write when ; will be the group of nonsingular matrices in and will be its identity element. Finally, we will denote by the natural basis of the Euclidean space .

#### 2. Preliminaries

We recall that a (single) linear control system is a system of type
, and , where , , are the state variables, and is the control function. In 1960, Kalman (see [28]) introduced the concept of *controllability* (see Definition 3) and showed that it is equivalent to the *controllability matrix*, defined as
having maximal rank. Therefore, the above system is controllable if and only if
The notion of controllability (Definition 1) is valid as well for bimodal systems and Theorem 4 below (see [27]) generalizes the characterization (3) in an implicit form.

In general, a bimodal linear control system consists of two subsystems
acting on disjoint semispaces. It is called *continuous* if both subsystems coincide in the common separatrix boundary of these semispaces, which, in particular, implies that . Hence, one defines the following.

*Definition 1. *A *continuous bimodal linear control system* (CBLCS) is a system of the form
where , satisfying that both subsystems in (5a) coincide for , that is to say

*Remark 2. *In several real applications, the systems often include state delay (for recent works on switched systems with state delay, see [23, 29–33]). However, this aspect is beyond the scope of this paper and possible extensions in this sense are contemplated as future work.

As we have pointed, the notion of controllability in [28] is also valid for these systems, and so they are controllable if they can be driven from a given initial state to a given final state by means of an appropriate control. More precisely, we have the following.

*Definition 3. *One says that system (5a) and (5b) is (*completely*) *controllable* if for any pair of states there exists a locally integrable input such that the solution of (5a) and (5b) transfers the state to the state , that is, for some .

Obviously, a necessary condition is . The next theorem extends to CBLCS the characterization of controllability given in [28] for single control systems.

Theorem 4 (Çamhbel et al., 2004; see [27]). *Consider a CBLCS defined by (5a) and (5b) and the assumption (6). Let one denote by the matrix such that . Then, this system is controllable if and only if the following conditions hold.** The pair is controllable. ** Whenever there exist , and such that
then, necessarily, .*

*Remark 5. *Concerning the above theorem, two points are worth mentioning.(1)Because of (6), is at most of rank and the kernel of is contained in the kernel of , and so the columns of belong to the span of . Therefore, there exists a matrix such that (see [27]).(2)In condition (C1), denotes the matrix formed by the column matrices and . Thus, this condition means that the controllability matrix —see (2)—has full rank.

Our aim is to derive, from Theorem 4, explicit criteria for controllability by means of simplifying the involved matrices. Firstly, note that, as an immediate consequence of Definition 3, linear transformations of the state variables do not change the controllable character of the system. Hence, one can assume so that the separating subspace is and (6) in Definition 1 becomes namely, and differ only in their first column, and , respectively, and From now on, these simplifications are assumed. Then we will refer to a CBLCS simply as the triple verifying (10).

#### 3. Admissible Basis Changes

Here we introduce, in Definition 6, the *admissible basis changes* as those changes in the state variables space preserving the hyperplanes and hence the matrix . Next, in Proposition 8, we see that Conditions (C1) and (C2) of Theorem 4 are invariant under these changes, so one can check the controllability on any set of transformed matrices. Finally, Theorem 11 introduces the specific reduced forms which we will use in the sequel.

*Definition 6. **Admissible basis changes* are basis changes in the state space variables preserving the hyperplane . One will write for the subgroup of the corresponding matrices in . Therefore,

*Remark 7. *We emphasize two points.(1)The basis changes in Definition 6 transform the triple of matrices into , whereas .(2)Moreover, these transformations are just the same as the ones in [15] for dynamical systems, so the reduced forms are also valid for CBLCS here.

Proposition 8. *For a given CBLCS, admissible basis changes preserve Condition (C1) and the values , in Condition (C2).*

*Proof. *Consider a CBLCS defined by . Let us see that the vector verifying is just as follows:
Then, the pair is controllable if and only if is controllable, sinceThis proves that Condition (C1) is invariant under admissible basis changes. Besides, from
it is clear that
is equivalent to
and, hence, admissible basis changes also preserve the values of in Condition (C2).

From Proposition 8, it follows that one can check the controllability conditions of Theorem 4 on any triple of matrices obtained, via an admissible basis change, from the triple defining the CBLCS. Hence, there is no loss of generality in assuming that the matrices in are in the reduced form derived in [15] (see Remark 7 above). We recall this result for the reader’s convenience.

Lemma 9 (Ferrer et al. 2010, see [15]). *Given a CBLCS , then
**
where , are the observability matrices, that is,
*

*Definition 10. *Under the above conditions, one writes
and one defines
as the *observability rank* of the system. In particular, the system is observable if .

Theorem 11 (Ferrer et al., 2010; see [15]). *With the notation of Lemma 9 and Definition 10 above, one has the following.** The subspace is invariant under the endomorphisms and corresponding to the matrices and , and their restrictions coincide, that is,
and one will write for the Jordan normal form of these restricted endomorphisms. **There exists an admissible basis change such that the following matrices are obtained:
where the matrices , , , and are given, respectively, by
* *and hence the following hold. The coefficients , are univocally determined by imposing the following relations:
on the characteristic polynomials of , , , , and . The coefficients , depend on the admissible basis change applied.*

*Moreover,*

*where and also depend on the admissible basis change. In particular, if and only if .*

#### 4. General Explicit Criteria

Firstly, from the results in Section 3, we derive in Lemma 12 and Proposition 13 general sufficient conditions for uncontrollability of CBLCS. Next, from Theorems 4 and 11, Proposition 14 provides a sufficient condition for controllability of *observable* systems. Finally, Proposition 17 states that, if an observable CBLCS does not satisfy the hypothesis of Proposition 14, one can bring it into an unobservable feedback system (see Definition 15) in order to study its controllability.

Lemma 12. *Let be a CBLCS and as in Theorem 11. If , then the system is uncontrollable. In particular, it is uncontrollable whenever .*

*Proof. *If , a trajectory having initial conditions in remains in whatever the applied control, and so the system is uncontrollable.

The next proposition states a more specific condition for uncontrollability. We recall that is the observability rank (see (21)).

Proposition 13. *Let be a CBLCS in the form of Theorem 11; then, if , the system is uncontrollable.*

*Proof. *The assertion is obvious for . If , it is clear that the last vectors of the admissible basis considered in Theorem 11 span the subspace , and so the result follows from Lemma 12.

Now, we focus on observable systems.

Proposition 14. *Let be an observable CBLCS in the form of Theorem 11. Then, if , the system is controllable.*

*Proof. *For observable CBLCS, ; thus, the reduced matrices in Theorem 11 take the following form:
from which it follows at once that , so Condition (C1) of Theorem 4 holds. Condition (C2) is also trivial, because no makes the last columns of
equal .

If the hypothesis in Proposition 14 fails, we can study the controllability of a given observable CBLCS on the corresponding unobservable one obtained by the feedback described in Proposition 17.

As in the classical case of (single) control systems, feedback transformations result from applying additional controls of the form .

*Definition 15. *If is a CBLCS, one says that the system is the *feedback system* obtained from by means of the feedback .

*Remark 16. *Obviously, feedback transformations preserve controllability.

Proposition 17. *Let be an observable CBLCS which, again, one assumes to be in the form of Theorem 11. If ; the feedback system determined by the triple
**
with
**
is unobservable, having rank (recall Definition 15).*

*Proof. *From the reduced forms of Theorem 11, it is clear that
where the upper and lower left blocks are of sizes and , respectively, and, hence,
which closes the proof.

Taking into account this proposition, one concludes that, beyond the cases covered by Propositions 13 and 14, the study of the controllability can be restricted to the study of unobservable systems.

#### 5. Explicit Criteria for and

With the above tools, we will obtain explicit simple criteria when (in Proposition 18) and (in Proposition 19).

Firstly, let us see that the criterion in [21] for observable planar systems is also valid for the unobservable ones.

Proposition 18. *Let one consider a planar CBLCS defined by , with
**
One writes , for the controllability matrices of the corresponding subsystems, that is,
*

*It turns out that*the system is unobservable if and only if ; then, it is controllable if and only if or, equivalently,

*Proof. * One checks immediately that if and only if (see Definition 10). Take . If , the system is uncontrollable from Proposition 13. Now, assume . One can rewrite Condition (C2) of Theorem 4 in the following form:
, and implies . Then,
therefore, Condition (C2) of Theorem 4 is equivalent to (36). In addition, (36) implies Condition (C1) in the same theorem, because one can rewrite this condition as
which completes the proof of Proposition 18.

Finally, the proposition below details the case .

Proposition 19. *For , let one consider an unobservable CBLCS defined by , which one assumes to have the reduced form in Theorem 11. Let one denote by , the controllability matrices of both subsystems, that is,
**
and by , , the determinant of the submatrix corresponding to the rows and the two first columns.* If , the reduced forms are
and then one has the following. If , the system is uncontrollable. If and , the system is controllable if and only if
If , the system is controllable if and only if
If , one has the following possibilities. If , the system is uncontrollable. If , one distinguishes between the following corresponding four different reduced forms.

If then the system is uncontrollable.

If then the system is controllable if and only if moreover, , , so that .

If , with , then the system is controllable if and only if moreover, , , so that .

If with , then the system is controllable.

*Proof. *We will go through the following different cases.*Case 1.1*. It follows straightforward from Proposition 13.*Case 1.2*. In this case we have
and analogously for . On the other hand, for the triple of matrices (41), Condition (C2) of Theorem 4 can be rewritten as
for any pair such that
and, as ,
Hence, . Obviously, we can assume , so that
therefore, Condition (C2) of Theorem 4 is equivalent to
which obviously implies Condition (C1).*Case 1.3*. First note that, as , we can assume . Then,
In particular, , so we can write as
and analogously for . Now the pairs , in Condition (C2) of Theorem 4 must verify
For , necessarily (otherwise, by the first equation). We can assume , so that
Thus, a necessary condition for the controllability of the system is
Furthermore, we must consider the pairs with . We can assume , so that and
Now we distinguish the following three situations, depending on the solutions of the last equation. If , none is a solution of (61), so that Condition (C2) of Theorem 4 is equivalent to
but
Hence, Condition (C1) of Theorem 4 holds, and also . If , (61) has a unique solution:
therefore, Condition (C2) of Theorem 4 is equivalent to
which obviously implies Condition (C1). Finally, if , we have infinitely many solutions of (61) and then
Notice that
Hence, (43) does not hold. Let us see that conditions of Theorem 4 also fail. From Condition (C2), we have
and it follows that holds for any if and only if
but then Condition (C1) fails, since
Indeed, the first two columns are linearly independent because (by hypothesis) and, as , they span the third one. Finally, it is enough to verify that column is a linear combination of columns and , as direct computation shows
Next, let us assume . Then we have the following.*Case 2.1*. This case follows from Proposition 13.*Case 2.2. *(a) The proof proceeds in an analogous way to the proof of Case 1.2. We compute for any pair such that
Hence, if , then , and none verifies the last equation. On the contrary, if , by taking
we have . Therefore, Condition (C2) of Theorem 4 does not hold.

(b) For the triple of matrices of this case, we haveand analogously for . Now, the pairs , in Condition (C2) of Theorem 4 must verify
For , the only solution is . For , there are infinitely many solutions:
and analogously for . Therefore, Condition (C2) of Theorem 4 is equivalent to
which implies Condition (C1) because

(c) For the triple in this case, one sees that
and analogously for . Now, the pairs , in Condition (C2) of Theorem 4 must verify
If , none verifies the last equation. Hence, we can assume either or , which yields, respectively,
Therefore, Condition (C2) of Theorem 4 is equivalent to
which implies Condition (C1) because

(d) In this case, the pairs , in Condition (C2) of Theorem 4 must verify
Hence, . As , the only solution is , which implies and, in turn, . Therefore, there is no pair verifying Condition (C2) of Theorem 4. Condition (C1) also holds, since the matrix consisting of the three first columns there has maximal rank. Indeed, a straightforward computation leads to
because the second column is just the image of the first one by , with .

*Remark 20. *We note that the use of the reduced forms in Propositions 18 and 19 leads to explicit and simple criteria (in comparison with [27]) for controllability of unobservable systems. These results, combined with the feedback induced unobservability stated in Proposition 17, provide an effective approach to the study of the controllability of the systems at hand. Of course, for piecewise linear systems, one can find in the literature a lot of examples of feedback design for several different purposes (for recent contributions, see [18–20]), but we have not found previous results on using feedbacks to discuss the controllability of a given system. In its current state, the approach presented here is valid for CBLCS. Possible extensions to general switched systems or to other interesting cases, such as systems with state delay, are subject of future research.

#### 6. Example

In this section, we will apply the results in Section 5 to a circuit analyzed in [4] (see Figure 1) which is an example of a 3D CBLCS that becomes unobservable for some values of the parameters. As we will see, the study of the controllability of this system will be an easy computation thanks to the use of Proposition 19.

Application of Kirchhoff laws yields where with being a constant saturation voltage (see [4] and the references therein for further details). Making the change of variables the system becomes when only positive values of are considered. Here, denotes the normalized saturation function, defined by

We ask if the system is controllable by means of a control parameter acting as follows: Now, introducing the new variable yields

Notice that the separating hyperplane is ; therefore, the shift places it into . If, in addition, we write , then, in the new coordinates , the above system takes the following form: where

A simple computation shows that for the system is unobservable, having the following reduced form (see [15]): where Thus, according to Case 1.3 in Proposition 19, the system will be controllable if and only if As in the proof there, and analogously for . In our case one obtains for the product Hence, we need to check only the second condition which, for the above reduced form, writes but taking into account the values of the parameters in (97), it is equivalent to Clearly, the above inequality holds if , but it does not hold if , whereas for , it holds or not depending on the other parameters. Thus, for we have the following.(i)If , the system is controllable. (ii)If , the system is uncontrollable. (iii)If , then controllability requires additional conditions. For example, if one sees at once that the system is controllable. On the other hand, necessary conditions for controllability are