IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v56y2025i12p3098-3113.html
   My bibliography  Save this article

Distributed model-free optimisation in community-based energy market

Author

Listed:
  • Houman Asgari
  • Maryam Babazadeh

Abstract

A distributed data-driven algorithm is proposed for market clearing within a community-based energy market. The objective is to maximise social welfare in energy trading. Each participant in the market, known as a prosumer, employs an extremum-seeking control (ESC) algorithm within a consensus-based architecture based on simple third-order dynamics. The proposed method circumvents the need for a central coordinator in the market clearing process. Furthermore, prosumers do not require analytical and exact formulations of cost or utility functions. They are required to transmit only a single local decision variable to the neighbours through an undirected connected graph. Under the assumption that prosumers have strongly convex local objective functions, the proposed algorithm demonstrates semi-global practical asymptotic (SPA) convergence to the optimal solution. This convergence is established using averaging theory. Simulation results validate the effectiveness, scalability, and robustness of the proposed distributed strategy.

Suggested Citation

  • Houman Asgari & Maryam Babazadeh, 2025. "Distributed model-free optimisation in community-based energy market," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(12), pages 3098-3113, September.
  • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:12:p:3098-3113
    DOI: 10.1080/00207721.2025.2469151
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2025.2469151
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2025.2469151?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:taf:tsysxx:v:56:y:2025:i:12:p:3098-3113. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.