IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.00911.html

Battery Storage Co-Optimization in Day-Ahead and Real-Time Markets with Bayesian Optimization

Author

Listed:
  • Thiha Aung
  • Mike Ludkovski

Abstract

We propose Adaptive Refinement Bayesian Optimization for Day-Ahead and Real-Time (ARBO-DART) markets, an algorithm for BESS intraday dispatch co-optimization in which day-ahead (DA) commitment profiles are optimized against value of real-time (RT) recourse computed by a black-box stochastic control solver. In our framework, the DA price curve is taken as exogenous and RT prices evolve as a mean-reverting process around it. The RT recourse layer performs dynamic closed-loop control while accounting for the piecewise-linear state-of-charge dynamics and the DA-driven feasible control set. By wrapping Bayesian Optimization (BO) around the RT solver, ARBO-DART jointly optimizes DA commitments and dynamic RT flexibility without requiring analytic gradients, closed-form value functions, or finite-scenario approximations. To overcome the curse of dimensionality in fixed-resolution DA profiles, ARBO-DART starts from a coarse partition of DA commitments and progressively refines charge and discharge blocks where additional temporal resolution is most needed, as judged by the corresponding RT policy. Numerical experiments across realistic DA price curves reveal the effectiveness of ARBO-DART in recovering economically meaningful DA bidding structures while being several times faster relative to fixed-resolution

Suggested Citation

  • Thiha Aung & Mike Ludkovski, 2026. "Battery Storage Co-Optimization in Day-Ahead and Real-Time Markets with Bayesian Optimization," Papers 2608.00911, arXiv.org.
  • Handle: RePEc:arx:papers:2608.00911
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.00911
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2608.00911. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.