Geir E. Dullerud

Learn More
This paper deals with analysis, synthesis, and implementation of distributed controllers, designed for spatially interconnected systems. We develop a state space framework for posing problems of this type, and focus on systems whose model is spatially discrete. In this paper, analysis and synthesis results are developed for this class of systems using the(More)
In this paper new techniques are developed for the analysis of linear time-varying (LTV) systems. These lead to a formally simple treatment of robust control problems for LTV systems, allowing methods more usually restricted to timeinvariant systems to be employed in the time-varying case. As an illustration of this methodology, the so-called H1 synthesis(More)
This paper considers control design for distributed systems, where the controller is to adopt and preserve the distributed spatial structure of the nominal system. The specific feature of this work is that it does not require the underlying system dynamics to be homogeneous (shift invariant) with respect to spatial or temporal variables. Operator theoretic(More)
In this correspondence, we consider a wireless sensor network consisting of n sensors, and each sensor has a measurement, which is an integer value belonging to the set {().....m-1}, so that it can be represented by [log<sub>2</sub> m] bits. The network has a special node called the fusion center whose goal is to compute a symmetric function of these(More)
The uniform stability of discrete-time switched linear systems, possibly with a strongly connected switching path constraint, and the existence of finite-path-dependent dynamic output feedback controllers uniformly stabilizing such a system are both shown to be characterized by the existence of a finite-dimensional feasible system of linear matrix(More)
In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by(More)
In this paper we present new techniques for the solution of the multi-rate sampled-data H 1 synthesis problem. This makes use of the mathematical tools developed in 4] and 5]. Necessary and suucient conditions are given for the existence of a controller acheiving the desired performance, and all such controllers are parametrized. The problem is shown to be(More)
We introduce STORMED hybrid systems, a decidable class of hybrid systems which is similar to o-minimal hybrid automata in that the continuous dynamics and constraints are described in an o-minimal theory. However, unlike o-minimal hybrid automata, the variables are not initialized in a memoryless fashion at discrete steps. STORMED hybrid systems require(More)
We consider a wireless sensor network consisting of n sensors, each having a recorded bit, the sensor&#8217;s measurement, which has been set to either &#8220;0&#8221; or &#8220;1&#8221;. The network has a special node called the fusion center whose goal is to compute a symmetric function of these bits; i.e., a function that depends only on the number of(More)
In this correspondence, we consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based (QLB) policy and a greedy policy) given an upper bound on the(More)