scispace - formally typeset
Search or ask a question

Showing papers in "IEEE Transactions on Automatic Control in 2004"


Journal ArticleDOI
TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Abstract: In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.

11,658 citations


Journal ArticleDOI
TL;DR: A Nyquist criterion is proved that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability, and a method for decentralized information exchange between vehicles is proposed.
Abstract: We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We prove a Nyquist criterion that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability. We also propose a method for decentralized information exchange between vehicles. This approach realizes a dynamical system that supplies each vehicle with a common reference to be used for cooperative motion. We prove a separation principle that decomposes formation stability into two components: Stability of this is achieved information flow for the given graph and stability of an individual vehicle for the given controller. The information flow can thus be rendered highly robust to changes in the graph, enabling tight formation control despite limitations in intervehicle communication capability.

4,377 citations


Journal ArticleDOI
TL;DR: This work addresses the problem of performing Kalman filtering with intermittent observations by showing the existence of a critical value for the arrival rate of the observations, beyond which a transition to an unbounded state error covariance occurs.
Abstract: Motivated by navigation and tracking applications within sensor networks, we consider the problem of performing Kalman filtering with intermittent observations. When data travel along unreliable communication channels in a large, wireless, multihop sensor network, the effect of communication delays and loss of information in the control loop cannot be neglected. We address this problem starting from the discrete Kalman filtering formulation, and modeling the arrival of the observation as a random process. We study the statistical convergence properties of the estimation error covariance, showing the existence of a critical value for the arrival rate of the observations, beyond which a transition to an unbounded state error covariance occurs. We also give upper and lower bounds on this expected state error covariance.

2,343 citations


Journal ArticleDOI
TL;DR: This paper forms a control problem with a communication channel connecting the sensor to the controller, and provides upper and lower bounds on the channel rate required to achieve different control objectives.
Abstract: There is an increasing interest in studying control systems employing multiple sensors and actuators that are geographically distributed. Communication is an important component of these distributed and networked control systems. Hence, there is a need to understand the interactions between the control components and the communication components of the distributed system. In this paper, we formulate a control problem with a communication channel connecting the sensor to the controller. Our task involves designing the channel encoder and channel decoder along with the controller to achieve different control objectives. We provide upper and lower bounds on the channel rate required to achieve these different control objectives. In many cases, these bounds are tight. In doing so, we characterize the "information complexity" of different control objectives.

1,715 citations


Journal ArticleDOI
TL;DR: This work presents a stable control strategy for groups of vehicles to move and reconfigure cooperatively in response to a sensed, distributed environment and focuses on gradient climbing missions in which the mobile sensor network seeks out local maxima or minima in the environmental field.
Abstract: We present a stable control strategy for groups of vehicles to move and reconfigure cooperatively in response to a sensed, distributed environment. Each vehicle in the group serves as a mobile sensor and the vehicle network as a mobile and reconfigurable sensor array. Our control strategy decouples, in part, the cooperative management of the network formation from the network maneuvers. The underlying coordination framework uses virtual bodies and artificial potentials. We focus on gradient climbing missions in which the mobile sensor network seeks out local maxima or minima in the environmental field. The network can adapt its configuration in response to the sensed environment in order to optimize its gradient climb.

1,291 citations


Journal ArticleDOI
TL;DR: The problem of achieving a specified formation among a group of mobile autonomous agents by distributed control is studied, and convergence to a point is feasible and convergence is proved under certain conditions.
Abstract: The problem of achieving a specified formation among a group of mobile autonomous agents by distributed control is studied. If convergence to a point is feasible, then more general formations are achievable too, so the focus is on convergence to a point (the agreement problem). Three formation strategies are studied and convergence is proved under certain conditions. Also, motivated by the question of whether collisions occur, formation evolution is studied.

871 citations


Journal ArticleDOI
TL;DR: This paper provides a collection of results that can be viewed as extensions of LaSalle's Invariance Principle to certain classes of switched linear systems that can deduce asymptotic stability using multiple Lyapunov functions whose Lie derivatives are only negative semidefinite.
Abstract: This paper addresses the uniform stability of switched linear systems, where uniformity refers to the convergence rate of the multiple solutions that one obtains as the switching signal ranges over a given set. We provide a collection of results that can be viewed as extensions of LaSalle's Invariance Principle to certain classes of switched linear systems. Using these results one can deduce asymptotic stability using multiple Lyapunov functions whose Lie derivatives are only negative semidefinite. Depending on the regularity assumptions placed on the switching signals, one may be able to conclude just asymptotic stability or (uniform) exponential stability. We show by counter-example that the results obtained are tight.

814 citations


Journal ArticleDOI
TL;DR: A new method of dealing with a time-delay system without uncertainties is devised, in which the derivative terms of the state are retained and some free weighting matrices are used to express the relationships among the system variables.
Abstract: This note concerns the problem of the robust stability of a linear system with a time-varying delay and polytopic-type uncertainties. In order to construct a parameter-dependent Lyapunov functional for the system, we first devised a new method of dealing with a time-delay system without uncertainties. In this method, the derivative terms of the state, which is in the derivative of the Lyapunov functional, are retained and some free weighting matrices are used to express the relationships among the system variables, and among the terms in the Leibniz-Newton formula. As a result, the Lyapunov matrices are not involved in any product terms of the system matrices in the derivative of the Lyapunov functional. This method is then easily extended to a system with polytopic-type uncertainties. Numerical examples demonstrate the validity of the proposed criteria.

724 citations


Journal ArticleDOI
TL;DR: This paper shows that the system's equilibrium formations are generalized regular polygons and it is exposed how the multivehicle system's global behavior can be shaped through appropriate controller gain assignments.
Abstract: Inspired by the so-called "bugs" problem from mathematics, we study the geometric formations of multivehicle systems under cyclic pursuit. First, we introduce the notion of cyclic pursuit by examining a system of identical linear agents in the plane. This idea is then extended to a system of wheeled vehicles, each subject to a single nonholonomic constraint (i.e., unicycles), which is the principal focus of this paper. The pursuit framework is particularly simple in that the n identical vehicles are ordered such that vehicle i pursues vehicle i+1 modulo n. In this paper, we assume each vehicle has the same constant forward speed. We show that the system's equilibrium formations are generalized regular polygons and it is exposed how the multivehicle system's global behavior can be shaped through appropriate controller gain assignments. We then study the local stability of these equilibrium polygons, revealing which formations are stable and which are not.

669 citations


Journal ArticleDOI
TL;DR: The results provide a unifying framework for generating new scheduling protocols that preserve L/sub p/ stability properties of the system if a design parameter is chosen sufficiently small.
Abstract: Results on input-output L/sub p/ stability of networked control systems (NCS) are presented for a large class of network scheduling protocols. It is shown that static protocols and a recently considered dynamical protocol called try-once-discard belong to this class. Our results provide a unifying framework for generating new scheduling protocols that preserve L/sub p/ stability properties of the system if a design parameter is chosen sufficiently small. The most general version of our results can be used to treat NCS with data packet dropouts. The model of NCS and, in particular, of the scheduling protocol that we use appears to be novel and we believe that it will be useful in further study of these systems. The proof technique we use is based on the small gain theorem and it lends itself to an easy interpretation. We prove that our results are guaranteed to be better than existing results in the literature and we illustrate this via an example of a batch reactor.

646 citations


Journal ArticleDOI
TL;DR: It is shown that small disturbances acting on one vehicle can propagate and have a large effect on another vehicle and this limitation is due to a complementary sensitivity integral constraint.
Abstract: This note focuses on disturbance propagation in vehicle strings. It is known that using only relative spacing information to follow a constant distance behind the preceding vehicle leads to string instability. Specifically, small disturbances acting on one vehicle can propagate and have a large effect on another vehicle. We show that this limitation is due to a complementary sensitivity integral constraint. We also examine how the disturbance to error gain for an entire platoon scales with the number of vehicles. This analysis is done for the predecessor following strategy as well as a control structure where each vehicle looks at both neighbors.

Journal ArticleDOI
TL;DR: A method which first transcribes an optimal control problem into an equivalent problem parameterized by the switching instants and then obtains the values of the derivatives based on the solution of a two point boundary value differential algebraic equation formed by the state, costate, stationarity equations, the boundary and continuity conditions, along with their differentiations is developed.
Abstract: This paper presents a new approach for solving optimal control problems for switched systems. We focus on problems in which a prespecified sequence of active subsystems is given. For such problems, we need to seek both the optimal switching instants and the optimal continuous inputs. In order to search for the optimal switching instants, the derivatives of the optimal cost with respect to the switching instants need to be known. The most important contribution of the paper is a method which first transcribes an optimal control problem into an equivalent problem parameterized by the switching instants and then obtains the values of the derivatives based on the solution of a two point boundary value differential algebraic equation formed by the state, costate, stationarity equations, the boundary and continuity conditions, along with their differentiations. This method is applied to general switched linear quadratic problems and an efficient method based on the solution of an initial value ordinary differential equation is developed. An extension of the method is also applied to problems with internally forced switching. Examples are shown to illustrate the results in the paper.

Journal ArticleDOI
TL;DR: The stability of MB-NCSs is studied when the controller/actuator is updated with the sensor information at nonconstant time intervals and sufficient conditions for Lyapunov stability are derived.
Abstract: In model-based networked control systems (MB-NCSs), an explicit model of the plant is used to produce an estimate of the plant state behavior between transmission times. In this paper, the stability of MB-NCSs is studied when the controller/actuator is updated with the sensor information at nonconstant time intervals. Networked control systems with transmission times that are varying either within a time interval or are driven by a stochastic process with identically independently distributed and Markov-chain driven transmission times are studied. Sufficient conditions for Lyapunov stability are derived. For stochastically modeled transmission times almost sure stability and mean-square sufficient conditions for stability are introduced.

Journal ArticleDOI
TL;DR: A new continuous control mechanism that compensates for uncertainty in a class of high-order, multiple-input-multiple-output nonlinear systems is presented and a new Lyapunov-based stability argument is employed to prove semiglobal asymptotic tracking.
Abstract: In this note, we present a new continuous control mechanism that compensates for uncertainty in a class of high-order, multiple-input-multiple-output nonlinear systems. The control strategy is based on limited assumptions on the structure of the system nonlinearities. A new Lyapunov-based stability argument is employed to prove semiglobal asymptotic tracking.

Journal ArticleDOI
TL;DR: A problem of boundary stabilization of a class of linear parabolic partial integro-differential equations in one dimension is considered using the method of backstepping, avoiding spatial discretization required in previous efforts.
Abstract: In this paper, a problem of boundary stabilization of a class of linear parabolic partial integro-differential equations (P(I)DEs) in one dimension is considered using the method of backstepping, avoiding spatial discretization required in previous efforts. The problem is formulated as a design of an integral operator whose kernel is required to satisfy a hyperbolic P(I)DE. The kernel P(I)DE is then converted into an equivalent integral equation and by applying the method of successive approximations, the equation's well posedness and the kernel's smoothness are established. It is shown how to extend this approach to design optimally stabilizing controllers. An adaptation mechanism is developed to reduce the conservativeness of the inverse optimal controller, and the performance bounds are derived. For a broad range of physically motivated special cases feedback laws are constructed explicitly and the closed-loop solutions are found in closed form. A numerical scheme for the kernel P(I)DE is proposed; its numerical effort compares favorably with that associated with operator Riccati equations.

Journal ArticleDOI
TL;DR: A unified framework for design of stabilizing controllers for sampled-data differential inclusions via their approximate discrete-time models is presented and previous results in the literature are extended.
Abstract: A unified framework for design of stabilizing controllers for sampled-data differential inclusions via their approximate discrete-time models is presented. Both fixed and fast sampling are considered. In each case, sufficient conditions are presented which guarantee that the controller that stabilizes a family of approximate discrete-time plant models also stabilizes the exact discrete-time plant model for sufficiently small integration and/or sampling periods. Previous results in the literature are extended to cover: 1) continuous-time plants modeled as differential inclusions; 2) general approximate discrete-time plant models; 3) dynamical discontinuous controllers modeled as difference inclusions; and 4) stability with respect to closed arbitrary (not necessarily compact) sets.

Journal ArticleDOI
TL;DR: A unified methodology for detecting, isolating and accommodating faults in a class of nonlinear dynamic systems is presented and it is shown that the system signals remain bounded and the output tracking error converges to a neighborhood of zero.
Abstract: This paper presents a unified methodology for detecting, isolating and accommodating faults in a class of nonlinear dynamic systems. A fault diagnosis component is used for fault detection and isolation. On the basis of the fault information obtained by the fault-diagnosis procedure, a fault-tolerant control component is designed to compensate for the effects of faults. In the presence of a fault, a nominal controller guarantees the boundedness of all the system signals until the fault is detected. Then the controller is reconfigured after fault detection and also after fault isolation, to improve the control performance by using the fault information generated by the diagnosis module. Under certain assumptions, the stability of the closed-loop system is rigorously investigated. It is shown that the system signals remain bounded and the output tracking error converges to a neighborhood of zero.

Journal ArticleDOI
TL;DR: It is shown that the proposed controllers not only can guarantee global stability, but also transient performance, in the class of uncertain dynamic nonlinear systems preceded by unknown backlash-like hysteresis nonlinearities.
Abstract: In this note, we consider the same class of systems as in a previous paper, i.e., a class of uncertain dynamic nonlinear systems preceded by unknown backlash-like hysteresis nonlinearities, where the hysteresis is modeled by a differential equation, in the presence of bounded external disturbances. By using backstepping technique, robust adaptive backstepping control algorithms are developed. Unlike some existing control schemes for systems with hysteresis, the developed backstepping controllers do not require the uncertain parameters within known intervals. Also, no knowledge is assumed on the bound of the "disturbance-like" term, a combination of the external disturbances and a term separated from the hysteresis model. It is shown that the proposed controllers not only can guarantee global stability, but also transient performance.


Journal ArticleDOI
TL;DR: This work derives sufficient conditions in the form of finite-dimensional linear matrix inequalities when the interconnections are assumed to be ideal to synthesize a distributed dynamic output feedback controller achieving H/sub /spl infin// performance for a system composed of different interconnected sub-units.
Abstract: We consider the problem of synthesizing a distributed dynamic output feedback controller achieving H/sub /spl infin// performance for a system composed of different interconnected sub-units, when the topology of the underlying graph is arbitrary. First, using tools inspired by dissipativity theory, we derive sufficient conditions in the form of finite-dimensional linear matrix inequalities when the interconnections are assumed to be ideal. These inequalities are coupled in a way that reflects the spatial structure of the problem and can be exploited to design distributed synthesis algorithms. We then investigate the case of lossy interconnection links and derive similar results for systems whose interconnection relations can be captured by a class of integral quadratic constraints that includes constant delays.

Journal ArticleDOI
TL;DR: A general framework is established that systematically converts the robust output regulation problem for a general nonlinear system into a robust stabilization problem for an appropriately augmented system and offers a greater flexibility to incorporate recent new stabilization techniques.
Abstract: Output regulation aims to achieve, in addition to closed-loop stability, asymptotic tracking and disturbance rejection for a class of reference inputs and disturbances. Thus, it poses a more challenging problem than stabilization. For over a decade, the nonlinear output regulation problem has been one of the focuses in nonlinear control research, and active research on this problem has generated many fruitful results. Nevertheless, there are two hurdles that impede the further progress of the research on the output regulation problem. The first one is the assumption that the solution or the partial solution of the regulator equations is polynomial. The second one is the lack of a systematic mechanism to handle the global robust output regulation problem. We establish a general framework that systematically converts the robust output regulation problem for a general nonlinear system into a robust stabilization problem for an appropriately augmented system. This general framework, on one hand, relaxes the polynomial assumption, and on the other hand, offers a greater flexibility to incorporate recent new stabilization techniques, thus setting a stage for systematically tackling the robust output regulation with global stability.

Journal ArticleDOI
TL;DR: It is shown that optimal quadratic cost decomposes into two terms: A full knowledge cost and a sequential rate distortion cost.
Abstract: We examine linear stochastic control systems when there is a communication channel connecting the sensor to the controller. The problem consists of designing the channel encoder and decoder as well as the controller to satisfy some given control objectives. In particular, we examine the role communication has on the classical linear quadratic Gaussian problem. We give conditions under which the classical separation property between estimation and control holds and the certainty equivalent control law is optimal. We then present the sequential rate distortion framework. We present bounds on the achievable performance and show the inherent tradeoffs between control and communication costs. In particular, we show that optimal quadratic cost decomposes into two terms: A full knowledge cost and a sequential rate distortion cost.

Journal ArticleDOI
TL;DR: This note presents a new nonlinear integral-type sliding surface which incorporates a virtual nonlinear nominal control to achieve prescribed specifications and demonstrates the validity of the proposed concept.
Abstract: This note presents a new nonlinear integral-type sliding surface which incorporates a virtual nonlinear nominal control to achieve prescribed specifications. First, the plant with matched uncertainties is considered. The resultant closed-loop system during ideal sliding mode behaves exactly like the nominal plant under the nonlinear nominal control, which completely nullifies the matched uncertainties and consequently satisfies the prescribed specifications. Second, the stability analysis of the proposed sliding mode for the systems with unmatched uncertainties is performed to exploit the stability conditions. Numerical results demonstrate the validity of the proposed concept.

Journal ArticleDOI
TL;DR: This work presents a general necessary condition for observability and stabilizability for a large class of communication channels, and studies sufficiency conditions for Internet-like channels that suffer erasures.
Abstract: Communication is an important component of distributed and networked controls systems. In our companion paper, we presented a framework for studying control problems with a digital noiseless communication channel connecting the sensor to the controller. Here, we generalize that framework by applying traditional information theoretic tools of source coding and channel coding to the problem. We present a general necessary condition for observability and stabilizability for a large class of communication channels. Then, we study sufficiency conditions for Internet-like channels that suffer erasures.

Journal ArticleDOI
TL;DR: A general equivalence is shown between feedback stabilization through an analog communication channel, and a communication scheme based on feedback which is a generalization of that of Schalkwijk and Kailath, which shows that the achievable transmission rate is given by the Bode's sensitivity integral formula.
Abstract: In this paper, we show a general equivalence between feedback stabilization through an analog communication channel, and a communication scheme based on feedback which is a generalization of that of Schalkwijk and Kailath. We also show that the achievable transmission rate of the scheme is given by the Bode's sensitivity integral formula, which characterizes a fundamental limitation of causal feedback. Therefore, we can now use the many results and design tools from control theory to design feedback communication schemes providing desired communication rates, and to generate lower bounds on the channel feedback capacity. We consider single user Gaussian channels with memory and memory-less multiuser broadcast, multiple access, and interference channels. In all cases, the results we obtain either achieve the feedback capacity, when this is known, recover known best rates, or provide new best achievable rates.

Journal ArticleDOI
TL;DR: It is shown that the problem of communication-limited stabilization is related to the concept of topological entropy, introduced by Adler et al. and proposed as a measure of the inherent rate at which a map on a noncompact topological space with inputs generates stability information.
Abstract: It is well known in the field of dynamical systems that entropy can be defined rigorously for completely deterministic open-loop systems. However, such definitions have found limited application in engineering, unlike Shannon's statistical entropy. In this paper, it is shown that the problem of communication-limited stabilization is related to the concept of topological entropy, introduced by Adler et al. as a measure of the information rate of a continuous map on a compact topological space. Using similar open cover techniques, the notion of topological feedback entropy (TFE) is defined in this paper and proposed as a measure of the inherent rate at which a map on a noncompact topological space with inputs generates stability information. It is then proven that a topological dynamical plant can be stabilized into a compact set if and only if the data rate in the feedback loop exceeds the TFE of the plant on the set. By taking appropriate limits in a metric space, the concept of local TFE (LTFE) is defined at fixed points of the plant, and it is shown that the plant is locally uniformly asymptotically stabilizable to a fixed point if and only if the data rate exceeds the plant LTFE at the fixed point. For continuously differentiable plants in Euclidean space, real Jordan forms and volume partitioning arguments are then used to derive an expression for LTFE in terms of the unstable eigenvalues of the fixed point Jacobian.

Journal ArticleDOI
TL;DR: In this paper, the stochastic H/sub 2/H/sub /spl infin// control problem with state-dependent noise is discussed, and an observer-based suboptimal control algorithm is proposed.
Abstract: This paper discusses the stochastic H/sub 2//H/sub /spl infin// control problem with state-dependent noise By means of the stabilization, exact observability and stochastic detectability of stochastic systems, the infinite horizon stochastic H/sub 2//H/sub /spl infin// control design is developed For the finite horizon H/sub 2//H/sub /spl infin// control problem, our results generalize the corresponding deterministic ones to the stochastic models Finally, the observer-based suboptimal stochastic H/sub 2//H/sub /spl infin// control is discussed in which the state variables cannot be measured directly, and a feasible design algorithm is proposed

Journal ArticleDOI
TL;DR: A new way of deriving delay-dependent robust stability criteria is presented that combines the parameterized model transformation method with a method that takes the relationships between the terms in the Leibniz-Newton formula into account.
Abstract: This note concerns delay-dependent robust stability criteria and a design method for stabilizing neutral systems with time-varying structured uncertainties. A new way of deriving such criteria is presented that combines the parameterized model transformation method with a method that takes the relationships between the terms in the Leibniz-Newton formula into account. The relationships are expressed as free weighting matrices obtained by solving linear matrix inequalities. Moreover, the stability criteria are also used to design a stabilizing state-feedback controller. Numerical examples illustrate the effectiveness of the method and the improvement over some existing methods.

Journal ArticleDOI
TL;DR: The reader is carried through the key ideas which have proved to be useful in order to tackle the positive realization problem, that is the problem of finding a positive state-space representation of a given transfer function and characterizing existence and minimality of such representation.
Abstract: This paper is a tutorial on the positive realization problem, that is the problem of finding a positive state-space representation of a given transfer function and characterizing existence and minimality of such representation. This problem goes back to the 1950s and was first related to the identifiability problem for hidden Markov models, then to the determination of internal structures for compartmental systems and later embedded in the more general framework of positive systems theory. Within this framework, developing some ideas sprang in the 1960s, during the 1980s, the positive realization problem was reformulated in terms of a geometric condition which was recently exploited as a tool for finding the solution to the existence problem and providing partial answers to the minimality problem. In this paper, the reader is carried through the key ideas which have proved to be useful in order to tackle this problem. In order to illustrate the main results, contributions and open problems, several motivating examples and a comprehensive bibliography on positive systems organized by topics are provided.

Journal ArticleDOI
TL;DR: The problems of robust stability and robust stabilization are solved with a new necessary and sufficient condition for a discrete-time singular system to be regular, causal and stable in terms of a strict linear matrix inequality (LMI).
Abstract: This note deals with the problems of robust stability and stabilization for uncertain discrete-time singular systems. The parameter uncertainties are assumed to be time-invariant and norm-bounded appearing in both the state and input matrices. A new necessary and sufficient condition for a discrete-time singular system to be regular, causal and stable is proposed in terms of a strict linear matrix inequality (LMI). Based on this, the concepts of generalized quadratic stability and generalized quadratic stabilization for uncertain discrete-time singular systems are introduced. Necessary and sufficient conditions for generalized quadratic stability and generalized quadratic stabilization are obtained in terms of a strict LMI and a set of matrix inequalities, respectively. With these conditions, the problems of robust stability and robust stabilization are solved. An explicit expression of a desired state feedback controller is also given, which involves no matrix decomposition. Finally, an illustrative example is provided to demonstrate the applicability of the proposed approach.