Matches in SemOpenAlex for { <https://semopenalex.org/work/W2167462080> ?p ?o ?g. }
- W2167462080 abstract "Rapid advances in information processing, communication and sensing technologies have enabled more and more devices to be provided with embedded processors, networking capabilities and sensors. For the field of estimation and control, it is now possible to consider an architecture in which many simple components communicate and cooperate to achieve a joint team goal. This distributed (or networked) architecture promises much in terms of performance, reliability and simplicity of design; however, at the same time, it requires extending the traditional theories of control, communication and computation and, in fact, looking at a unified picture of the three fields. A systematic theory of how to design distributed systems is currently lacking. This dissertation takes the first steps towards understanding the effects of imperfect information flow in distributed systems from an estimation and control perspective and coming up with new design principles to counter these effects. Designing networked systems is difficult because such systems challenge two basic assumptions of traditional control theory - presence of a central node with access to all the information about the system and perfect transmission of information among components. We formulate and solve many problems that deal with the removal of one, or both, of these assumptions. The chief idea explored in this dissertation is the joint design of information flow and the control law. While traditional control design has concentrated on calculating the optimal control input by assuming a particular information flow between the components, our approach seeks to synthesize the optimal information flow along with the optimal control law that satisfies the constraints of the information flow. Thus besides the question of 'What should an agent do?', the questions of 'Whom should an agent talk to?', 'What should an agent communicate?', 'When should an agent communicate?' and so on also have to be answered. The design of the information flow represents an important degree of freedom available to the system designer that has hitherto largely been ignored. As we demonstrate in the dissertation, the joint design of information flow and the optimal control input satisfying the constraints of that information flow yields large improvements in performance over simply trying to fit traditional design theories on distributed systems. We begin by formulating a distributed control problem in which many agents in a formation need to cooperate to minimize a joint cost function. We provide numerical algorithms to synthesize the optimal constrained control law that involve solving linear equations only and hence are free from numerical issues plaguing the other approaches proposed in the literature. We then provide and analyze a model to understand the issue of designing the topology according to which the agents interact. The results are very surprising since there are cases when allowing communication to happen between two agents may, in fact, be detrimental to the performance. We then move on to consider the effects of communication channels on control performance. To counter such effects, we propose the idea of encoding information for the purpose of estimation and control prior to transmission. Although information theoretic techniques are not possible in our problem, we are able to solve for a recursive yet optimal encoder / decoder structure in many cases. This information flow design oriented approach has unique advantages such as being optimal for any packet drop pattern, being able to include the effect of known but random delays easily, letting us escape the limits set by reliability for transmission of data across a network by using intermediate nodes as 'repeaters' similar to a digital communication network and so on. We finally take a look at combining the effects of multiple sources of information and communication channels on estimation and control. We look at a distributed estimation problem in which, at every time step, only a subset out of many sensors can transmit information to the estimator. This is also a representative resource allocation problem. We propose the idea of stochastic communication patterns that allows us to include the effects of communication channels explicitly during system design. Thus, instead of tree-search based algorithms proposed in the literature, we provide stochastic scheduling algorithms that can take into account the random packet drop effect of the channels. We also consider a distributed control problem with switching topologies and solve for the optimal controller. The tools that we develop are applicable to many other scenarios and we demonstrate some of them in the dissertation. Along the way, we look at many other related problems in the dissertation. As an example, we provide initial results about the issue of robustness of a distributed system design to a malfunctioning agent. This notion is currently lacking in the control and estimation community, but has to be a part of any effective theory for designing networked or distributed systems." @default.
- W2167462080 created "2016-06-24" @default.
- W2167462080 creator A5024301984 @default.
- W2167462080 date "2007-01-01" @default.
- W2167462080 modified "2023-09-27" @default.
- W2167462080 title "Distributed estimation and control in networked systems" @default.
- W2167462080 cites W105181866 @default.
- W2167462080 cites W1480906122 @default.
- W2167462080 cites W1485521993 @default.
- W2167462080 cites W1488001421 @default.
- W2167462080 cites W1494814770 @default.
- W2167462080 cites W1497480328 @default.
- W2167462080 cites W1498366935 @default.
- W2167462080 cites W1502991072 @default.
- W2167462080 cites W1509538959 @default.
- W2167462080 cites W1510176710 @default.
- W2167462080 cites W1515707356 @default.
- W2167462080 cites W1515743786 @default.
- W2167462080 cites W1537521045 @default.
- W2167462080 cites W1539904983 @default.
- W2167462080 cites W1541050834 @default.
- W2167462080 cites W1544103096 @default.
- W2167462080 cites W1548553338 @default.
- W2167462080 cites W1548660701 @default.
- W2167462080 cites W1556689643 @default.
- W2167462080 cites W1574923065 @default.
- W2167462080 cites W1578316391 @default.
- W2167462080 cites W1589782521 @default.
- W2167462080 cites W1634005169 @default.
- W2167462080 cites W1646998587 @default.
- W2167462080 cites W1785273592 @default.
- W2167462080 cites W1801704802 @default.
- W2167462080 cites W1886541966 @default.
- W2167462080 cites W1897917720 @default.
- W2167462080 cites W1924677301 @default.
- W2167462080 cites W1944376368 @default.
- W2167462080 cites W1964202891 @default.
- W2167462080 cites W1965640670 @default.
- W2167462080 cites W1965705620 @default.
- W2167462080 cites W1971156837 @default.
- W2167462080 cites W1973162763 @default.
- W2167462080 cites W1975617599 @default.
- W2167462080 cites W1975747200 @default.
- W2167462080 cites W1976169918 @default.
- W2167462080 cites W1978848993 @default.
- W2167462080 cites W1983596840 @default.
- W2167462080 cites W1984177460 @default.
- W2167462080 cites W1988007323 @default.
- W2167462080 cites W1993170675 @default.
- W2167462080 cites W1994672033 @default.
- W2167462080 cites W1994703549 @default.
- W2167462080 cites W1995875735 @default.
- W2167462080 cites W2002416543 @default.
- W2167462080 cites W2003801405 @default.
- W2167462080 cites W2005841570 @default.
- W2167462080 cites W2011450427 @default.
- W2167462080 cites W2011961136 @default.
- W2167462080 cites W2013348732 @default.
- W2167462080 cites W2015410655 @default.
- W2167462080 cites W2017549942 @default.
- W2167462080 cites W2021429920 @default.
- W2167462080 cites W2021632315 @default.
- W2167462080 cites W2022406843 @default.
- W2167462080 cites W2022506481 @default.
- W2167462080 cites W2022823021 @default.
- W2167462080 cites W2023267926 @default.
- W2167462080 cites W2027851267 @default.
- W2167462080 cites W2031475099 @default.
- W2167462080 cites W2036149463 @default.
- W2167462080 cites W2036881328 @default.
- W2167462080 cites W2037500647 @default.
- W2167462080 cites W2043481157 @default.
- W2167462080 cites W2045868534 @default.
- W2167462080 cites W2049306799 @default.
- W2167462080 cites W2050087793 @default.
- W2167462080 cites W2050657197 @default.
- W2167462080 cites W2051556621 @default.
- W2167462080 cites W2051752778 @default.
- W2167462080 cites W2055762251 @default.
- W2167462080 cites W2064937482 @default.
- W2167462080 cites W2068385125 @default.
- W2167462080 cites W2069525910 @default.
- W2167462080 cites W2070407436 @default.
- W2167462080 cites W2079538138 @default.
- W2167462080 cites W2082794610 @default.
- W2167462080 cites W2083138764 @default.
- W2167462080 cites W2091839500 @default.
- W2167462080 cites W2093038430 @default.
- W2167462080 cites W2095829232 @default.
- W2167462080 cites W2096102601 @default.
- W2167462080 cites W2097071386 @default.
- W2167462080 cites W2097602920 @default.
- W2167462080 cites W2097902574 @default.
- W2167462080 cites W2098046554 @default.
- W2167462080 cites W2098432798 @default.
- W2167462080 cites W2099319707 @default.
- W2167462080 cites W2103122000 @default.
- W2167462080 cites W2104443140 @default.
- W2167462080 cites W2106609574 @default.
- W2167462080 cites W2107182307 @default.