1. An Asynchronous Online Negotiation Mechanism for Real-Time Peer-to-Peer Electricity Markets
- Author
-
Pierre Pinson, Qinmin Yang, Zhenwei Guo, Zaiyue Yang, Shibo Chen, and Qianhong Wu
- Subjects
Optimization ,Computer science ,Distributed computing ,media_common.quotation_subject ,Real-time P2P markets ,Energy Engineering and Power Technology ,Peer-to-peer ,computer.software_genre ,Electricity supply industry ,Renewable energy sources ,forgetting factor ,Market mechanism ,non-stationary regret ,Peer-to-peer computing ,SDG 7 - Affordable and Clean Energy ,Electrical and Electronic Engineering ,Online algorithm ,Real-time systems ,media_common ,Convex functions ,business.industry ,Regret ,Negotiation ,Core (game theory) ,Asynchronous communication ,Asynchronous online consensus ADMM ,Electricity ,business ,computer ,Upper bound - Abstract
Participants in electricity markets are becoming more proactive because of the fast development of DERs and DSM, which also boosts the emergence of P2P market mechanisms. Moreover, the market is also required to operate in a real-time scheme in response to changes in generation and load to maintain power balance. Therefore, a practicable real-time P2P market mechanism is in urgent need. However, it is technically challenging to deploy P2P mechanisms in real-time, since they most often involve a heavy computation burden, while the time available for negotiation in real-time is very short. Our core contribution is to design a novel asynchronous online optimization framework to enable the real-time P2P market negotiation mechanism, which can greatly reduce the computation and communication burden from two aspects. First, a novel online consensus ADMM algorithm is proposed, which can greatly reduce the computation complexity since only one iteration is performed for each agent in every time period. Second, the market operates in an asynchronous mode so that all agents can freely trade without waiting for idle neighboring agents. The sublinear regret upper bound is proved for our online algorithm, which indicates that social welfare can be maximized in the long run on time average.
- Published
- 2022
- Full Text
- View/download PDF