Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Robust Tracking Commitment with Application to Demand Response
 
report

Robust Tracking Commitment with Application to Demand Response

Bitlislioglu, Altug  
•
Gorecki, Tomasz Tadeusz  
•
Jones, Colin  
2015

Many engineering problems that involve hierarchical control applications, such as demand side ancillary service provision to the power grid, can be posed as an optimal tracking commitment problem. In this setting, the lower- level controller commits a set of possible reference trajectories over a finite horizon to an external entity, which requires guaranteed tracking of any reference trajectory that can be sampled from the committed set, with an allowed deviation, in exchange for a payment corresponding to the size of the reference set. This paper presents a method to solve the optimal tracking commitment problem for constrained linear systems subject to uncertain disturbance and reference signals. The proposed method allows tractable computations via convex optimization for conic representable reference sets and lends itself to distributed solution methods. We demonstrate the proposed method in a simulation based case study with a commercial building that offers a frequency regulation service to the power grid.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

robusttrackingcommitment.pdf

Access type

openaccess

Size

710.1 KB

Format

Adobe PDF

Checksum (MD5)

8766569377eea6c90fd9e49773f09f05

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés