3 resultados para Agent architecture
em CaltechTHESIS
Resumo:
The dissertation studies the general area of complex networked systems that consist of interconnected and active heterogeneous components and usually operate in uncertain environments and with incomplete information. Problems associated with those systems are typically large-scale and computationally intractable, yet they are also very well-structured and have features that can be exploited by appropriate modeling and computational methods. The goal of this thesis is to develop foundational theories and tools to exploit those structures that can lead to computationally-efficient and distributed solutions, and apply them to improve systems operations and architecture.
Specifically, the thesis focuses on two concrete areas. The first one is to design distributed rules to manage distributed energy resources in the power network. The power network is undergoing a fundamental transformation. The future smart grid, especially on the distribution system, will be a large-scale network of distributed energy resources (DERs), each introducing random and rapid fluctuations in power supply, demand, voltage and frequency. These DERs provide a tremendous opportunity for sustainability, efficiency, and power reliability. However, there are daunting technical challenges in managing these DERs and optimizing their operation. The focus of this dissertation is to develop scalable, distributed, and real-time control and optimization to achieve system-wide efficiency, reliability, and robustness for the future power grid. In particular, we will present how to explore the power network structure to design efficient and distributed market and algorithms for the energy management. We will also show how to connect the algorithms with physical dynamics and existing control mechanisms for real-time control in power networks.
The second focus is to develop distributed optimization rules for general multi-agent engineering systems. A central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to the given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent’s control on the least amount of information possible. Our work focused on achieving this goal using the framework of game theory. In particular, we derived a systematic methodology for designing local agent objective functions that guarantees (i) an equivalence between the resulting game-theoretic equilibria and the system level design objective and (ii) that the resulting game possesses an inherent structure that can be exploited for distributed learning, e.g., potential games. The control design can then be completed by applying any distributed learning algorithm that guarantees convergence to the game-theoretic equilibrium. One main advantage of this game theoretic approach is that it provides a hierarchical decomposition between the decomposition of the systemic objective (game design) and the specific local decision rules (distributed learning algorithms). This decomposition provides the system designer with tremendous flexibility to meet the design objectives and constraints inherent in a broad class of multiagent systems. Furthermore, in many settings the resulting controllers will be inherently robust to a host of uncertainties including asynchronous clock rates, delays in information, and component failures.
Resumo:
Interleukin 2 (IL2) is the primary growth hormone used by mature T cells and this lymphokine plays an important role in the magnification of cell-mediated immune responses. Under normal circumstances its expression is limited to antigen-activated type 1 helper T cells (TH1) and the ability to transcribe this gene is often regarded as evidence for commitment to this developmental lineage. There is, however, abundant evidence than many non-TH1 T cells, under appropriate conditions, possess the ability to express this gene. Of paramount interest in the study of T-cell development is the mechanisms by which differentiating thymocytes are endowed with particular combinations of cell surface proteins and response repertoires. For example, why do most helper T cells express the CD4 differentiation antigen?
As a first step in understanding these developmental processes the gene encoding IL2 was isolated from a mouse genomic library by probing with a conspecific IL2 cDNA. The sequence of the 5' flanking region from + 1 to -2800 was determined and compared to the previously reported human sequence. Extensive identity exists between +1 and -580 (86%) and sites previously shown to be crucial for the proper expression of the human gene are well conserved in both sequence location in the mouse counterpart.
Transient expression assays were used to evaluate the contribution of various genomic sequences to high-level gene expression mediated by a cloned IL2 promoter fragment. Differing lengths of 5' flanking DNA, all terminating in the 5' untranslated region, were linked to a reporter gene, bacterial chloramphenicol acetyltransferase (CAT) and enzyme activity was measured after introduction into IL2-producing cell lines. No CAT was ever detected without stimulation of the recipient cells. A cloned promoter fragment containing only 321 bp of upstream DNA was expressed well in both Jurkat and EL4.El cells. Addition of intragenic or downstream DNA to these 5' IL2-CAT constructs showed that no obvious regulatory regions resided there. However, increasing the extent of 5' DNA from -321 to -2800 revealed several positive and negative regulatory elements. One negative region that was well characterized resided between -750 and -1000 and consisted almost exclusively of alternating purine and pyrimidines. There is no sequence resembling this in the human gene now, but there is evidence that there may have once been.
No region, when deleted, could relax either the stringent induction-dependence on cell-type specificity displayed by this promoter. Reagents that modulated endogenous IL2 expression, such as cAMP, cyclosporin A, and IL1, affected expression of the 5' IL2-CAT constructs also. For a given reagent, expression from all expressible constructs was suppressed or enhanced to the same extent. This suggests that these modulators affect IL2 expression through perturbation of a central inductive signal rather than by summation of the effects of discrete, independently regulated, negative and positive transcription factors.
Resumo:
The centralized paradigm of a single controller and a single plant upon which modern control theory is built is no longer applicable to modern cyber-physical systems of interest, such as the power-grid, software defined networks or automated highways systems, as these are all large-scale and spatially distributed. Both the scale and the distributed nature of these systems has motivated the decentralization of control schemes into local sub-controllers that measure, exchange and act on locally available subsets of the globally available system information. This decentralization of control logic leads to different decision makers acting on asymmetric information sets, introduces the need for coordination between them, and perhaps not surprisingly makes the resulting optimal control problem much harder to solve. In fact, shortly after such questions were posed, it was realized that seemingly simple decentralized optimal control problems are computationally intractable to solve, with the Wistenhausen counterexample being a famous instance of this phenomenon. Spurred on by this perhaps discouraging result, a concerted 40 year effort to identify tractable classes of distributed optimal control problems culminated in the notion of quadratic invariance, which loosely states that if sub-controllers can exchange information with each other at least as quickly as the effect of their control actions propagates through the plant, then the resulting distributed optimal control problem admits a convex formulation.
The identification of quadratic invariance as an appropriate means of "convexifying" distributed optimal control problems led to a renewed enthusiasm in the controller synthesis community, resulting in a rich set of results over the past decade. The contributions of this thesis can be seen as being a part of this broader family of results, with a particular focus on closing the gap between theory and practice by relaxing or removing assumptions made in the traditional distributed optimal control framework. Our contributions are to the foundational theory of distributed optimal control, and fall under three broad categories, namely controller synthesis, architecture design and system identification.
We begin by providing two novel controller synthesis algorithms. The first is a solution to the distributed H-infinity optimal control problem subject to delay constraints, and provides the only known exact characterization of delay-constrained distributed controllers satisfying an H-infinity norm bound. The second is an explicit dynamic programming solution to a two player LQR state-feedback problem with varying delays. Accommodating varying delays represents an important first step in combining distributed optimal control theory with the area of Networked Control Systems that considers lossy channels in the feedback loop. Our next set of results are concerned with controller architecture design. When designing controllers for large-scale systems, the architectural aspects of the controller such as the placement of actuators, sensors, and the communication links between them can no longer be taken as given -- indeed the task of designing this architecture is now as important as the design of the control laws themselves. To address this task, we formulate the Regularization for Design (RFD) framework, which is a unifying computationally tractable approach, based on the model matching framework and atomic norm regularization, for the simultaneous co-design of a structured optimal controller and the architecture needed to implement it. Our final result is a contribution to distributed system identification. Traditional system identification techniques such as subspace identification are not computationally scalable, and destroy rather than leverage any a priori information about the system's interconnection structure. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. To that end we propose a promising heuristic for identifying the dynamics of a subsystem that is still connected to a large system. We exploit the fact that the transfer function of the local dynamics is low-order, but full-rank, while the transfer function of the global dynamics is high-order, but low-rank, to formulate this separation task as a nuclear norm minimization problem. Finally, we conclude with a brief discussion of future research directions, with a particular emphasis on how to incorporate the results of this thesis, and those of optimal control theory in general, into a broader theory of dynamics, control and optimization in layered architectures.