Incentives-Based Mechanism for Efficient Demand Response Programs

In this work we investigate the inefficiency of the electricity system with strategic agents. Specifically, we prove that without a proper control the total demand of an inefficient system is at most twice the total demand of the optimal outcome. We propose an incentives scheme that promotes optimal outcomes in the inefficient electricity market. The economic incentives can be seen as an indirect revelation mechanism that allocates resources using a one-dimensional message space per resource to be allocated. The mechanism does not request private information from users and is valid for any concave customer's valuation function. We propose a distributed implementation of the mechanism using population games and evaluate the performance of four popular dynamics methods in terms of the cost to implement the mechanism. We find that the achievement of efficiency in strategic environments might be achieved at a cost, which is dependent on both the users' preferences and the dynamic evolution of the system. Some simulation results illustrate the ideas presented throughout the paper.Comment: 38 pages, 9 figures, submitted to journa

Distributed MPC with time-varying communication network: A density-dependent population games approach

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This work addresses distributed control design by using density-dependent population dynamics. Furthermore, stability of the equilibrium point under this proposed class of population dynamics is studied, and the relationship between the equilibrium point of density-dependent population games (DDPG) and the solution of constrained optimization problems is shown. Finally, a distributed predictive control is designed with the proposed density-dependent dynamics, and contemplating a time-varying communication network.Peer ReviewedPostprint (author's final draft

Constrained distributed optimization : A population dynamics approach

Large-scale network systems involve a large number of states, which makes the design of real-time controllers a challenging task. A distributed controller design allows to reduce computational requirements since tasks are divided into different systems, allowing real-time processing. This paper proposes a novel methodology for solving constrained optimization problems in a distributed way inspired by population dynamics. This methodology consists of an extension of a population dynamics equation and the introduction of a mass dynamics equation. The proposed methodology divides the problem into smaller sub-problems, whose feasible regions vary over time achieving an agreement to solve the global problem. The methodology also guarantees attraction to the feasible region and allows to have few changes in the decision-making design when a network suffers the addition/removal of nodes/edges. Then, distributed controllers are designed with the proposed methodology and applied to the large-scale Barcelona Drinking Water Network (BDWN). Some simulations are presented and discussed in order to illustrate the control performance.Peer ReviewedPostprint (author's final draft

Time-varying partitioning for predictive control design: density-games approach

The design of distributed optimization-based controllers for large-scale systems (LSSs) implies every time new challenges. The fact that LSSs are generally located throughout large geographical areas makes dicult the recollection of measurements and their transmission. In this regard, the communication network that is required for a centralized control approach might have high associated economic costs. Furthermore, the computation of a large amount of data implies a high computational burden to manage, process and use them in order to make decisions over the system operation. A plausible solution to mitigate the aforementioned issues associated with the control of LSSs consists in dividing this type of systems into smaller sub-systems able to be handled by independent local controllers. This paper studies two fundamental components of the design of distributed optimization-based controllers for LSSs, i.e., the system partitioning and distributed optimization algorithms. The design of distributed model predictive control (DMPC) strategies with a system partitioning and by using density-dependent population games (DDPG) is presented.Peer ReviewedPostprint (author's final draft

A differential game approach to urban drainage systems control

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Urban drainage systems (UDSs) are complex large-scale systems that carry stormwater and wastewater throughout urban areas. During heavy rain scenarios, UDSs are not able to handle the amount of extra water that enters the network and flooding occurs. Usually, this might happen because the network is not being used efficiently, i.e., some structures remain underused while many others are overused. This paper proposes a control methology based on differential game theory that aims to efficiently use the existing network elements in order to minimize overflows and properly manage the water resource. The proposed controller is tested on a typical UDS and is compared with a centralized MPC achieving similar results in terms of flooding minimization and network usage, but only using local information on distributed controllers.Peer ReviewedPostprint (author's final draft

Control y simulación de tráfico urbano en Colombia: Estado del arte

Las condiciones actuales de la movilidad en Colombia generan interrogantes acerca de qué tan apropiadas son las estrategias de control de tráfico aplicadas en las redes urbanas del país. Con esto en mente, se plantea una revisión de las estrategias de control y plataformas de simulación de sistemas de tráfico más utilizadas en Colombia y en otras partes del mundo; con el propósito de caracterizar el nivel de desarrollo del país en el estudio e implementación de estrategias de control de tráfico urbano y, posteriormente, formular propuestas orientadas hacia la mejora de la movilidad urbana en el país./ The current mobility conditions in Colombia give place to questions about the suitability of the traffic control strategies applied on the Colombian urban networks. Therefore, a review of the control strategies and simulation platforms used in Colombia and around the world is shown. This is done to characterize the level of development of the country, in terms of research and implementation of such control strategies and, furthermore, to formulate proposals oriented towards the improvement of the Colombian urban mobility

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

Distributed population dynamics: Optimization and control applications

Population dynamics have been widely used in the design of learning and control systems for networked engineering applications, where the information dependency among elements of the network has become a relevant issue. Classic population dynamics (e.g., replicator, logit choice, Smith, and projection) require full information to evolve to the solution (Nash equilibrium). The main reason is that classic population dynamics are deduced by assuming well-mixed populations, which limits the applications where this theory can be implemented. In this paper, we extend the concept of population dynamics for nonwell-mixed populations in order to deal with distributed information structures that are characterized by noncomplete graphs. Although the distributed population dynamics proposed in this paper use partial information, they preserve similar characteristics and properties of their classic counterpart. Specifically, we prove mass conservation and convergence to Nash equilibrium. To illustrate the performance of the proposed dynamics, we show some applications in the solution of optimization problems, classic games, and the design of distributed controllers.This work has been supported by COLCIENCIAS–COLFUTURO, grants No: 528 and 6172; and by Project ALTERNAR, Acuerdo 005, 07/19/13 CTeI–SGR–Narino, Colombia.Peer reviewe