skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • NSF Public Access
  • Search Results
  • A Game-Theoretic Approach for Optimal Dispatch of Building Thermal Loads Subject to Linear-Plus-Exponential Marginal Price
Title: A Game-Theoretic Approach for Optimal Dispatch of Building Thermal Loads Subject to Linear-Plus-Exponential Marginal Price
This paper introduces a game-theoretical strategy for optimal dispatch of building thermal loads, based on a marginal price model derived from an actual dispatch curve. A non-cooperative game is formulated, and the existence and uniqueness of the Nash equilibrium solution are proved aided by the variational inequality theory. A game solution algorithm is presented in this paper to solve the control problem with guaranteed convergence. The proposed game-theoretical control technique was evaluated against a baseline energy minimization strategy and a socially optimal solution, through a simulation test of a virtual market comprised of six buildings. The results show that the proposed game-theoretical strategy could achieve performance very close to the social optimum with a Price of Anarchy of 1.0041 and a 24% cost reduction compared to the baseline energy-priority strategy.  more » « less
Award ID(s):
2238381
PAR ID:
10558389
Author(s) / Creator(s):
;
Publisher / Repository:
2023 62nd IEEE Conference on Decision and Control (CDC)
Date Published:
ISSN:
2576-2370
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; (, International Journal of Robust and Nonlinear Control)
    Summary Path planning is a fundamental and critical task in many robotic applications. For energy‐constrained robot platforms, path planning solutions are desired with minimum time arrivals and minimal energy consumption. Uncertain environments, such as wind conditions, pose challenges to the design of effective minimum time‐energy path planning solutions. In this article, we develop a minimum time‐energy path planning solution in continuous state and control input spaces using integral reinforcement learning (IRL). To provide a baseline solution for the performance evaluation of the proposed solution, we first develop a theoretical analysis for the minimum time‐energy path planning problem in a known environment using the Pontryagin's minimum principle. We then provide an online adaptive solution in an unknown environment using IRL. This is done through transforming the minimum time‐energy problem to an approximate minimum time‐energy problem and then developing an IRL‐based optimal control strategy. Convergence of the IRL‐based optimal control strategy is proven. Simulation studies are developed to compare the theoretical analysis and the proposed IRL‐based algorithm. 
    more » « less
  2. ; ; ; ; (, Energies)
    null (Ed.)
    In this paper, we consider a probabilistic microgrid dispatch problem where the predictions of the load and the Renewable Energy Source (RES) generation are given in the form of intervals. A hybrid method combining scenario-selected optimization and reserve strategy using the Model Predictive Control (MPC) framework is proposed. Specifically, first of all, an appropriate scenario is selected by the optimizer at each optimization stage, and then the optimal scheduling and reservation of system capacity are determined based on the selected scenario and possible variations in the future as provided by the predictors. In addition, a new reserve strategy is introduced to adaptively maintain system reliability and respond to variations in the hierarchical microgrid control. Simulations are conducted to compare our proposed method with the existing robust method and the deterministic dispatch with perfect information. Results show that our proposed method significantly improves the system efficiency while maintaining system reliability. 
    more » « less
  3. ; ; ; (, IEEE Conference Decision and Control)
    null (Ed.)
    A new stochastic control methodology is introduced for distributed control, motivated by the goal of creating virtual energy storage from flexible electric loads, i.e. Demand Dispatch. In recent work, the authors have introduced Kullback- Leibler-Quadratic (KLQ) optimal control as a stochastic control methodology for Markovian models. This paper develops KLQ theory and demonstrates its applicability to demand dispatch. In one formulation of the design, the grid balancing authority simply broadcasts the desired tracking signal, and the hetero-geneous population of loads ramps power consumption up and down to accurately track the signal. Analysis of the Lagrangian dual of the KLQ optimization problem leads to a menu of solution options, and expressions of the gradient and Hessian suitable for Monte-Carlo-based optimization. Numerical results illustrate these theoretical results. 
    more » « less
  4. ; ; ; (, IEEE Transactions on Automatic Control)
    Alessandro Astolfi (Ed.)
    Demand dispatch is the science of extracting virtual energy storage through the automatic control of deferrable loads to provide balancing or regulation services to the grid, while maintaining consumer-end quality of service.The control of a large collection of heterogeneous loads is in part a resource allocation problem, since different classes of loads are more valuable for different services. The goal of this paper is to unveil the structure of the optimal solution to the resource allocation problem, and investigate short-term market implications. It is found that the marginal cost for each load class evolves in a two-dimensional subspace: spanned by a co-state process and its derivative. The resource allocation problem is recast to construct a dynamic competitive equilibrium model, in which the consumer utility is the negative of the cost of deviation from ideal QoS. It is found that a competitive equilibrium exists with the equilibrium price equal to the negative of an optimal co-state process. Moreover, the equilibrium price is different than what would be obtained based on the standard assumption that the consumer's utility is a function of power consumption. 
    more » « less
  5. ; ; (, IEEE Transactions on Power Systems)
    null (Ed.)
    Pricing multi-interval economic dispatch of electric power under operational uncertainty is considered in this two- part paper. Part I investigates dispatch-following incentives of profit-maximizing generators and shows that, under mild conditions, no uniform-pricing scheme for the rolling-window economic dispatch provides dispatch-following incentives that avoid discriminative out-of-the-market uplifts. A nonuniform pricing mechanism, referred to as the temporal locational marginal pricing (TLMP), is proposed. As an extension of the standard locational marginal pricing (LMP), TLMP takes into account both generation and ramping-induced opportunity costs. It eliminates the need for the out-of-the-market uplifts and guarantees full dispatch-following incentives regardless of the accuracy of the demand forecasts used in the dispatch. It is also shown that, under TLMP, a price-taking market participant has incentives to bid truthfully with its marginal cost of generation. Part II of the paper extends the theoretical results developed in Part I to more general network settings. It investigates a broader set of performance measures, including the incentives of the truthful revelation of ramping limits, revenue adequacy of the operator, consumer payments, generator profits, and price volatility under the rolling-window dispatch model with demand forecast errors. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email