# IEEE Transactions on Automatic Control

## Filter Results

Displaying Results 1 - 25 of 36

Publication Year: 2011, Page(s):C1 - C4
| |PDF (40 KB)
• ### IEEE Control Systems Society

Publication Year: 2011, Page(s): C2
| |PDF (38 KB)
• ### Scanning the issue

Publication Year: 2011, Page(s):2749 - 2750
| |PDF (39 KB)
• ### Approach for Transforming Linear Constraints on Petri Nets

Publication Year: 2011, Page(s):2751 - 2765
Cited by:  Papers (25)
| |PDF (459 KB) | HTML

An efficient supervisor synthesis method is proposed based on the constraint transformation, since enforcing a logic expression of linear constraints on Petri nets essentially involves finding admissible constraints. It consists of cooperative algorithms that are used to obtain the logic expression of constraints for any set of forbidden markings, to remove redundant constraints using the quantity... View full abstract»

• ### Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis

Publication Year: 2011, Page(s):2766 - 2777
Cited by:  Papers (16)
| |PDF (405 KB) | HTML

A square matrix E is said to be diagonally stable if there exists a diagonal matrix D >; 0 satisfying DE+ETD <; 0 . This notion has been instrumental in recent studies on stability of interconnected system models in communication and biological networks, in which the subsystems satisfy passivity properties and the matrix E combines this passivity informatio... View full abstract»

• ### Control of Minimally Persistent Leader-Remote-Follower and Coleader Formations in the Plane

Publication Year: 2011, Page(s):2778 - 2792
Cited by:  Papers (52)
| |PDF (746 KB) | HTML

This paper solves an n -agent formation shape control problem in the plane. The objective is to design decentralized control laws so that the agents cooperatively restore a prescribed formation shape in the presence of small perturbations from the prescribed shape. We consider two classes of directed, cyclic information architectures associated with so-called minimally persistent formations... View full abstract»

• ### Optimal Kullback-Leibler Aggregation via Spectral Theory of Markov Chains

Publication Year: 2011, Page(s):2793 - 2808
Cited by:  Papers (29)
| |PDF (893 KB) | HTML

This paper is concerned with model reduction for complex Markov chain models. The Kullback-Leibler divergence rate is employed as a metric to measure the difference between the Markov model and its approximation. For a certain relaxation of the bi-partition model reduction problem, the solution is shown to be characterized by an associated eigenvalue problem. The form of the eigenvalue problem is ... View full abstract»

• ### A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization

Publication Year: 2011, Page(s):2809 - 2824
Cited by:  Papers (27)
| |PDF (690 KB) | HTML

In this paper, we propose a new tractable framework for dealing with linear dynamical systems affected by uncertainty, applicable to multistage robust optimization and stochastic programming. We introduce a hierarchy of near-optimal polynomial disturbance-feedback control policies, and show how these can be computed by solving a single semidefinite programming problem. The approach yields a hierar... View full abstract»

• ### A New Kernel-Based Approach for NonlinearSystem Identification

Publication Year: 2011, Page(s):2825 - 2840
Cited by:  Papers (33)
| |PDF (778 KB) | HTML

We present a novel nonparametric approach for identification of nonlinear systems. Exploiting the framework of Gaussian regression, the unknown nonlinear system is seen as a realization from a Gaussian random field. Its covariance encodes the idea of “fading” memory in the predictor and consists of a mixture of Gaussian kernels parametrized by few hyperparameters describing the inter... View full abstract»

• ### An Efficient Method to Estimate the Suboptimality of Affine Controllers

Publication Year: 2011, Page(s):2841 - 2853
Cited by:  Papers (18)
| |PDF (536 KB) | HTML

We consider robust feedback control of time-varying, linear discrete-time systems operating over a finite horizon. For such systems, we consider the problem of designing robust causal controllers that minimize the expected value of a convex quadratic cost function, subject to mixed linear state and input constraints. Determination of an optimal control policy for such problems is generally computa... View full abstract»

• ### Packetized Predictive Control of Stochastic Systems Over Bit-Rate Limited Channels With Packet Loss

Publication Year: 2011, Page(s):2854 - 2868
Cited by:  Papers (68)
| |PDF (729 KB) | HTML

We study a control architecture for linear time-invariant plants with random disturbances and where a network is placed between the controller output and the plant input. The network imposes a constraint on the expected bit-rate and is affected by random independent and identically distributed (i.i.d.) dropouts. Dropout-rates and acknowledgments of receipt are not available at the controller side.... View full abstract»

• ### Average Cost Optimality in Inventory Models With Dynamic Information Delays

Publication Year: 2011, Page(s):2869 - 2882
Cited by:  Papers (1)
| |PDF (4252 KB) | HTML

Information delays exist when the most recent inventory information available to the Inventory Manager (IM) is dated. In other words, the IM observes only the inventory level that belongs to an earlier period. Such situations are not uncommon, and they arise when it takes a while to process the demand data and pass the results to the IM. In this paper, we establish that the average cost optimal po... View full abstract»

• ### Ultra-Fast Stabilizing Model Predictive Control via Canonical Piecewise Affine Approximations

Publication Year: 2011, Page(s):2883 - 2897
Cited by:  Papers (55)  |  Patents (3)
| |PDF (4334 KB) | HTML

This paper investigates the use of canonical piecewise affine (PWA) functions for approximation and fast implementation of linear MPC controllers. The control law is approximated in an optimal way over a regular simplicial partition of a given set of states of interest. The stability properties of the resulting closed-loop system are analyzed by constructing a suitable PWA Lyapunov function. The m... View full abstract»

• ### An $ell _{1}$-Laplace Robust Kalman Smoother

Publication Year: 2011, Page(s):2898 - 2911
Cited by:  Papers (25)
| |PDF (856 KB) | HTML

Robustness is a major problem in Kalman filtering and smoothing that can be solved using heavy tailed distributions; e.g., ℓ1-Laplace. This paper describes an algorithm for finding the maximum a posteriori (MAP) estimate of the Kalman smoother for a nonlinear model with Gaussian process noise and ℓ1 -Laplace observation noise. The algorithm uses the convex compo... View full abstract»

• ### On Solving Event-Based Optimization With Average Reward Over Infinite Stages

Publication Year: 2011, Page(s):2912 - 2917
Cited by:  Papers (14)
| |PDF (248 KB) | HTML

Event-based optimization (EBO) provides a unified framework for problems in which decisions can be made only when certain events occur. Because the event sequence usually is not Markovian, the optimal policy could depend on the entire event history, which is hard to implement in practice. So most existing studies focus on memoryless policies, which make decisions only based on the current observab... View full abstract»

• ### Gossip Algorithms for Convex Consensus Optimization Over Networks

Publication Year: 2011, Page(s):2917 - 2923
Cited by:  Papers (38)
| |PDF (279 KB) | HTML

In many applications, nodes in a network desire not only a consensus, but an optimal one. To date, a family of subgradient algorithms have been proposed to solve this problem under general convexity assumptions. This technical note shows that, for the scalar case and by assuming a bit more, novel non-gradient-based algorithms with appealing features can be constructed. Specifically, we develop Pai... View full abstract»

• ### Augmented Lagrangian Approach to Design of Structured Optimal State Feedback Gains

Publication Year: 2011, Page(s):2923 - 2929
Cited by:  Papers (66)
| |PDF (493 KB) | HTML

We consider the design of optimal state feedback gains subject to structural constraints on the distributed controllers. These constraints are in the form of sparsity requirements for the feedback matrix, implying that each controller has access to information from only a limited number of subsystems. The minimizer of this constrained optimal control problem is sought using the augmented Lagrangia... View full abstract»

• ### Switched Affine Systems Using Sampled-Data Controllers: Robust and Guaranteed Stabilization

Publication Year: 2011, Page(s):2929 - 2935
Cited by:  Papers (24)
| |PDF (561 KB) | HTML

The problem of robust and guaranteed stabilization is addressed for switched affine systems using sampled state feedback controllers. Based on the existence of a control Lyapunov function for a relaxed system, we propose three sampled-data controls. Global attracting sets, computed by solving a sequence of optimization problems, guarantee practical and global asymptotic stabilization for the whole... View full abstract»

• ### ${H}_{infty }$ Filtering for Discrete-Time State-Delayed Systems With Finite Frequency Specifications

Publication Year: 2011, Page(s):2935 - 2941
Cited by:  Papers (95)
| |PDF (379 KB) | HTML

This article researches the problem of finite frequency (FF) H∞ filtering for linear discrete-time state-delayed systems. The disturbance is assumed to reside in low/middle/high frequency ranges. To reduce the conservatism of the results, delay-partitioning idea is used to derive a new FF bounded real lemma (BRL). By applying the generalized Kalman-Yakubovich-Popov lemma, ... View full abstract»

• ### Generalized KYP Lemma With Real Data

Publication Year: 2011, Page(s):2942 - 2946
Cited by:  Papers (15)
| |PDF (191 KB) | HTML

A recent generalization of the Kalman-Yakubovich-Popov (KYP) lemma establishes the equivalence between a semi-infinite inequality on a segment of a line or circle in the complex plane and a linear matrix inequality (LMI). In this technical note we show that when the data are real, the matrix variables in the LMI can be restricted to be real, even when the frequency range is asymmetric with respect... View full abstract»

• ### On Feedback Capability in a Class of Nonlinearly Parameterized Uncertain Systems

Publication Year: 2011, Page(s):2946 - 2951
Cited by:  Papers (9)
| |PDF (240 KB) | HTML

In this technical note, we will investigate the maximum capability and limitations of the feedback mechanism in globally stabilizing a basic class of discrete-time nonlinearly parameterized dynamical systems with multiple unknown parameters. Both “possibility” and “impossibility” theorems together with a fairly complete characterization on the capability of feedback wil... View full abstract»

• ### Theories and Ultra Efficient Computation of Joint Spectral Radius for Estimating First Passage Time Distribution of Markov Set-Chain

Publication Year: 2011, Page(s):2951 - 2956
| |PDF (244 KB) | HTML

This technical note is concerned with the tail distribution of the first passage time of Markov set chains (MSC). An original two-part idea-a more progressive relation and a sortedness test-is conceived to characterize such chains. The theoretical construction based on this idea further results in an algorithm that can compute the tightest exponent bound of the tail distribution for high-dimension... View full abstract»

• ### Existence Conditions for Functional Observability From an Eigenspace Perspective

Publication Year: 2011, Page(s):2957 - 2961
Cited by:  Papers (24)
| |PDF (177 KB) | HTML

Two theorems on conditions for nonexistence and for existence, of built functional observers, from an eigenspace perspective are presented and proved. One more theorem on Functional Observability in terms of constructed products of matrices A,C and L0 is also presented. This theorem provides an easy way to check Functional Observability before proceeding with the de... View full abstract»

• ### Distributed Fault Accommodation for a Class of Interconnected Nonlinear Systems With Partial Communication

Publication Year: 2011, Page(s):2962 - 2967
Cited by:  Papers (33)
| |PDF (252 KB) | HTML

Motivated by applications related to large-scale and complex systems, there has recently been an increased interest in the design and analysis of distributed control and fault accommodation schemes. This note presents a distributed fault detection and accommodation design method for a class of nonlinear interconnected subsystems. A fault may occur in the subsystems local dynamics as well as in the... View full abstract»

• ### Impulsive Mode Elimination for Descriptor Systems by a Structured P-D Feedback

Publication Year: 2011, Page(s):2968 - 2973
Cited by:  Papers (11)
| |PDF (205 KB) | HTML

The problem of impulsive mode elimination for descriptor systems via a structured output proportional and derivative (P-D) feedback is investigated in this technical note. The motivation of solving this problem arises from an observation that the impulse behavior for some descriptor systems can not be eliminated completely by a parameterized output P-D feedback, but it can be removed by a structur... View full abstract»

## Aims & Scope

In the IEEE Transactions on Automatic Control, the IEEE Control Systems Society publishes high-quality papers on the theory, design, and applications of control engineering.  Two types of contributions are regularly considered

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
P. J. Antsaklis
Dept. Electrical Engineering
University of Notre Dame