Center for Intelligent Control Systems (U.S.)
Overview
Works:  476 works in 653 publications in 1 language and 1,055 library holdings 

Roles:  Funder 
Publication Timeline
.
Most widely held works about
Center for Intelligent Control Systems (U.S.)
 Center for Intelligent Control Systems by S. K Mitter( Book )
Most widely held works by
Center for Intelligent Control Systems (U.S.)
Kalman filtering and Riccati equations for descriptor systems by
Ramine Nikoukhah(
Book
)
4 editions published between 1990 and 1991 in English and held by 6 WorldCat member libraries worldwide
In this paper we consider a general formulation of a discretetime filtering problem for descriptor systems. It is shown that the nature of descriptor systems leads directly to the need to examine singular estimation problems. Using a "dual approach" to estimation we derive a socalled "3block" form for the optimal filter and a corresponding 3block Riccati equation for a general class of timevarying descriptor models which need not represent a wellposed system in that the dynamics may be either over or underconstrained. Specializing to the timeinvariant case we examine the asymptotic properties of the 3block filter, and in particular analyze in detail the resulting 3block algebraic Riccati equation, generalizing significantly the results in [23, 28, 33]. Finally, the noncausal nature of discretetime descriptor dynamics implies that future dynamics may provide some information about the present state. We present a modified form for the descriptor Kalman filter that takes this information into account
4 editions published between 1990 and 1991 in English and held by 6 WorldCat member libraries worldwide
In this paper we consider a general formulation of a discretetime filtering problem for descriptor systems. It is shown that the nature of descriptor systems leads directly to the need to examine singular estimation problems. Using a "dual approach" to estimation we derive a socalled "3block" form for the optimal filter and a corresponding 3block Riccati equation for a general class of timevarying descriptor models which need not represent a wellposed system in that the dynamics may be either over or underconstrained. Specializing to the timeinvariant case we examine the asymptotic properties of the 3block filter, and in particular analyze in detail the resulting 3block algebraic Riccati equation, generalizing significantly the results in [23, 28, 33]. Finally, the noncausal nature of discretetime descriptor dynamics implies that future dynamics may provide some information about the present state. We present a modified form for the descriptor Kalman filter that takes this information into account
Modeling and estimation of multiresolution stochastic processes by
Alan S Willsky(
Book
)
4 editions published between 1989 and 1991 in English and held by 6 WorldCat member libraries worldwide
In this paper, we provide an overview of the several components of a research effort aimed at the development of a theory of multiresolution stochastic modeling and associated techniques for optimal multiscale statistical signal and image processing. As we describe, a natural framework for developing such a theory is the study of stochastic processes indexed by nodes on lattices or trees in which different depths in the tree or lattice correspond to different spatial scales in representing a signal or image. In particular we will see how the wavelet transform directly suggests such a modeling paradigm. This perspective then leads directly to the investigation of several classes of dynamic models and related notions of "multiscale stationarity" in which scale plays the role of a timelike variable. In this paper we focus primarily on the investigation of models on homogeneous trees. In particular we describe the elements of a dynamic system theory on trees and introduce two notions of stationarity. One of these leads naturally to the development of a theory of multiscale autoregressive modeling including a generalization of the celebrated Schur and Levinson algorithms for orderrecursive model building. The second, weaker motion of stationarity leads directly to a class of state space models on homogeneous trees. We describe several of the elements of the system theory for such models and also describe the natural, extremely efficient algorithmic structures for optimal estimation that these models suggest: one class of algorithms has a multigrid relaxation structure; a second uses the scaletoscale whitening property of wavelet transforms for our models; and a third leads to a new class of Riccati equations involving the usual predict and update steps and a new "fusion" step as information is propagated from fine to coarse scales. As we will see, this framework allows us to consider in a very natural way the fusion of data from sensors with differing resolution
4 editions published between 1989 and 1991 in English and held by 6 WorldCat member libraries worldwide
In this paper, we provide an overview of the several components of a research effort aimed at the development of a theory of multiresolution stochastic modeling and associated techniques for optimal multiscale statistical signal and image processing. As we describe, a natural framework for developing such a theory is the study of stochastic processes indexed by nodes on lattices or trees in which different depths in the tree or lattice correspond to different spatial scales in representing a signal or image. In particular we will see how the wavelet transform directly suggests such a modeling paradigm. This perspective then leads directly to the investigation of several classes of dynamic models and related notions of "multiscale stationarity" in which scale plays the role of a timelike variable. In this paper we focus primarily on the investigation of models on homogeneous trees. In particular we describe the elements of a dynamic system theory on trees and introduce two notions of stationarity. One of these leads naturally to the development of a theory of multiscale autoregressive modeling including a generalization of the celebrated Schur and Levinson algorithms for orderrecursive model building. The second, weaker motion of stationarity leads directly to a class of state space models on homogeneous trees. We describe several of the elements of the system theory for such models and also describe the natural, extremely efficient algorithmic structures for optimal estimation that these models suggest: one class of algorithms has a multigrid relaxation structure; a second uses the scaletoscale whitening property of wavelet transforms for our models; and a third leads to a new class of Riccati equations involving the usual predict and update steps and a new "fusion" step as information is propagated from fine to coarse scales. As we will see, this framework allows us to consider in a very natural way the fusion of data from sensors with differing resolution
Output stabilizability of discrete event dynamic systems by Cüneyt M Özveren(
Book
)
4 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
The study of the control of Discrete Event Dynamic Systems (DEDS) was been introduced by Wonham, Ramadge, et al. This work prompted a considerable response by other researchers, exploring a variety of alternate formulations and paradigms. In our work, we have had in mind the development of a regulator theory for DEDS. In another paper, we develop notions of stability and stabilizability for DEDS while in second, we focus on the questions of observability and state reconstruction, using what might be thought of as an intermittent observation model. In this paper, we combine our work on stabilizability and observability to address the problem of stabilization by dynamic output feedback under partial observations. Our presentation here is necessarily brief
4 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
The study of the control of Discrete Event Dynamic Systems (DEDS) was been introduced by Wonham, Ramadge, et al. This work prompted a considerable response by other researchers, exploring a variety of alternate formulations and paradigms. In our work, we have had in mind the development of a regulator theory for DEDS. In another paper, we develop notions of stability and stabilizability for DEDS while in second, we focus on the questions of observability and state reconstruction, using what might be thought of as an intermittent observation model. In this paper, we combine our work on stabilizability and observability to address the problem of stabilization by dynamic output feedback under partial observations. Our presentation here is necessarily brief
Aggregation and multilevel control in discrete event dynamic systems by Cüneyt M Özveren(
Book
)
4 editions published between 1989 and 1990 in English and held by 6 WorldCat member libraries worldwide
In this paper we consider the problem of higherlevel aggregate modelling and control of discreteevent dynamic systems (DEDS) modelled as finite state automata in which some events are controllable, some are observed, and some represent events to be tracked. The higherlevel models considered correspond to associating specified sequences of events in the original system to single macroscopic events in the higher level model. We also consider the problem of designing a compensator that can be used to restrict microscopic behavior so that the system will only produce strings of these primitive sequences or tasks. With this lower level control in place we can construct higherlevel models which typically have many fewer states and events than the original system. Also, motivated by applications such as flexible manufacturing, we address the problem of constructing and controlling higherlevel models of interconnections of DEDS. This allows us to "slow down" the combinatorial explosion typically present in computations involving interacting automata
4 editions published between 1989 and 1990 in English and held by 6 WorldCat member libraries worldwide
In this paper we consider the problem of higherlevel aggregate modelling and control of discreteevent dynamic systems (DEDS) modelled as finite state automata in which some events are controllable, some are observed, and some represent events to be tracked. The higherlevel models considered correspond to associating specified sequences of events in the original system to single macroscopic events in the higher level model. We also consider the problem of designing a compensator that can be used to restrict microscopic behavior so that the system will only produce strings of these primitive sequences or tasks. With this lower level control in place we can construct higherlevel models which typically have many fewer states and events than the original system. Also, motivated by applications such as flexible manufacturing, we address the problem of constructing and controlling higherlevel models of interconnections of DEDS. This allows us to "slow down" the combinatorial explosion typically present in computations involving interacting automata
Recursive and iterative estimation algorithms for multiresolution stochastic processes by K. C Chou(
Book
)
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Auction algorithms for network flow problems : a tutorial introduction by
Dimitri P Bertsekas(
Book
)
3 editions published between 1991 and 1992 in English and held by 5 WorldCat member libraries worldwide
3 editions published between 1991 and 1992 in English and held by 5 WorldCat member libraries worldwide
Global models of natural boundaries : theory and applications by Alan Paul Knoerr(
Book
)
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
On the average communication complexity of asynchronous distributed algorithms by
John N Tsitsiklis(
Book
)
2 editions published between 1990 and 1996 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed BellmanFord algorithm for the shortest path problem. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."
2 editions published between 1990 and 1996 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed BellmanFord algorithm for the shortest path problem. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."
A generalized processor sharing approach to flow control in integrated services networks by
Abhay Kumar J Parekh(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
BIBO stability robustness in the presence of coprime factor perturbations by
Munther A Dahleh(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Consistent estimation of stationary processes and stationary random fields by Stuart Alan Geman(
Book
)
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Complexity issues dealing with networks that compute Boolean functions by Upendra Vasant Chaudhari(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Geometric optimization methods for adaptive filtering by Steven Thomas Smith(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Local tests for consistency of support hyperplane data(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Wavelength routing for alloptical networks by
Richard A Barry(
Book
)
2 editions published between 1993 and 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We consider passive alloptical networks using wavelength division multiplexing and wavelength routing, i.e. the path of a signal is determined by the wavelength of the signal and the signal origin. We present upper and lower bounds on the required number of wavelengths to achieve a given blocking probability. Specifically we show that between [formula] and O[square root of pM] wavelengths are required to support pM active session requests in a network with M users and blocking probability P[subscript b]. The lower bound holds for all networks with passive wavelength routing and fixed wavelength changing devices. The upper bound is a passive construction without wavelength changers."
2 editions published between 1993 and 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We consider passive alloptical networks using wavelength division multiplexing and wavelength routing, i.e. the path of a signal is determined by the wavelength of the signal and the signal origin. We present upper and lower bounds on the required number of wavelengths to achieve a given blocking probability. Specifically we show that between [formula] and O[square root of pM] wavelengths are required to support pM active session requests in a network with M users and blocking probability P[subscript b]. The lower bound holds for all networks with passive wavelength routing and fixed wavelength changing devices. The upper bound is a passive construction without wavelength changers."
Singular perturbations in manufacturing by
H. Mete Soner(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We present an asymptotic analysis for a large class of stochastic optimization problems arising in manufacturing. A typical example of the problems we consider, is a production planning problem with random capacity and demand. In this example we assume that the capacity of the system fluctuates faster than the other quantities. The general model we consider also has a fast controlled Markov process in its state description. Using the difference in the time scales of different quantities, we simplify the problem by 'averaging' out the fast process. Then asymptotically optimal strategies are constructed from the optimal solutions of the limiting problems. The proofs of these results use the theory of viscosity solutions to dynamic programming equations. However, the formal construction of the asymptotically optimal strategies does not require the knowledge of this theory."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We present an asymptotic analysis for a large class of stochastic optimization problems arising in manufacturing. A typical example of the problems we consider, is a production planning problem with random capacity and demand. In this example we assume that the capacity of the system fluctuates faster than the other quantities. The general model we consider also has a fast controlled Markov process in its state description. Using the difference in the time scales of different quantities, we simplify the problem by 'averaging' out the fast process. Then asymptotically optimal strategies are constructed from the optimal solutions of the limiting problems. The proofs of these results use the theory of viscosity solutions to dynamic programming equations. However, the formal construction of the asymptotically optimal strategies does not require the knowledge of this theory."
Reconstructing ellipsoids from projections by
William Clement Karl(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
A stochastic modeling approach to multiscale signal processing by Kenneth Chienko Chou(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Unslotted ALOHA in high speed bidirectional bus networks by
Whay Chiou Lee(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
Problems of computational and information complexity in machine vision and learning by
Sanjeev Kulkarni(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Willsky, Alan S. Author
 Tsitsiklis, John N. Author
 Bertsekas, Dimitri P. Author
 Tseng, Paul Originator Author
 Mitter, S. K. (Sanjoy K.) 1933 Author
 Karl, William Clement Author
 Humblet, Pierre A. Author
 Brockett, Roger W. Author
 Kulkarni, Sanjeev R. Author
 Özveren, Cüneyt M. Author
Associated Subjects
Adaptive filters Adaptive filtersMathematical models Algorithms AuctionsMathematical models Boundary value problemsComputer programs Center for Intelligent Control Systems (U.S.) Computational complexity Computer graphics Computer network protocols Computer networks Computer vision Digital communications Digital control systems Dynamic programming Estimation theory Image processing Integrated services digital networks Intelligent control systems Kalman filtering Linear control systems Linear programming Machine learning Manufacturing processes Mathematical models Mathematical optimization Matrices Multiplexing Nonlinear control theory Optical communications Production planning Queuing theory Random fields Riccati equation Riemannian manifolds Signal processing Signal processingDigital techniques Singular perturbations (Mathematics) Stochastic processes System theory
Alternative Names
Brown University. Center for Intelligent Control Systems
CICS
Harvard University. Center for Intelligent Control Systems
Massachusetts Institute of Technology. Center for Intelligent Control Systems
Languages