28,975 research outputs found
Non-centralized Control for Flow-based Distribution Networks: A Game-theoretical Insight
This paper solves a data-driven control problem for a flow-based distribution network with two objectives: a resource allocation and a fair distribution of costs. These objectives represent both cooperation and competition directions. It is proposed a solution that combines either a centralized or distributed cooperative game approach using the Shapley value to determine
a proper partitioning of the system and a fair communication cost distribution. On the other hand, a decentralized noncooperative game approach computing the Nash equilibrium is used to achieve the control objective of the resource allocation under a non-complete information topology. Furthermore, an invariant-set property is presented and the closed-loop system stability is analyzed for the non cooperative game approach. Another contribution regarding the cooperative game approach is an alternative way to compute the Shapley value for the proposed specific characteristic function. Unlike the classical
cooperative-games approach, which has a limited application due to the combinatorial explosion issues, the alternative method allows calculating the Shapley value in polynomial time and hence can be applied to large-scale problems.Generalitat de Catalunya FI 2014Ministerio de Ciencia y Educación DPI2016-76493-C3-3-RMinisterio de Ciencia y Educación DPI2008-05818Proyecto europeo FP7-ICT DYMASO
Unified Approach to Convex Robust Distributed Control given Arbitrary Information Structures
We consider the problem of computing optimal linear control policies for
linear systems in finite-horizon. The states and the inputs are required to
remain inside pre-specified safety sets at all times despite unknown
disturbances. In this technical note, we focus on the requirement that the
control policy is distributed, in the sense that it can only be based on
partial information about the history of the outputs. It is well-known that
when a condition denoted as Quadratic Invariance (QI) holds, the optimal
distributed control policy can be computed in a tractable way. Our goal is to
unify and generalize the class of information structures over which quadratic
invariance is equivalent to a test over finitely many binary matrices. The test
we propose certifies convexity of the output-feedback distributed control
problem in finite-horizon given any arbitrarily defined information structure,
including the case of time varying communication networks and forgetting
mechanisms. Furthermore, the framework we consider allows for including
polytopic constraints on the states and the inputs in a natural way, without
affecting convexity
- …