<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1133516</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2023.1133516</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Consensus control for distributed power tracking by device-level digital twin agents</article-title>
<alt-title alt-title-type="left-running-head">Wang et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2023.1133516">10.3389/fenrg.2023.1133516</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Yanan</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Guo</surname>
<given-names>Zhimin</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2154882/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Pang</surname>
<given-names>Yuhang</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gao</surname>
<given-names>Kaiqiang</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhao</surname>
<given-names>Jian</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>China Electric Power Research Institute</institution>, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>State Grid Henan Electric Power Research Institute</institution>, <addr-line>Zhengzhou</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1363500/overview">Haixiang Zang</ext-link>, Hohai University, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1588599/overview">Puyu Wang</ext-link>, Nanjing University of Science and Technology, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1137958/overview">Yingjun Wu</ext-link>, Hohai University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Zhimin Guo, <email>Guo_zhimin123@outlook.com</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Process and Energy Systems Engineering, a section of the journal <italic>Frontiers in Energy Research</italic>
</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>02</day>
<month>03</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>11</volume>
<elocation-id>1133516</elocation-id>
<history>
<date date-type="received">
<day>29</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>02</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Wang, Guo, Pang, Gao and Zhao.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Wang, Guo, Pang, Gao and Zhao</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>
<bold>Abstract:</bold> The development of electronics and software has resulted in the ability of twin agents to act as digital counterparts for the optimization, control, and monitoring of real power grids. When increasing regulation resources are connected to the power grid, is challenging for independent system operators to use a centralized controller to achieve power tracking and balance. Therefore, the present study applied device-level-based digital twins to monitor physical signals for computer-aided design for power tracking. Moreover, a consensus control-based distributed power tracking system is proposed for the physical-model simulation of the power grid. A communication network was also designed for realistic signal exchange. The combination of the proposed distributed power tracking method and communication network can accelerate computational efficiency and protect the privacy of the regulation resources. Finally, the performance of the proposed distributed power tracking method is validated in a simulation system with 10 regulation resources.</p>
</abstract>
<kwd-group>
<kwd>digital twins</kwd>
<kwd>consensus control</kwd>
<kwd>distributed optimization</kwd>
<kwd>power tracking</kwd>
<kwd>physical-model simulation</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>With the new energy development, increasing regulation resources participate in power tracking (<xref ref-type="bibr" rid="B20">Wu et al., 2021a</xref>; <xref ref-type="bibr" rid="B25">Zang et al., 2021</xref>; <xref ref-type="bibr" rid="B22">Wu et al., 2022</xref>). Traditional power tracking models only concern a centralized controller (<xref ref-type="bibr" rid="B15">Ray et al., 1999</xref>) with optimal algorithms for independent system operators (<xref ref-type="bibr" rid="B31">Zhang et al., 2020</xref>). However, with the increase in regulation resources, the computational costs for the optimization of dynamic power tracking also increase. Thus, high-quality dispatch schemes are hard to obtain using traditional centralized controller-based power tracking methods. Among, the recent advancements in electronics and software, digital twin agents can be viewed as digital counterparts for the optimization, control, and monitoring (<xref ref-type="bibr" rid="B33">Zhao and Lin, 2022</xref>) of real power grids (<xref ref-type="bibr" rid="B8">Doherty et al., 2010</xref>). Meanwhile, distributed-based power tracking frameworks (<xref ref-type="bibr" rid="B10">Kakran and Chanana, 2018</xref>) have been proposed to reduce computational costs and increase the optimal speed.</p>
<p>The key component of the digital concept is that it represents the connection between the physical and digital worlds, which enables an improved physical quantity model by combining the virtual and actual worlds. NASA and Michael Greaves defined a digital twin as a digital counterpart of a virtual physical thing or system (<xref ref-type="bibr" rid="B17">Schleich et al., 2017</xref>). Consequently, the digital twin technique is a powerful tool to integrate the real and the virtual to more effectively manage intelligence. Previous studies have proposed the integration of the power grid with the digital twin technique. A novel structure based on a deep neural network technique was introduced by <xref ref-type="bibr" rid="B34">Zhou et al. (2019)</xref> to further provide a short time delay in the power grid for real-time online optimization. Moreover, <xref ref-type="bibr" rid="B13">Pan et al. (2020)</xref> developed a life cycle pattern with control, fault detection, and simulation applications. This work formulated a digital twin-based framework of communication between the virtual smart grid and the real power system. Additionally, <xref ref-type="bibr" rid="B18">Wang et al. (2021)</xref> described a data-driven-based methodology for feature extraction of the operational state for the power grid, which implemented a recursive state and provided decreased performance evaluation times.</p>
<p>Power tracking in power grids is a non-linear (<xref ref-type="bibr" rid="B11">Lakshmanan et al., 2016</xref>), multiple-constraint (<xref ref-type="bibr" rid="B12">Li et al., 2016</xref>), and time-series problem (<xref ref-type="bibr" rid="B16">Sadeghi-Mobarakeh and Mohsenian-Rad, 2017</xref>). For these applications, centralized-based power tracking approaches, such as mathematical programming (<xref ref-type="bibr" rid="B23">Xie et al., 2000</xref>) or heuristic algorithms (<xref ref-type="bibr" rid="B7">Deb et al., 2002</xref>) are often used to obtain high-quality dispatch schemes. With the decentralization of the power grid and the expansion of regulation resources, it is hard for conventional centralized approaches to quickly determine a global optimum within the scheduled time (<xref ref-type="bibr" rid="B21">Wu et al., 2021b</xref>; <xref ref-type="bibr" rid="B5">Cheng et al., 2023</xref>). Compared to conventional centralized power tracking approaches such as mathematical programming or heuristic algorithms, distributed-based algorithms (<xref ref-type="bibr" rid="B9">Erdeljan et al., 2014</xref>) can more quickly provide optimal solutions for power grids. The two basic types of distributed methodologies for optimization are leaderless and leader-based, which are formulated for power tracking in power grids. <xref ref-type="bibr" rid="B6">Cui et al. (2018)</xref> presented an auction algorithm-based economic dispatch with leaderless regulation resources and evaluated the performance of various auction algorithms in various communication scenarios and clarified the impact of swap operations and communication networks of the regulation resources. <xref ref-type="bibr" rid="B30">Zhang et al. (2018)</xref> developed a framework for cyber, resource, and social systems and presented a human communication-based distributed consensus algorithm for regulation resources for a combined heat and power system. Furthermore, for the high connection of new energy resources, <xref ref-type="bibr" rid="B27">Zhang et al. (2021)</xref>, proposed an adaptive parameter for the swap operation. Their study executed two simulation systems with various seniors for communication networks and verified the high performance of the proposed adaptive auction method. They also implemented a novel random forest base-auction method for the power tracking of a photovoltaic station (PV). Lastly, <xref ref-type="bibr" rid="B29">Zhang et al. (2022)</xref> developed a hydrogen regulation resource to store PV power output and formulate a negotiate-based distributed method to exploit the reconfiguration and provide the maximum profit for a PV-coordinated hydrogen system.</p>
<p>Among leader-based algorithms, the commonly used methodology is the cooperative consensus technique. <xref ref-type="bibr" rid="B32">Zhang and Chow (2012)</xref> used a consensus algorithm to quickly obtain an economic dispatch scheme by selecting a leader of a regulation resource and reaching the incremental cost. <xref ref-type="bibr" rid="B3">Bidram et al. (2013a)</xref> described a technique that facilitated the linearization of distributed generation for voltage control. The authors also developed an approach for cooperative consensus of regulation voltage (<xref ref-type="bibr" rid="B2">Bidram et al., 2013b</xref>). This study demonstrated that the proposed communication network provided a more reliable solution than the traditional centralized controller. <xref ref-type="bibr" rid="B28">Zhang et al. (2016a)</xref> formulated a distributed robust consensus method for transmission delay and noise. The simulation results showed that the algorithm could search for high-quality optimums at outage disturbances for economic dispatch. Subsequently, <xref ref-type="bibr" rid="B26">Zhang et al. (2016b)</xref> proposed a framework of virtual regulation resource tribe for frequency control with transfer learning-based consensus for regulation cost and ramp time.</p>
<p>Based on the fast computation of the distributed consensus method, communication network-based consensus algorithms will more be appropriate for communication between regulation resources. The present work employs a consensus control algorithm to rapidly obtain a high-performance scheme for power tracking with digital twin agents. The network communication between the agents is presented and the gain function is formulated for fast optimization. The main contributions of this work are as follows.<list list-type="simple">
<list-item>
<p>1) In contrast to previous work, this study proposes a digital twin agents-based power tracking model. It includes the life cycle of power tracking, from disturbance collection to controller strategy optimization, regulation resource response, and dynamic control performance visualization. Previous studies have focused on improving the computation time and optimal strategy but seldom apply the combination of digital twin agents and distributed power tracking with compensation payment (<xref ref-type="bibr" rid="B14">Papalexopoulos and Andrianesis, 2014</xref>). In particular, the influence of load disturbance on the dynamic control performance standard (CPS) can be rapidly evaluated for power grids.</p>
</list-item>
<list-item>
<p>2) A distributed consensus control-based algorithm (DCCA) for device-level digital twin agents is formulated to quickly obtain an optimal dispatch scheme for real-time power tracking. A distributed communication network to accelerate the communication speed and protect the privacy of the regulation resources is also presented. The proposed DDCCA can cooperate with the regulation resources, effectively utilize the fast regulation performance of renewable energy resources, and improve the control performance standard for digital twin-based distributed power tracking (DT-DPT).</p>
</list-item>
</list>
</p>
<p>The remaining sections of this work are organized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> describes the mathematical model of DT-DPT that coordinates the device-level digital twin agents. <xref ref-type="sec" rid="s3">Section 3</xref> illustrates the specific implementation of DCCA for DT-DPT. <xref ref-type="sec" rid="s4">Section 4</xref> executes the simulation experiments and discusses the results. Finally, <xref ref-type="sec" rid="s5">Section 5</xref> concludes this paper.</p>
</sec>
<sec id="s2">
<title>2 Mathematical model of DT-DPT</title>
<sec id="s2-1">
<title>2.1 DT-DPT framework</title>
<p>The DT-DPT framework is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. DT-DPT includes physical information, algorithm optimization, and framework evaluation. In the physical control process, a load disturbance is exerted on the power grid. The frequency and tie-line power are then measured for real-time power tracking. Next, the controller will receive the signal and distribute the power command to the regulation resources according to the DCCA optimization. Finally, the performance of dynamic control is evaluated. Generally, the regulation resources in DT-DPT contain conventional resources (coal-fire, hydrogen, liquefied natural gas [LNG], wind farm [WF], and photovoltaic [PV]). Among the regulation resources, one was selected as the consensus leader for optimization; the others were consensus followers.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>DT-DPT framework.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g001.tif"/>
</fig>
</sec>
<sec id="s2-2">
<title>2.2 Constraints</title>
<p>To better imitate the connection between the physical reality and simulation model, some constraints should be considered in DT-DPT, including change dynamic due to the rapid regulation of power grid features. During power tracking, the constraints primarily include the regulation direction, power balance, generation capacity, and generation ramp (<xref ref-type="bibr" rid="B24">Yu et al., 2011</xref>), as follows.<list list-type="simple">
<list-item>
<p>1) Regulation direction constraint: To fully utilize the regulation resources, the regulation direction of the resources&#x2019; power command should be equal to the direction of total power command, as follows:</p>
</list-item>
</list>
<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2219;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where <inline-formula id="inf1">
<mml:math id="m2">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the regulation command assigned to the <italic>i</italic>th DT-DPT regulation resource at <italic>k</italic>th control interval and <inline-formula id="inf2">
<mml:math id="m3">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the total regulation command from the power grid to DT-DPT.<list list-type="simple">
<list-item>
<p>2) Power balance constraint: To confirm that the optimal solution satisfies the power grid regulation requirements, the accumulation of power regulation input commands received by all DT-DPT regulation resources should be accurately equivalent to the total power regulation command issued by the power grid, as follows:</p>
</list-item>
</list>
<disp-formula id="e2">
<mml:math id="m4">
<mml:mrow>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>3) Generation capacity constraint: To guarantee that the regulation resource has a good regulation performance and a secure environment, the power regulation commands obtained by the DT-DPT regulation resources should not exceed their capacities, as follows:</p>
</list-item>
</list>
<disp-formula id="e3">
<mml:math id="m5">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where <inline-formula id="inf3">
<mml:math id="m6">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf4">
<mml:math id="m7">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represent the minimum and maximum of the <italic>i</italic>th regulation resource at the <italic>k</italic>th time control interval, respectively.<list list-type="simple">
<list-item>
<p>4) Generation ramp constraint: For the new energy regulation resources, the regulation of these resources can change rapidly due to control by the electrical switch. However, for traditional regulation resources, they should consider the generation ramp constraint, as follows:</p>
</list-item>
</list>
<disp-formula id="e4">
<mml:math id="m8">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>R</mml:mi>
</mml:msubsup>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>T</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>R</mml:mi>
</mml:msubsup>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <inline-formula id="inf5">
<mml:math id="m9">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the output power command received by the <italic>i</italic>th DT-DPT regulation resource from the controller at the <italic>k</italic>th control interval, <inline-formula id="inf6">
<mml:math id="m10">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the regulation time at a control interval, and <inline-formula id="inf7">
<mml:math id="m11">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>R</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum ramp rate of the <italic>i</italic>th regulation resource.</p>
</sec>
<sec id="s2-3">
<title>2.3 Objective functions</title>
<p>As the main focus of this work is the minimum frequency mileage-based (<xref ref-type="bibr" rid="B4">Chen et al., 2015</xref>) compensation of the DT-DPT regulation resources, one optimization goal is to reduce the total compensation payment of the regulation resources for the individual system operator. The regulation compensation payment can be computed by the comprehensive price coefficient and regulation power deviation (<xref ref-type="bibr" rid="B19">Wang et al., 2017</xref>). The comprehensive payment coefficient depends on the ramp performance and time delay of the regulation resources (<xref ref-type="bibr" rid="B1">Ariyo et al., 2014</xref>), as follows:<disp-formula id="e5">
<mml:math id="m12">
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<disp-formula id="e6">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2219;</mml:mo>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m15">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>&#x3bb;</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mi>&#x3bb;</mml:mi>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">d</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="equ1">
<mml:math id="m16">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>R</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
<disp-formula id="equ2">
<mml:math id="m17">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">d</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msubsup>
<mml:mi>/</mml:mi>
<mml:mn>60</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>5</mml:mn>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where <inline-formula id="inf8">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the compensation payment of the <italic>i</italic>th regulation resource, <inline-formula id="inf9">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the comprehensive payment coefficient, <inline-formula id="inf10">
<mml:math id="m20">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the price coefficient of the mileage deviation, <inline-formula id="inf11">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the power tracking mileage at the <italic>k</italic>th time control interval, <inline-formula id="inf12">
<mml:math id="m22">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf13">
<mml:math id="m23">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">d</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> represent the rate performance score and the time delay of the <italic>i</italic>th regulation resource, <inline-formula id="inf14">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf15">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represent the corresponding weight value for the <italic>i</italic>th regulation resource (<inline-formula id="inf16">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>), <inline-formula id="inf17">
<mml:math id="m27">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the average ramp of the <italic>i</italic>th regulation resource, and <inline-formula id="inf18">
<mml:math id="m28">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> denotes the regulation time delay of the <italic>i</italic>th regulation resource.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Design of the distributed DCCA for DT-DPT</title>
<sec id="s3-1">
<title>3.1 Graph theory for the communication network</title>
<p>Since DT-DPT balances the power disturbance, the DCCA can be used to quickly obtain a power scheme. The regulation resources can be seen as nodes or agents; the corresponding communication network framework ids are shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, in which the graph <inline-formula id="inf19">
<mml:math id="m29">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>E</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the communication network, the node set <inline-formula id="inf20">
<mml:math id="m30">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the set of the regulation resources or digital agents, the edges set <inline-formula id="inf21">
<mml:math id="m31">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x2286;</mml:mo>
<mml:mi>V</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the relationship between the two nodes, and the weighted adjacency matrix <inline-formula id="inf22">
<mml:math id="m32">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> denotes the connection weight of the corresponding edge. Then, based on the proposed network setting, a Laplacian matrix <inline-formula id="inf23">
<mml:math id="m33">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> can be acquired, as follows:<disp-formula id="e9">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>The following row stochastic matrix <inline-formula id="inf24">
<mml:math id="m35">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> can be determined by the Laplacian matrix, as follows:<disp-formula id="e10">
<mml:math id="m36">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>DT-DPT communication network.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g002.tif"/>
</fig>
</sec>
<sec id="s3-2">
<title>3.2 DCCA design</title>
<p>Generally, based on the proposed communication network and matrix, DCCA can be formulated by several operations, as follows.<list list-type="simple">
<list-item>
<p>1) <italic>Payment compensation consensus</italic>: Based on the computation of the compensation payment in Eqs. <xref ref-type="disp-formula" rid="e5">5</xref>&#x2013;<xref ref-type="disp-formula" rid="e8">8</xref>, the payment compensation can be updated by the row stochastic matrix, as follows:</p>
</list-item>
</list>
<disp-formula id="e11">
<mml:math id="m37">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>where <inline-formula id="inf25">
<mml:math id="m38">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the aggregation of the other <italic>j</italic>th node to the <italic>i</italic>th node and <inline-formula id="inf26">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the corresponding compensation payment of the <italic>j</italic>th regulation resource at the <italic>t</italic>th optimal iteration.<list list-type="simple">
<list-item>
<p>2) <italic>Updating of the optimal leader</italic>: Firstly, the optimal leader can be updated by incrementing or decrementing the tracking power. Thus, the regulation resource with the highest <inline-formula id="inf27">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> performance is chosen as the optimal leader. Based on the power balance, the optimal leader should track the corresponding power responsible for the last iteration and the current power increment, as follows:</p>
</list-item>
</list>
<disp-formula id="e12">
<mml:math id="m41">
<mml:mrow>
<mml:msubsup>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>q</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m42">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where <inline-formula id="inf28">
<mml:math id="m43">
<mml:mrow>
<mml:msubsup>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>q</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the corresponding compensation payment of the optimal leader at the <italic>t</italic>th optimal iteration, <inline-formula id="inf29">
<mml:math id="m44">
<mml:mrow>
<mml:mi>&#x3bc;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the coefficient of the power tracking error, <inline-formula id="inf30">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the power tracking error at the <italic>t</italic>th optimal iteration, and <inline-formula id="inf31">
<mml:math id="m46">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the total power tracking value at the <italic>k</italic>th time control interval.<list list-type="simple">
<list-item>
<p>3) <italic>Modification of the power scheme</italic>: To ensure that the optimal solution does not violate the power capacity, the regulation resources that disobey the power constraints should be modified to the feasible zone of the solution. The feasible zone of the compensation payment should also be considered, as follows:</p>
</list-item>
</list>
<disp-formula id="e14">
<mml:math id="m47">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
<disp-formula id="e15">
<mml:math id="m48">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>4) <italic>Consensus optimal process</italic>: For the presented computation of leader payment compensation and consensus computation, the power tracking error will decrease to nearly zero after a certain optimal iteration. The optimal process will terminate when the power error is a small value <inline-formula id="inf32">
<mml:math id="m49">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mi mathvariant="bold-italic">&#x3f5;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> or when the current iteration exceeds the maximum iteration <inline-formula id="inf33">
<mml:math id="m50">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. The corresponding optimal power scheme can then be obtained based on the proposed compensation payment consensus.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s3-3">
<title>3.3 Calculation flow</title>
<p>The optimal process of DCCA for DT-DPT is presented in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>xecution of DCCA for DT-DPT.</p>
</caption>
<table>
<tbody valign="top">
<tr>
<td align="left">1: Initial the DCCA parameters</td>
</tr>
<tr>
<td align="left">2: Design the communication network between different regulation resources using Eqs.<xref ref-type="disp-formula" rid="e11">11</xref>, <xref ref-type="disp-formula" rid="e12">12</xref>
</td>
</tr>
<tr>
<td align="left">
<bold>3: FOR1</bold> <italic>i</italic>: &#x3d; 1 to <italic>N</italic>
<sub>s</sub>
</td>
</tr>
<tr>
<td align="left">4: Input the total power tracking command, constraints at the current control interval</td>
</tr>
<tr>
<td align="left">5: While <inline-formula id="inf34">
<mml:math id="m51">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold">e</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mi mathvariant="bold-italic">&#x3f5;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">6: Initialize the power scheme and the compensation payment</td>
</tr>
<tr>
<td align="left">7: Execute the nodes&#x2019; communication and updating using Eqs. <xref ref-type="disp-formula" rid="e13">13</xref>, <xref ref-type="disp-formula" rid="e14">14</xref>
</td>
</tr>
<tr>
<td align="left">8: Calculate the current power error and update the compensation of the optimal leader using Eqs. <xref ref-type="disp-formula" rid="e14">14</xref>, <xref ref-type="disp-formula" rid="e15">15</xref>
</td>
</tr>
<tr>
<td align="left">9: Modify the solution to the feasible zone of power and payment using Eqs. <xref ref-type="disp-formula" rid="e16">16</xref>-(17)</td>
</tr>
<tr>
<td align="left">10: Modify the solution to the feasible zone of ramp performance using Eq. <xref ref-type="disp-formula" rid="e4">4</xref>
</td>
</tr>
<tr>
<td align="left">11: END</td>
</tr>
<tr>
<td align="left">12: END FOR</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4">
<title>4 Case studies</title>
<sec id="s4-1">
<title>4.1 Parameter settings</title>
<sec id="s4-1-1">
<title>4.1.1 DT-DPT system parameters</title>
<p>In the simulation test, a DT-DPT system with ten regulation resources was designed to verify the performance of the proposed algorithm. <xref ref-type="table" rid="T2">Table 2</xref> lists the parameters of the DT-DPT system with five types of regulation resources. <xref ref-type="table" rid="T3">Table 3</xref> lists the parameters of the regulation resources. The control interval period &#x394;<italic>T</italic> was set to 4&#xa0;s, the total time control interval in one service period <italic>N</italic>
<sub>s</sub> was set to 900 (1&#xa0;h), and the mileage coefficient for compensation payment was 2 $/MW.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Main parameters of the dispatch regulation resources in the DT-DPT system.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Regulation resource No</th>
<th align="center">Type</th>
<th align="center">
<italic>T</italic>
<sub>r</sub> (s)</th>
<th align="center">
<inline-formula id="inf35">
<mml:math id="m52">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>R</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> (MW/min)</th>
<th align="center">
<inline-formula id="inf36">
<mml:math id="m53">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> (MW)</th>
<th align="center">
<inline-formula id="inf37">
<mml:math id="m54">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> (MW)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">G<sub>1</sub>
</td>
<td align="center">Coal-fired</td>
<td align="center">50</td>
<td align="center">12</td>
<td align="center">45</td>
<td align="center">&#x2212;40</td>
</tr>
<tr>
<td align="center">G<sub>2</sub>
</td>
<td align="center">Coal-fired</td>
<td align="center">60</td>
<td align="center">16</td>
<td align="center">40</td>
<td align="center">&#x2212;35</td>
</tr>
<tr>
<td align="center">G<sub>3</sub>
</td>
<td align="center">Coal-fired</td>
<td align="center">55</td>
<td align="center">20</td>
<td align="center">40</td>
<td align="center">&#x2212;35</td>
</tr>
<tr>
<td align="center">G<sub>4</sub>
</td>
<td align="center">Coal-fired</td>
<td align="center">55</td>
<td align="center">20</td>
<td align="center">40</td>
<td align="center">&#x2212;35</td>
</tr>
<tr>
<td align="center">G<sub>5</sub>
</td>
<td align="center">LNG</td>
<td align="center">10</td>
<td align="center">15</td>
<td align="center">30</td>
<td align="center">&#x2212;25</td>
</tr>
<tr>
<td align="center">G<sub>6</sub>
</td>
<td align="center">LNG</td>
<td align="center">10</td>
<td align="center">8</td>
<td align="center">30</td>
<td align="center">&#x2212;25</td>
</tr>
<tr>
<td align="center">G<sub>7</sub>
</td>
<td align="center">LNG</td>
<td align="center">10</td>
<td align="center">4</td>
<td align="center">30</td>
<td align="center">&#x2212;25</td>
</tr>
<tr>
<td align="center">G<sub>8</sub>
</td>
<td align="center">Hydro</td>
<td align="center">5</td>
<td align="center">60</td>
<td align="center">25</td>
<td align="center">&#x2212;20</td>
</tr>
<tr>
<td align="center">G<sub>9</sub>
</td>
<td align="center">WF</td>
<td align="center">1</td>
<td align="center">&#x2014;</td>
<td align="center">20</td>
<td align="center">&#x2212;15</td>
</tr>
<tr>
<td align="center">G<sub>10</sub>
</td>
<td align="center">PV</td>
<td align="center">1</td>
<td align="center">&#x2014;</td>
<td align="center">10</td>
<td align="center">&#x2212;5</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Main parameters of the transfer function in the regulation resources.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Regulation resource type</th>
<th align="center">Parameters (s)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Coal-fired</td>
<td align="center">
<italic>T</italic>
<sub>2</sub> &#x3d; 5, <italic>T</italic>
<sub>3</sub> &#x3d; 0.1, <italic>T</italic>
<sub>4</sub> &#x3d; 10, <italic>T</italic>
<sub>5</sub> &#x3d; 0.3</td>
</tr>
<tr>
<td align="center">LNG</td>
<td align="center">
<italic>T</italic>
<sub>2</sub> &#x3d; 2, <italic>T</italic>
<sub>3</sub> &#x3d; 0.05, <italic>T</italic>
<sub>4</sub> &#x3d; 5, <italic>T</italic>
<sub>5</sub> &#x3d; 0.2</td>
</tr>
<tr>
<td align="center">Hydro</td>
<td align="center">
<italic>T</italic>
<sub>6</sub> &#x3d; 1, <italic>T</italic>
<sub>7</sub> &#x3d; 5, <italic>T</italic>
<sub>8</sub> &#x3d; 0.5</td>
</tr>
<tr>
<td align="center">WT, PV</td>
<td align="center">
<italic>T</italic>
<sub>1</sub> &#x3d; 0.01</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To set the DCCA parameters, the termination parameter for optimal process <inline-formula id="inf38">
<mml:math id="m55">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3f5;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> was set to 0.001&#xa0;MW. Three types of connected network topology are shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. The fourth regulation resource was set as the optimal leader, the coefficient of the power tracking error was set to 0.1, and the maximum optimal iteration <inline-formula id="inf39">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> was set to 500. <xref ref-type="fig" rid="F3">Figure 3</xref> shows the three types of topology networks to illustrate the performance of the proposed DCCA. The following section focuses on the proposed local connected network.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Communication network of ten regulation resources for the DT-DPT system. <bold>(A)</bold> Ring network. <bold>(B)</bold> Local connected network. <bold>(C)</bold> Fully connected network.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g003.tif"/>
</fig>
</sec>
</sec>
<sec id="s4-2">
<title>4.2 Statistical tests</title>
<sec id="s4-2-1">
<title>4.2.1 Influence of power command</title>
<p>This section constructed two power commands (<inline-formula id="inf40">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf41">
<mml:math id="m58">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>120</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>) to illustrate the convergence of the DCAA and the consensus process in the DT-DPT system subject to load disturbance. First, the acquired regulation resources power commands were stable after 30 iterations for <inline-formula id="inf42">
<mml:math id="m59">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> (<xref ref-type="fig" rid="F4">Figure 4</xref>). Then, the consensus compensation payment was obtained during the optimal process. Among the ten regulation resources, the fourth regulation resource (leader agents) rapidly increased its power, then reached the maximum power command before decreasing to a stable value. The leader agent showed a similar regulation compensation payment tendency as that for the regulation power command during the optimal process. Besides, <xref ref-type="fig" rid="F5">Figure 5A</xref> shows that the proposed method can help acquire a stable power command in 40 steps. The corresponding compensation payment consensus can also be reached quickly (<xref ref-type="fig" rid="F5">Figure 5B</xref>).</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Local connected network test with a power dispatch command <inline-formula id="inf43">
<mml:math id="m60">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> for the DT-DPT system. <bold>(A)</bold> Optimal power command of the regulation resources. <bold>(B)</bold> Optimal payment consensus process of the regulation resources.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Local connected network test with a power dispatch command <inline-formula id="inf44">
<mml:math id="m61">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>120</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> for the DT-DPT system. <bold>(A)</bold> Optimal power command of regulation resources. <bold>(B)</bold> Optimal payment consensus process of the regulation resources.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g005.tif"/>
</fig>
</sec>
<sec id="s4-2-2">
<title>4.2.2 Influence of the connected network topology</title>
<p>The proposed three topology networks (<xref ref-type="fig" rid="F3">Figure 3</xref>) were used to analyze the influence of various connected agents for DCCA convergence. The networks included the ring, local connected, and fully connected networks. These three networks assist in the optimization of the DCCA in the two power command scenarios (<inline-formula id="inf45">
<mml:math id="m62">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf46">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>120</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>). <xref ref-type="fig" rid="F6">Figure 6</xref> shows that the proposed local connected network can rapidly balance the power error; thus, the local network-assisted DCCA has the optimal performance compared to the other two connected networks. The optimization speed is approximately one time faster than the fully connected network and about two times faster than the ring network (<xref ref-type="fig" rid="F6">Figure 6</xref>). As shown in <xref ref-type="fig" rid="F6">Figure 6A</xref>, the proposed network can acquire a high-quality solution within 18 steps, while the fully connected and ring networks require 35 and 55 iterations, respectively. Moreover, the proposed DCCA with the local connected network can reach high convergence in 15 iterations, compared to 30 and 45 steps for the fully connected-based and ring networks, respectively. Therefore, the proposed local connected methods reduced the communication pressure of digital agents and the convergence performance of the DCCA.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Convergence of the DCAA for different communication networks for DT-DPT systems in two scenarios. <bold>(A)</bold> <inline-formula id="inf47">
<mml:math id="m64">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. <bold>(B)</bold> <inline-formula id="inf48">
<mml:math id="m65">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>120</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g006.tif"/>
</fig>
</sec>
</sec>
<sec id="s4-3">
<title>4.3 Real-time simulations</title>
<sec id="s4-3-1">
<title>4.3.1 Load step disturbance</title>
<p>This section compares the performance of DCCA to a proportional method (PROP) (<xref ref-type="bibr" rid="B14">Papalexopoulos and Andrianesis, 2014</xref>) by constructing two load step disturbances (<inline-formula id="inf49">
<mml:math id="m66">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>80</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf50">
<mml:math id="m67">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>120</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>) shown in <xref ref-type="fig" rid="F7">Figure 7</xref> and <xref ref-type="fig" rid="F8">Figure 8</xref>. The PROP is an engineering application approach that only distributes the power command to the regulation resources according to their regulation power capacities. Although this method can rapidly provide a power scheme, it lacks an optimal technique to improve the economic benefit or the regulation performance for the independent system operator. Generally, the power command for regulation resources obtained by PROP can be formulated as follows:<disp-formula id="e16">
<mml:math id="m68">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2219;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2219;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Dynamic power tracking schemes acquired by the proposed CCA and PROP at <inline-formula id="inf51">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. <bold>(A)</bold> Power tracking curve. <bold>(B)</bold> Regulation resource output curves obtained by the proposed CCA. <bold>(C)</bold> Dynamic power deviation. <bold>(D)</bold> Dynamic ACE. <bold>(E)</bold> Dynamic CPS. <bold>(F)</bold> Dynamic frequency deviation.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g007.tif"/>
</fig>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Dynamic power tracking schemes acquired by the proposed CCA and PROP at <inline-formula id="inf52">
<mml:math id="m70">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. <bold>(A)</bold> Power tracking curve. <bold>(B)</bold> Regulation resource output curves obtained by the proposed CCA. <bold>(C)</bold> Dynamic power deviation. <bold>(D)</bold> Dynamic ACE. <bold>(E)</bold> Dynamic CPS. <bold>(F)</bold> Dynamic frequency deviation.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g008.tif"/>
</fig>
<p>First, the tracking processes of the two approaches for a DT-DPT system at <inline-formula id="inf53">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> are shown in <xref ref-type="fig" rid="F7">Figure 7A</xref>, in whichDCCA shows an optimal power solution with a relatively lower amplitude of power output. Thus, the proposed approach can provide a solution with a higher power tracking performance compared to the proportional technique. <xref ref-type="fig" rid="F7">Figure 7C</xref> further exemplifies the superiority of the proposed DCCA in decreasing the power deviation between the power input command and power output by effectively coordinating the power command of the various regulation resources (<xref ref-type="fig" rid="F7">Figure 7B</xref>). Three indices of dynamic regulation performance; namely, area control error (ACE), CPS, and frequency deviation, are used to depict the real-time power tracking ability of the approach. The DCAA effectively reduced the amplitude of the ACE, CPS1, and frequency deviation curves compared to the traditional PROP (<xref ref-type="fig" rid="F6">Figure 6D&#x2013;F</xref>).</p>
<p>Likewise, the tracking process between the regulation power command and the real-time power output acquired by the two algorithms under a load step disturbance <inline-formula id="inf54">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is given in <xref ref-type="fig" rid="F8">Figure 8A</xref>. During the optimal process obtained by DCCA, the power output of all ten regulation resources increased from zeros to a maximum value (<xref ref-type="fig" rid="F8">Figure 8B</xref>). As shown in <xref ref-type="fig" rid="F8">Figure 8C</xref>, the local connected network-based DCCA method showed a series of power schemes with lower power deviations compared to the proportional-based method. This occurred primarily because the distributed consensus-based approach more effectively coordinated the various regulation resource compared to PROP. <xref ref-type="fig" rid="F8">Figure 8D&#x2013;F</xref> shows that the proposed DCCA provides a higher power tracking performance of dynamic ACE, CPS1, and frequency deviation.</p>
</sec>
<sec id="s4-3-2">
<title>4.3.2 Stochastic load disturbance</title>
<p>To further verify the superiority of the proposed method, a stochastic load disturbance given in <xref ref-type="fig" rid="F9">Figure 9A</xref> is constructed to be executed to the DT-DPT system. Additionally, the CPS and power deviation are used to exemplify the dynamic regulation performance with the local connected network-based DCCA and proportional-based approach. First, <xref ref-type="fig" rid="F9">Figure 9A</xref> shows the real-time power tracking of the two algorithms, in which the lower power tracking power is acquired by the proposed DCCA rather than the PROP. Moreover, the proposed method effectively reduced the power deviation for the DT-DPT system under stochastic load disturbance (<xref ref-type="fig" rid="F9">Figure 9C</xref>). This may be due to the high coordinate ability and real-time regulation performance of the DCCA for the various regulation resources (<xref ref-type="fig" rid="F9">Figure 9B</xref>) while the proportional-based method lacks the optimal mechanism for compensation payment or dynamic regulation. Finally, the dynamic CPS curve is shown in <xref ref-type="fig" rid="F9">Figure 9D</xref>, in which the proposed method helps to reduce CPS decrement, thus demonstrating that the proposed DCCA can acquire a power scheme with a higher regulation performance than the traditional PROP.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Dynamic power tracking scheme acquired by the proposed CCA and PROP for a stochastic power disturbance. <bold>(A)</bold> Power tracking curve. <bold>(B)</bold> Regulation resource output curves obtained by the proposed CCA. <bold>(C)</bold> Dynamic power deviation. <bold>(D)</bold> Dynamic CPS.</p>
</caption>
<graphic xlink:href="fenrg-11-1133516-g009.tif"/>
</fig>
<p>Lastly, the optimal results of online optimization under various disturbance scenarios are shown in <xref ref-type="table" rid="T4">Table 4</xref>. Indexes including the ACE maximum and minimum, frequency deviation, and CPS are used to compare the tracking performance of CCA and PROP. The power deviation of the agent power tracking is represented by the approximate degree between the real-time output and input commands. The results demonstrated that the suggested strategy could significantly minimize power variation while simultaneously improving tracing accuracy. In the ninth simulation experiments of step load disturbances, the suggested approach effectively reduced the power deviation by 21.7%, 10.1%, 9.8%, 7.0%, 7.0%, 11.7%,16.1%, 10.1%, respectively, and improved the CPS scores by 23%, 3.6%, 0.90%, 0.16%, 0.16%, 0.9%, 3.6%, 23.2%, and 4.7%, respectively. Thus, with increased power amplitude, the optimization performance of the algorithm becomes more significant.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Comparisons of dynamic optimization under different disturbances.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">
<inline-formula id="inf55">
<mml:math id="m73">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">D</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> (MW)</th>
<th rowspan="2" align="center">Algorithm</th>
<th colspan="2" align="center">&#x7c;ACE&#x7c; (MW)</th>
<th colspan="2" align="center">
<inline-formula id="inf56">
<mml:math id="m74">
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> (Hz)</th>
<th colspan="2" align="center">CPS1 (%)</th>
<th align="center">Power</th>
</tr>
<tr>
<th align="center">Avg</th>
<th align="center">Max</th>
<th align="center">Avg</th>
<th align="center">Max</th>
<th align="center">Avg</th>
<th align="center">Min</th>
<th align="center">Deviation (MW)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="center">&#x2212;200</td>
<td align="center">CCA</td>
<td align="center">5.544</td>
<td align="center">248.522</td>
<td align="center">1.97E-02</td>
<td align="center">1.52E&#x2b;00</td>
<td align="center">197.322</td>
<td align="center">&#x2212;15.358</td>
<td align="center">3,829.56</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">5.585</td>
<td align="center">251.247</td>
<td align="center">1.98E-02</td>
<td align="center">1.53E&#x2b;00</td>
<td align="center">197.299</td>
<td align="center">&#x2212;19.948</td>
<td align="center">4,892.89</td>
</tr>
<tr>
<td rowspan="2" align="center">&#x2212;150</td>
<td align="center">CCA</td>
<td align="center">4.157</td>
<td align="center">184.925</td>
<td align="center">1.47E-02</td>
<td align="center">1.13E&#x2b;00</td>
<td align="center">198.621</td>
<td align="center">80.305</td>
<td align="center">1771.65</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">4.158</td>
<td align="center">187.257</td>
<td align="center">1.47E-02</td>
<td align="center">1.14E&#x2b;00</td>
<td align="center">198.578</td>
<td align="center">77.527</td>
<td align="center">1971.29</td>
</tr>
<tr>
<td rowspan="2" align="center">&#x2212;100</td>
<td align="center">CCA</td>
<td align="center">2.771</td>
<td align="center">122.241</td>
<td align="center">9.82E-03</td>
<td align="center">7.52E-01</td>
<td align="center">199.436</td>
<td align="center">147.512</td>
<td align="center">860.81</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">2.772</td>
<td align="center">123.914</td>
<td align="center">9.83E-03</td>
<td align="center">7.59E-01</td>
<td align="center">199.412</td>
<td align="center">146.193</td>
<td align="center">954.86</td>
</tr>
<tr>
<td rowspan="2" align="center">&#x2212;50</td>
<td align="center">CCA</td>
<td align="center">1.385</td>
<td align="center">60.685</td>
<td align="center">4.91E-03</td>
<td align="center">3.75E-01</td>
<td align="center">199.863</td>
<td align="center">187.014</td>
<td align="center">400.12</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">1.386</td>
<td align="center">61.470</td>
<td align="center">4.91E-03</td>
<td align="center">3.78E-01</td>
<td align="center">199.859</td>
<td align="center">186.709</td>
<td align="center">430.47</td>
</tr>
<tr>
<td rowspan="2" align="center">50</td>
<td align="center">CCA</td>
<td align="center">&#x2212;1.385</td>
<td align="center">0.001</td>
<td align="center">&#x2212;4.91E-03</td>
<td align="center">5.98E-03</td>
<td align="center">199.863</td>
<td align="center">187.014</td>
<td align="center">400.21</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">&#x2212;1.386</td>
<td align="center">0.022</td>
<td align="center">&#x2212;4.91E-03</td>
<td align="center">7.24E-03</td>
<td align="center">199.859</td>
<td align="center">186.709</td>
<td align="center">430.47</td>
</tr>
<tr>
<td rowspan="2" align="center">100</td>
<td align="center">CCA</td>
<td align="center">&#x2212;2.771</td>
<td align="center">0.003</td>
<td align="center">&#x2212;9.83E-03</td>
<td align="center">1.24E-02</td>
<td align="center">199.437</td>
<td align="center">147.512</td>
<td align="center">843.31</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">&#x2212;2.772</td>
<td align="center">0.111</td>
<td align="center">&#x2212;9.83E-03</td>
<td align="center">1.69E-02</td>
<td align="center">199.412</td>
<td align="center">146.193</td>
<td align="center">954.86</td>
</tr>
<tr>
<td rowspan="2" align="center">150</td>
<td align="center">CCA</td>
<td align="center">&#x2212;4.157</td>
<td align="center">2.084</td>
<td align="center">&#x2212;1.47E-02</td>
<td align="center">5.08E-02</td>
<td align="center">198.641</td>
<td align="center">80.305</td>
<td align="center">1,648.87</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">&#x2212;4.158</td>
<td align="center">7.060</td>
<td align="center">&#x2212;1.47E-02</td>
<td align="center">6.98E-02</td>
<td align="center">198.578</td>
<td align="center">77.527</td>
<td align="center">1964.97</td>
</tr>
<tr>
<td rowspan="2" align="center">200</td>
<td align="center">CCA</td>
<td align="center">&#x2212;5.543</td>
<td align="center">14.454</td>
<td align="center">&#x2212;1.97E-02</td>
<td align="center">1.07E-01</td>
<td align="center">197.391</td>
<td align="center">&#x2212;15.328</td>
<td align="center">3,335.77</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">&#x2212;5.544</td>
<td align="center">16.673</td>
<td align="center">&#x2212;1.97E-02</td>
<td align="center">1.08E-01</td>
<td align="center">197.312</td>
<td align="center">&#x2212;19.948</td>
<td align="center">3,707.58</td>
</tr>
<tr>
<td rowspan="2" align="center">250</td>
<td align="center">CCA</td>
<td align="center">&#x2212;6.930</td>
<td align="center">24.717</td>
<td align="center">&#x2212;2.46E-02</td>
<td align="center">1.31E-01</td>
<td align="center">195.629</td>
<td align="center">&#x2212;139.631</td>
<td align="center">6,172.71</td>
</tr>
<tr>
<td align="center">PROP</td>
<td align="center">&#x2212;6.930</td>
<td align="center">23.499</td>
<td align="center">&#x2212;2.46E-02</td>
<td align="center">1.28E-01</td>
<td align="center">195.581</td>
<td align="center">&#x2212;146.593</td>
<td align="center">6,028.58</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>The three contributions made in this work are as follows.<list list-type="simple">
<list-item>
<p>1) The proposed DT-DPT demonstrated a power tracking process with disturbance collection, controller strategy optimization, regulation resource response, and visualization of dynamic control performance.</p>
</list-item>
<list-item>
<p>2) The proposed local connected network can help accelerate the convergence of the DCCA in the DT-DPT system and reduce the communication pressure between digital agents in power tracking systems.</p>
</list-item>
<list-item>
<p>3) The load disturbance tests of the DT-DPT demonstrated that the proposed DCCA effectively and efficiently provided a high-quality solution for the DT-DPT system. This method effectively increased the CPS sconce, reduced the power and frequency deviations in the power tracking area, and reduced the ACE for the DT-DPT system.</p>
</list-item>
</list>
</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material. Further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>YW, ZG, and YP contributed to the study conception and design. KG and JZ organized the database. YW wrote the first draft of the manuscript. ZG, YP, KG, and JZ wrote sections of the manuscript. All authors contributed to the manuscript revision and read and approved the submitted version.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This work was supported by Research on Digital Twin-based Management and Interaction Technology for Efficient Collaboration of County Energy Internet (5700-202224202A-1-1-ZN).</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ariyo</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Adewumi</surname>
<given-names>A. O.</given-names>
</name>
<name>
<surname>Ayo</surname>
<given-names>C. K.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>&#x201c;Stock price prediction using the arima model,&#x201d;</article-title>. in <conf-name>UKSim-AMSS 16th International Conference on Computer Modelling and Simulation</conf-name>, <publisher-name>IEEE</publisher-name>, <fpage>106</fpage>&#x2013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1109/UKSim.2014</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bidram</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Davoudi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Lewis</surname>
<given-names>F. L.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>&#x201c;Secondary control of microgrids based on distributed cooperative control of multi&#x2010;agent systems,&#x201d;</article-title>. <source>Transm. Distribution</source> <volume>7</volume> (<issue>8</issue>), <fpage>822</fpage>&#x2013;<lpage>831</lpage>. <comment>IET Generation</comment>. <pub-id pub-id-type="doi">10.1049/iet-gtd.2012.0576</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bidram</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Davoudi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Lewis</surname>
<given-names>F. L.</given-names>
</name>
<name>
<surname>Guerrero</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>&#x201c;Distributed cooperative secondary control of microgrids using feedback linearization,&#x201d;</article-title>. <source>IEEE Trans. power Syst.</source> <volume>28</volume> (<issue>3</issue>), <fpage>3462</fpage>&#x2013;<lpage>3470</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2013.2247071</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Leonard</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Keyser</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gardner</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>&#x201c;Development of performance-based two-part regulating reserve compensation on MISO energy and ancillary service market,&#x201d;</article-title>. <source>IEEE Trans. power Syst.</source> <volume>30</volume> (<issue>1</issue>), <fpage>142</fpage>&#x2013;<lpage>155</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2014.2320519</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>&#x201c;Secure multi-party household load scheduling framework for real-time demand-side management,&#x201d;</article-title>. <source>IEEE Trans. Sustain. Energy</source> <volume>14</volume>, <fpage>602</fpage>&#x2013;<lpage>612</lpage>. <pub-id pub-id-type="doi">10.1109/TSTE.2022.3221081</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cui</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X. K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>&#x201c;Distributed auction optimization algorithm for the nonconvex economic dispatch problem based on the gossip communication mechanism,&#x201d;</article-title>. <source>Int. J. Electr. Power and Energy Syst.</source> <volume>95</volume>, <fpage>417</fpage>&#x2013;<lpage>426</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2017.09.012</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Pratap</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Agarwal</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Meyarivan</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>&#x201c;A fast and elitist multiobjective genetic algorithm: NSGA-II,&#x201d;</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>6</volume> (<issue>2</issue>), <fpage>182</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1109/4235.996017</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Doherty</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Mullane</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Nolan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Burke</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Bryson</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>O&#x27;Malley</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>&#x201c;An assessment of the impact of wind generation on system frequency control,&#x201d;</article-title> in <conf-name>IEEE transactions on power systems</conf-name> (<publisher-name>IEEE</publisher-name>), <fpage>452</fpage>&#x2013;<lpage>460</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2009.2030348</pub-id>
<volume>25</volume>
<issue>1</issue>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Erdeljan</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Capko</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Vukmirovic</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Bojanic</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Congradac</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>&#x201c;Distributed PSO algorithm for data model partitioning in power distribution systems,&#x201d;</article-title>. <source>J. Appl. Res. Technol.</source> <volume>12</volume> (<issue>5</issue>), <fpage>947</fpage>&#x2013;<lpage>957</lpage>. <pub-id pub-id-type="doi">10.1016/S1665-6423(14)70601-7</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kakran</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chanana</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>&#x201c;Smart operations of smart grids integrated with distributed generation: A review,&#x201d;</article-title>. <source>Renew. Sustain. Energy Rev.</source> <volume>81</volume>, <fpage>524</fpage>&#x2013;<lpage>535</lpage>. <pub-id pub-id-type="doi">10.1016/j.rser.2017.07.045</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lakshmanan</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Marinelli</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Bindner</surname>
<given-names>H. W.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>&#x201c;Provision of secondary frequency control via demand response activation on thermostatically controlled loads: Solutions and experiences from Denmark,&#x201d;</article-title>. <source>Appl. Energy</source> <volume>173</volume>, <fpage>470</fpage>&#x2013;<lpage>480</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2016.04.054</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>&#x201c;Connecting automatic generation control and economic dispatch from an optimization view,&#x201d;</article-title>. <source>IEEE Trans. Control Netw. Syst.</source> <volume>3</volume> (<issue>3</issue>), <fpage>254</fpage>&#x2013;<lpage>264</lpage>. <pub-id pub-id-type="doi">10.1109/TCNS.2015.2459451</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Dou</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Lei</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Digital twin and its application in power system,&#x201d;</article-title> in <conf-name>2020 5th International Conference on Power and Renewable Energy</conf-name> (<publisher-name>IEEE</publisher-name>), <fpage>21</fpage>&#x2013;<lpage>26</lpage>. <pub-id pub-id-type="doi">10.1109/ICPRE51194.2020.9233278</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Papalexopoulos</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Andrianesis</surname>
<given-names>P. E.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>&#x201c;Performance-based pricing of frequency regulation in electricity markets,&#x201d;</article-title>. <source>IEEE Trans. power Syst.</source> <volume>29</volume> (<issue>1</issue>), <fpage>441</fpage>&#x2013;<lpage>449</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2012.2226918</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ray</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Prasad</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Prasad</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>&#x201c;A new approach to the design of robust load-frequency controller for large scale power systems,&#x201d;</article-title>. <source>Electr. power Syst. Res.</source> <volume>51</volume> (<issue>1</issue>), <fpage>13</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1016/S0378-7796(98)00125-4</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sadeghi-Mobarakeh</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Mohsenian-Rad</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>&#x201c;Optimal bidding in performance-based regulation markets: An MPEC analysis with system dynamics,&#x201d;</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>32</volume> (<issue>2</issue>), <fpage>1282</fpage>&#x2013;<lpage>1292</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2016.2583435</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Schleich</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Anwer</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Mathieu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wartzack</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>&#x201c;Shaping the digital twin for design and production engineering,&#x201d;</article-title>. <source>Cirp Ann. Manuf. Technol.</source> <volume>66</volume> (<issue>1</issue>), <fpage>141</fpage>&#x2013;<lpage>144</lpage>. <pub-id pub-id-type="doi">10.1016/j.cirp.2017.04.040</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ponciroli</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Vilim</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Alfonsi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Rabiti</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>A recursive data-driven approach to state variable selection and digital twin derivation</article-title>,&#x201d; in <conf-name>12th International Topical Meeting on Nuclear Plant Instrumentation, Control and Human Machine Interface Technologies</conf-name>. <pub-id pub-id-type="doi">10.13182/T124-34472</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>&#x201c;Design of performance-based frequency regulation market and its implementations in real-time operation,&#x201d;</article-title>. <source>Int. J. Electr. Power and Energy Syst.</source> <volume>87</volume>, <fpage>187</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2016.10.013</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Hossain</surname>
<given-names>M. F.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>&#x201c;A hierarchical framework for renewable energy sources consumption promotion among microgrids through two-layer electricity prices,&#x201d;</article-title>. <source>Renew. Sustain. Energy Rev.</source> <volume>145</volume>, <fpage>111140</fpage>. <pub-id pub-id-type="doi">10.1016/j.rser.2021.111140</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Uddin</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>&#x201c;A demand response trade model considering cost and benefit allocation game and hydrogen to electricity conversion,&#x201d;</article-title>. <source>IEEE Trans. Industry Appl.</source> <volume>58</volume>, <fpage>2909</fpage>&#x2013;<lpage>2920</lpage>. <pub-id pub-id-type="doi">10.1109/TIA.2021.3088769</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ru</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>&#x201c;Resilience enhancement for urban distribution network via risk-based emergency response plan amendment for ice disasters,&#x201d;</article-title>. <source>Int. J. Electr. Power and Energy Syst.</source> <volume>141</volume>, <fpage>108183</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2022.108183</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Stonham</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Guangyi Liu</surname>
</name>
</person-group> (<year>2000</year>). <article-title>&#x201c;Decomposition model and interior point methods for optimal spot pricing of electricity in deregulation environments,&#x201d;</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>15</volume> (<issue>1</issue>), <fpage>39</fpage>&#x2013;<lpage>50</lpage>. <pub-id pub-id-type="doi">10.1109/59.852099</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ye</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chan</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>&#x201c;Stochastic optimal generation command dispatch based on improved hierarchical reinforcement learning approach,&#x201d;</article-title>. <source>IET Generation, Transm. Distribution</source> <volume>5</volume> (<issue>8</issue>), <fpage>789</fpage>&#x2013;<lpage>797</lpage>. <pub-id pub-id-type="doi">10.1049/iet-gtd.2010.0600</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>&#x201c;Residential load forecasting based on LSTM fusing self-attention mechanism with pooling,&#x201d;</article-title>. <source>Energy</source> <volume>229</volume>, <fpage>120682</fpage>. <pub-id pub-id-type="doi">10.1016/j.energy.2021.120682</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>&#x201c;Consensus transfer Q-learning for decentralized generation command dispatch based on virtual generation tribe,&#x201d;</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>9</volume> (<issue>3</issue>), <fpage>1</fpage>&#x2013;<lpage>2165</lpage>. <pub-id pub-id-type="doi">10.1109/TSG.2016.2607801</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>&#x201c;Adaptive distributed auction-based algorithm for optimal mileage based AGC dispatch with high participation of renewable energy,&#x201d;</article-title>. <source>Int. J. Electr. Power and Energy Syst.</source> <volume>124</volume>, <fpage>106371</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2020.106371</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>&#x201c;Robust collaborative consensus algorithm for decentralized economic dispatch with a practical communication network,&#x201d;</article-title>. <source>Electr. Power Syst. Res.</source> <volume>140</volume>, <fpage>597</fpage>&#x2013;<lpage>610</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2016.05.014</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>&#x201c;An efficient multi-agent negotiation algorithm for multi-period photovoltaic array reconfiguration with a hydrogen energy storage system,&#x201d;</article-title>. <source>Energy Convers. Manag.</source> <volume>256</volume>, <fpage>115376</fpage>. <pub-id pub-id-type="doi">10.1016/j.enconman.2022.115376</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>&#x201c;A cyber-physical-social system with parallel learning for distributed energy management of a microgrid,&#x201d;</article-title>. <source>Energy</source> <volume>165</volume>, <fpage>205</fpage>&#x2013;<lpage>221</lpage>. <pub-id pub-id-type="doi">10.1016/j.energy.2018.09.069</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Bi-objective optimization of real-time AGC dispatch in a performance-based frequency regulation market,&#x201d;</article-title> in <conf-name>CSEE Journal of Power and Energy Systems</conf-name> (<publisher-loc>Beijing, China</publisher-loc>: <publisher-name>CSEE</publisher-name>). <pub-id pub-id-type="doi">10.17775/CSEEJPES.2020.01860</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chow</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>&#x201c;Convergence analysis of the incremental cost consensus algorithm under different communication network topologies in a smart grid,&#x201d;</article-title>. <source>IEEE Trans. power Syst.</source> <volume>27</volume> (<issue>4</issue>), <fpage>1761</fpage>&#x2013;<lpage>1768</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2012.2188912</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>&#x201c;Application status and prospects of digital twin technology in distribution grid,&#x201d;</article-title>. <source>Energy Rep.</source> <volume>8</volume>, <fpage>14170</fpage>&#x2013;<lpage>14182</lpage>. <pub-id pub-id-type="doi">10.1016/j.egyr.2022.10.410</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>&#x201c;Digital twin framework and its application to power grid online analysis,&#x201d;</article-title>. <source>CSEE J. Power Energy Syst.</source> <volume>5</volume> (<issue>3</issue>), <fpage>391</fpage>&#x2013;<lpage>398</lpage>. <pub-id pub-id-type="doi">10.1109/INDUSCON51756.2021.9529839</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>