Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Automatic Control, IEEE Transactions on

Issue 8 • Date Aug. 2013

Filter Results

Displaying Results 1 - 25 of 38
  • Table of Contents

    Publication Year: 2013 , Page(s): C1 - C4
    Save to Project icon | Request Permissions | PDF file iconPDF (128 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Automatic Control publication information

    Publication Year: 2013 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (136 KB)  
    Freely Available from IEEE
  • Scanning The Issue

    Publication Year: 2013 , Page(s): 1889 - 1890
    Save to Project icon | Request Permissions | PDF file iconPDF (124 KB)  
    Freely Available from IEEE
  • Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions

    Publication Year: 2013 , Page(s): 1891 - 1903
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3801 KB) |  | HTML iconHTML  

    This paper proposes a method for compositional verification of the standard and generalized nonblocking properties of large discrete event systems. The method is efficient as it avoids the explicit construction of the complete state space by considering and simplifying individual subsystems before they are composed further. Simplification is done using a set of abstraction rules preserving generalized nonblocking equivalence, which are shown to be correct and computationally feasible. Experimental results demonstrate the suitability of the method to verify several large-scale discrete event systems models both for standard and generalized nonblocking. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability of Stochastic Nonlinear Systems With State-Dependent Switching

    Publication Year: 2013 , Page(s): 1904 - 1918
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3914 KB) |  | HTML iconHTML  

    In this paper, the problem of stability on stochastic systems with state-dependent switching is investigated. To analyze properties of the switched system by means of Itô's formula and Dynkin's formula, it is critical to show switching instants being stopping times. When the given active-region set can be replaced by its interior, the local solution of the switched system is constructed by defining a series of stopping times as switching instants, and the criteria on global existence and stability of solution are presented by Lyapunov approach. For the case where the active-region set can not be replaced by its interior, the switched systems do not necessarily have solutions, thereby quasi-solution to the underlying problem is constructed and the boundedness criterion is proposed. The significance of this paper is that all the results presented depend on some easily-verified assumptions that are as elegant as those in the deterministic case, and the proofs themselves provide design procedures for switching controls. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control and Synchronization of Neuron Ensembles

    Publication Year: 2013 , Page(s): 1919 - 1930
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3259 KB) |  | HTML iconHTML  

    Synchronization of oscillations is a phenomenon prevalent in natural, social, and engineering systems. Controlling synchronization of oscillating systems is motivated by a wide range of applications from surgical treatment of neurological diseases to the design of neurocomputers. In this paper, we study the control of an ensemble of uncoupled neuron oscillators described by phase models. We examine controllability of such a neuron ensemble for various phase models and, furthermore, study the related optimal control problems. In particular, by employing Pontryagin's maximum principle, we analytically derive optimal controls for spiking single- and two-neuron systems, and analyze the applicability of the latter to an ensemble system. Finally, we present a robust computational method for optimal control of spiking neurons based on pseudospectral approximations. The methodology developed here is universal to the control of general nonlinear phase oscillators. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Large-Scale Robust Stability Problems by Exploiting the Parallel Structure of Polya's Theorem

    Publication Year: 2013 , Page(s): 1931 - 1947
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4239 KB) |  | HTML iconHTML  

    In this paper, we propose a distributed computing approach to solving large-scale robust stability problems on the simplex. Our approach is to formulate the robust stability problem as an optimization problem with polynomial variables and polynomial inequality constraints. We use Polya's theorem to convert the polynomial optimization problem to a set of highly structured linear matrix inequalities (LMIs). We then use a slight modification of a common interior-point primal-dual algorithm to solve the structured LMI constraints. This yields a set of extremely large yet structured computations. We then map the structure of the computations to a decentralized computing environment consisting of independent processing nodes with a structured adjacency matrix. The result is an algorithm which can solve the robust stability problem with the same per-core complexity as the deterministic stability problem with a conservatism which is only a function of the number of processors available. Numerical tests on cluster computers and supercomputers demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors and analyze systems with 100+ dimensional state-space. The proposed algorithms can be extended to perform stability analysis of nonlinear systems and robust controller synthesis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Markov Decision Policies for Delay Constrained Wireless Scheduling

    Publication Year: 2013 , Page(s): 1948 - 1961
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3937 KB) |  | HTML iconHTML  

    We consider a one-hop wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm that reacts to time varying channels and maximizes throughput utility (to within a desired proximity), stabilizes all queues, and satisfies the delay constraints. The problem is solved by reducing the constrained optimization to a set of weighted stochastic shortest path problems, which act as natural generalizations of max-weight policies to Markov decision networks. We also present approximation results for the corresponding shortest path problems, and discuss the additional complexity and delay incurred as compared to systems without delay constraints. The solution technique is general and applies to other constrained stochastic decision problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of State-Based Schedulers for a Network of Control Loops

    Publication Year: 2013 , Page(s): 1962 - 1975
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2645 KB) |  | HTML iconHTML  

    For a closed-loop system with a contention-based multiple access network on its sensor link, the medium access controller (MAC) may discard some packets when the traffic on the link is high. We use a local state-based scheduler to select a few critical data packets to send to the MAC. In this paper, we analyze the impact of such a scheduler on the closed-loop system in the presence of traffic, and show that there is a dual effect with state-based scheduling. In general, this makes the optimal scheduler and controller hard to find. However, by removing past controls from the scheduling criterion, we find that certainty equivalence holds. This condition is related to the classical result of Bar-Shalom and Tse, and it leads to the design of an innovations-based scheduler with a certainty equivalent controller. However, this controller is not an equivalent design for the optimal controller, in the sense of Witsenhausen. The computation of the estimate can be simplified by introducing a symmetry constraint on the scheduler. Based on these findings, we propose a dual predictor architecture for the closed-loop system, which ensures separation between scheduler, observer and controller. We present an example of this architecture, which illustrates a network-aware event-triggering mechanism. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregation Algorithm Towards Large-Scale Boolean Network Analysis

    Publication Year: 2013 , Page(s): 1976 - 1985
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2041 KB) |  | HTML iconHTML  

    The analysis of large-scale Boolean network dynamics is of great importance in understanding complex phenomena where systems are characterized by a large number of components. The computational cost to reveal the number of attractors and the period of each attractor increases exponentially as the number of nodes in the networks increases. This paper presents an efficient algorithm to find attractors for medium to large-scale networks. This is achieved by analyzing subnetworks within the network in a way that allows to reveal the attractors of the full network with little computational cost. In particular, for each subnetwork modeled as a Boolean control network, the input-state cycles are found and they are composed to reveal the attractors of the full network. The proposed algorithm reduces the computational cost significantly, especially in finding attractors of short period, or any periods if the aggregation network is acyclic. Also, this paper shows that finding the best acyclic aggregation is equivalent to finding the strongly connected components of the network graph. Finally, the efficiency of the algorithm is demonstrated on two biological systems, namely a T-cell receptor network and an early flower development network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Periodic Memory State-Feedback Controller: New Formulation, Analysis, and Design Results

    Publication Year: 2013 , Page(s): 1986 - 2000
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3684 KB) |  | HTML iconHTML  

    This paper proposes a unified setup for robust stability and performance analysis and synthesis for periodic polytopic discrete-time systems. Relying on a general formulation for state-feedback periodic memory controllers and a new time-lifting, new sufficient LMI conditions for the existence of robust stability certificates and H2 guaranteed cost control laws are derived. Comparisons of the efficiency of different controller structures illustrate these developments on a numerical example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

    Publication Year: 2013 , Page(s): 2001 - 2012
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3485 KB) |  | HTML iconHTML  

    In this paper, we develop randomized block-coordinate descent methods for minimizing multi-agent convex optimization problems with linearly coupled constraints over networks and prove that they obtain in expectation an ε accurate solution in at most O(1/λ2(Q)ϵ) iterations, where λ2(Q) is the second smallest eigenvalue of a matrix Q that is defined in terms of the probabilities and the number of blocks. However, the computational complexity per iteration of our methods is much simpler than the one of a method based on full gradient information and each iteration can be computed in a completely distributed way. We focus on how to choose the probabilities to make these randomized algorithms to converge as fast as possible and we arrive at solving a sparse SDP. Analysis for rate of convergence in probability is also provided. For strongly convex functions our distributed algorithms converge linearly. We also extend the main algorithm to a more general random coordinate descent method and to problems with more general linearly coupled constraints. Preliminary numerical tests confirm that on very large optimization problems our method is much more numerically efficient than methods based on full gradient. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Convergence Time and Disturbance Rejection of Super-Twisting Control

    Publication Year: 2013 , Page(s): 2013 - 2017
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1360 KB) |  | HTML iconHTML  

    Super-twisting algorithm is one of the versions of high-order sliding mode control. The interest to this algorithm is explained by its attractive properties: continuous control input, finite convergence time, disturbance rejection. In this paper, the upper bound of admissible unknown disturbances and low bound of the convergence time are found and shown that both the values can be achieved with any desired accuracy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum and Equilibrium in Assignment Problems With Congestion: Mobile Terminals Association to Base Stations

    Publication Year: 2013 , Page(s): 2018 - 2031
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3608 KB) |  | HTML iconHTML  

    The classic optimal transportation problem consists in finding the most cost-effective way of moving masses from one set of locations to another, minimizing its transportation cost. The formulation of this problem and its solution have been useful to understand various mathematical, economical, and control theory phenomena, such as, e.g., Witsenhausen's counterexample in stochastic control theory, the principal-agent problem in microeconomic theory, location and planning problems, etc. In this work, we incorporate the effect of network congestion to the optimal transportation problem and we are able to find a closed form expression for its solution. As an application of our work, we focus on the mobile association problem in cellular networks (the determination of the cells corresponding to each base station). In the continuum setting, this problem corresponds to the determination of the locations at which mobile terminals prefer to connect (by also considering the congestion they generate) to a given base station rather than to other base stations. Two types of problems have been addressed: a global optimization problem for minimizing the total power needed by the mobile terminals over the whole network (global optimum), and a user optimization problem, in which each mobile terminal chooses to which base station to connect in order to minimize its own cost (user equilibrium). This work combines optimal transportation with strategic decision making to characterize both solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Fault Detection Filtering Approach for a Class of Interconnected Continuous-Time Nonlinear Systems

    Publication Year: 2013 , Page(s): 2032 - 2047
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4346 KB) |  | HTML iconHTML  

    This paper develops a filtering approach for distributed fault detection of a class of interconnected continuous-time nonlinear systems with modeling uncertainties, disturbances and measurement noise. A distributed fault detection scheme and the corresponding adaptive thresholds are designed based on filtering certain signals so that the effect of the measurement noise and of the disturbances is attenuated, allowing for the design of less conservative thresholds. A key novelty of the proposed work is that a general class of filters can be embedded into the design of the residual and threshold signals in a way that takes advantage of the filtering noise suppression properties. The analysis of the proposed distributed fault detection scheme shows that the derived thresholds guarantee that there are no false alarms and characterizes quantitatively the class of detectable faults. Further rigorous detectability analysis provides results regarding the magnitude of the detectable faults, an upper bound on the detection time and the relation of the detection time with respect to the order and pole locations of the filters used. Simulation results illustrate the proposed distributed fault filtering approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Stability of Markovianly Switched Systems

    Publication Year: 2013 , Page(s): 2048 - 2054
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1486 KB) |  | HTML iconHTML  

    This technical note examines the stochastic stability of noisy dynamics in discrete and continuous time. The notion of moment stability in the wide sense (MSWS) is presented as a generalization of ϵ-moment stability. MSWS is intentionally not based on stochastic convergence properties, since in most practically appearing systems convergence to any equilibrium is not present. A sufficient criterion for both MSWS and ergodicity is presented for a class of systems comprising a finite set of noisy dynamical systems among which switching is governed by a Markov chain. Stability/instability properties for each separate subsystem are assumed to be quantified by a Lyapunov function candidate together with an associated growth rate equation. For the set of Lyapunov functions, a compatibility criterion is assumed to be fulfilled, bounding the ratio between pairs of Lyapunov functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Receding-Horizon Nonlinear Kalman (RNK) Filter for State Estimation

    Publication Year: 2013 , Page(s): 2054 - 2059
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1021 KB) |  | HTML iconHTML  

    This technical note presents a new Receding-horizon Nonlinear Kalman (RNK) filter for state estimation in nonlinear systems with state constraints. Such problems appear in almost all engineering disciplines. Unlike the Moving Horizon Estimation (MHE) approach, the RNK Filter formulation follows the Kalman Filter (KF) predictor-corrector framework. The corrector step is solved as an optimization problem that handles constraints effectively. The performance improvement and robustness of the proposed estimator vis-a-vis the extended Kalman filter (EKF) are demonstrated through nonlinear examples. These examples also demonstrate the computational advantages of the proposed approach over the MHE formulation. The computational gain is due to the fact that the proposed RNK formulation avoids the repeated integration within an optimization loop that is required in an MHE formulation. Further, the proposed formulation results in a quadratic program (QP) problem for the corrector step when the measurement model is linear, irrespective of the state propagation model. In contrast, a nonlinear programming problem (NLP) needs to be solved when an MHE formulation is used for such problems. Also, the proposed filter for unconstrained linear systems results in a KF estimate for the current instant and smoothed estimates for the other instants of the receding horizon. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sufficient Condition for Arbitrary Eigenvalue Assignment in Linear Descriptor Systems by Output Feedback

    Publication Year: 2013 , Page(s): 2060 - 2064
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1163 KB) |  | HTML iconHTML  

    The problem of eigenvalue assignment in the linear descriptor system Emathdotx=Ax+Bu, y=Cx via output feedback is considered. It is shown that mp > rank(E) ( m and p are respectively the numbers of inputs and outputs of the system) is a sufficient condition for generic real output feedback eigenvalue assignability. The result is the best possible for general m,p,rank(E). In general, the assignment is achieved not in an exact sense, but in arbitrarily small neighborhoods around a given set of eigenvalues. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Estimation for Discrete-Time Markovian Jump Linear Systems

    Publication Year: 2013 , Page(s): 2065 - 2071
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1384 KB) |  | HTML iconHTML  

    This technical note deals with recursive robust estimation of Markov jump linear systems subject to unobserved chain state. It is developed an augmented system modeled via norm bounded uncertainties. Upper and lower bounds of an uncertain quadratic cost function are computed in order to define the variances of the augmented system. Numerical examples are provided to show the effectiveness of the proposed estimators. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensions of “Padé Discretization for Linear Systems With Polyhedral Lyapunov Functions” for Generalized Jordan Structures

    Publication Year: 2013 , Page(s): 2071 - 2076
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1401 KB) |  | HTML iconHTML  

    Recently, we showed that certain types of polyhedral Lyapunov functions for linear time-invariant systems, are preserved by diagonal Padé approximations, under the assumption that the continuous-time system matrix Ac has distinct eigenvalues. In this technical note, we show that this result also holds true in the case that Ac has non-trivial Jordan blocks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Tracking Using Backstepping Control Design and High-Order Sliding Modes

    Publication Year: 2013 , Page(s): 2077 - 2081
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (698 KB) |  | HTML iconHTML  

    In this technical note, a controller ensuring exponential exact tracking in the presence of matched and unmatched disturbances for the nonlinear systems in the block controllable form is proposed. The controller is designed using the backstepping procedure and combines the feedback linearization technique with the high-order sliding-modes. The matched and unmatched disturbances are compensated by the injection of a continuous term generated by the robust exact high-order sliding-modes differentiator. The obtained control law is differentiable and can be applied directly to the system. Simulations verify the performance of the proposed controller. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Mean-Square Boundedness of Stochastic Linear Systems With Quantized Observations

    Publication Year: 2013 , Page(s): 2082 - 2085
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (842 KB) |  | HTML iconHTML  

    We propose a procedure to design a state-quantizer with a fixed finite alphabet for a Lyapunov stable stochastic linear system, and a bounded policy based on the resulting quantized state measurements to ensure bounded second moments of the states in closed-loop. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Stability of Systems With Aperiodic Sampling Devices

    Publication Year: 2013 , Page(s): 2085 - 2090
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1181 KB) |  | HTML iconHTML  

    This technical note is concerned with stability analysis of aperiodic sampled-data systems. The stability problem is tackled from a pure discrete-time point of view, where the at-sampling behavior of the system is modelled as the response of a nominal discrete-time LTI system in feedback interconnection with a structured uncertainty. Conditions under which the uncertainty is positive real (PR) are identified. Based on the PR property, a number of integral quadratic constraints (IQC) are derived and the IQC theory is applied to derive stability conditions. Numerical examples are given to illustrate the effectiveness of the proposed approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconciling /spl nu/-Gap Metric and IQC Based Robust Stability Analysis

    Publication Year: 2013 , Page(s): 2090 - 2095
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1312 KB) |  | HTML iconHTML  

    This technical note elaborates on the flexibility of an approach that combines ν-gap metric and integral quadratic constraint (IQC) based analysis in the study of uncertain feedback interconnections of distributed-parameter transfer functions. It is established that a standard ν-gap ball robust stability result can be recovered within the blended IQC/ν-gap framework, which only requires the existence of ν-gap continuous paths within the uncertainty set of interest. This is achieved, in part, by showing that sufficiently small ν-gap balls are pathwise connected in the graph topology. A linear fractional characterisation of the ν-gap is a key ingredient. This characterisation is underpinned by a certain J-spectral factorisation, also shown to exist herein. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Estimation for Moving Target Based on State-Consensus Strategy

    Publication Year: 2013 , Page(s): 2096 - 2101
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1973 KB) |  | HTML iconHTML  

    This technical note studies the distributed estimation problem for a continuous-time moving target under switching interconnection topologies. A recursive distributed estimation algorithm is proposed by using state-consensus strategy, where a common gain is assigned to adjust the innovative and state-consensus information for each sensor in the network. Under mild conditions on observability and connectivity, the stability of the distributed estimation algorithm is analyzed. An upper bound and lower bound for the total mean square estimation error (TMSEE) are obtained by virtue of the common Lyapunov method and Kalman-Bucy filtering theory, respectively. Then a numerical simulation is given to verify the effectiveness of the proposed algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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