[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (282)

Search Parameters:
Keywords = ADMM

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 3488 KiB  
Article
Research on the Collaborative Operation of Diversified Energy Storage and Park Clusters: A Method Combining Data Generation and a Distributionally Robust Chance-Constrained Operational Model
by Zhuoya Siqin, Tiantong Qiao, Ruisheng Diao, Xuejie Wang and Guangjun Xu
Electronics 2024, 13(24), 4997; https://doi.org/10.3390/electronics13244997 - 19 Dec 2024
Viewed by 341
Abstract
Energy storage is crucial for enhancing the economic efficiency of integrated energy systems. This paper addresses the need for flexible resources due to high renewable energy integration and the complexity of managing multiple resources. We propose a decentralized collaborative multi-stage distributionally robust scheduling [...] Read more.
Energy storage is crucial for enhancing the economic efficiency of integrated energy systems. This paper addresses the need for flexible resources due to high renewable energy integration and the complexity of managing multiple resources. We propose a decentralized collaborative multi-stage distributionally robust scheduling method for electric-thermal systems, incorporating energy storage to mitigate renewable energy fluctuations. Firstly, we model the electric-thermal system with multiple flexible resources. Uncertain parameters of renewables are estimated using conditional generative adversarial networks (CGANs), assuming empirical probability distributions. Secondly, given the distinct operators of electric and thermal systems and information barriers, we develop a data-driven distributionally robust chance-constrained optimization model (DRCCO). This model ensures decentralized collaboration without compromising information security or fairness. Then, we introduce an Alternating Direction Method of Multipliers (ADMM) algorithm with parallel regularization to decouple the model. This approach facilitates rapid solution finding with minimal information exchange. Finally, numerical examples confirm the model’s effectiveness in enhancing system flexibility and ensuring wind power consumption. Full article
Show Figures

Figure 1

Figure 1
<p>Energy supply framework of the PMES.</p>
Full article ">Figure 2
<p>Basic framework of multi-agent decentralized collaboration.</p>
Full article ">Figure 3
<p>Flow chart for solving a DRCCO model for a park cluster based on CGAN.</p>
Full article ">Figure 4
<p>Algorithm solution flowchart.</p>
Full article ">Figure 5
<p>Trading price of energy and various typical loads.</p>
Full article ">Figure 6
<p>Correlation comparison between real data and generated data.</p>
Full article ">Figure 7
<p>Comparison of cumulative probability distribution between real data and generated data.</p>
Full article ">Figure 8
<p>Charging and discharging scheduling results of multi-energy storage.</p>
Full article ">Figure 9
<p>Power dispatching results in Parks 1–4.</p>
Full article ">Figure 10
<p>Thermal and cold energy dispatch results in Parks 1–4.</p>
Full article ">Figure 11
<p>Operating costs of park systems under different dispatching modes.</p>
Full article ">Figure 12
<p>Convergence process of improving ADMM.</p>
Full article ">
14 pages, 975 KiB  
Article
Distributed Low-Carbon Energy Management of Urban Campus for Renewable Energy Consumption
by Kan Yu, Qiang Wei, Chuanzi Xu, Xinyu Xiang and Heyang Yu
Energies 2024, 17(23), 6182; https://doi.org/10.3390/en17236182 - 8 Dec 2024
Viewed by 470
Abstract
In order to solve the mismatch between renewable energy and load in urban building microgrids, that is, the problem of renewable energy consumption in building microgrid clusters, while preserving the privacy of each user, this paper proposes a distributed low-carbon energy management method [...] Read more.
In order to solve the mismatch between renewable energy and load in urban building microgrids, that is, the problem of renewable energy consumption in building microgrid clusters, while preserving the privacy of each user, this paper proposes a distributed low-carbon energy management method for urban building microgrid clusters. First, a low-carbon energy management method for the urban building microgrid is proposed in order to coordinate the power sharing of various subjects to minimize the total economic cost, unleash the consumption potential of low-carbon building clusters for renewable energy, and reduce carbon emissions on the spatial and time scale. Second, an ADMM-based distributed optimal energy management method is proposed to meet user energy needs while preserving local privacy; this includes energy storage systems, renewable energy generation, and the loads within each urban building microgrid. Finally, simulation experiments are conducted based on actual data from a certain area in Hangzhou, China, and the results verify the effectiveness of the model. Full article
Show Figures

Figure 1

Figure 1
<p>Diagram of building microgrid cluster structure.</p>
Full article ">Figure 2
<p>Typical PV, wind power and load curves of all building microgrids.</p>
Full article ">Figure 3
<p>Carbon emission factor of gas turbines and grid.</p>
Full article ">Figure 4
<p>Power curves of various components in each building microgrid for autonomous energy management (<b>Case 1</b>).</p>
Full article ">Figure 5
<p>Power curves of various components in each building microgrid for unified energy management (<b>Case 2</b>).</p>
Full article ">Figure 6
<p>Iterative process of the algorithm (<b>Case 3</b>).</p>
Full article ">
12 pages, 3814 KiB  
Article
Compressive Sensing of Multichannel Electroencephalogram Signals Based on Nonlocal Low-Rank and Cosparse Priors
by Jun Zhu, Lei Feng and Chunmeng Wang
Math. Comput. Appl. 2024, 29(6), 115; https://doi.org/10.3390/mca29060115 - 6 Dec 2024
Viewed by 399
Abstract
Recent studies have shown that by using channel-correlation and cosparsity in a centralized framework, the accuracy of reconstructing multichannel EEG signals can be improved. A single-channel electroencephalogram (EEG) signal is intrinsically non-sparse in both the converted and raw time domains, which presents a [...] Read more.
Recent studies have shown that by using channel-correlation and cosparsity in a centralized framework, the accuracy of reconstructing multichannel EEG signals can be improved. A single-channel electroencephalogram (EEG) signal is intrinsically non-sparse in both the converted and raw time domains, which presents a number of important issues. However, this is ignored by contemporary compressive sensing (CS) algorithms, resulting in less recovery quality than is ideal. To address these constraints, we provide a novel CS method that takes advantage of Nonlocal Low-Rank and Cosparse priors (NLRC). By utilizing low-rank approximations and block operations, our method aims to improve the CS recovery process and take advantage of channel correlations. The Alternating Direction Method of Multipliers (ADMM) are also used to efficiently solve the resulting non-convex optimization problem. The outcomes of the experiments unequivocally demonstrate that by using NLRC, the quality of signal reconstruction is significantly enhanced. Full article
Show Figures

Figure 1

Figure 1
<p>The group construction for each block. Specifically, for each <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>∈</mo> <msup> <mi>R</mi> <mrow> <mi>d</mi> <mo>⁕</mo> <mn>1</mn> </mrow> </msup> </mrow> </semantics></math>, it searches in its neighborhood for <span class="html-italic">k</span> best matched patches such that each matched patch <math display="inline"><semantics> <msub> <mi>x</mi> <msub> <mi>i</mi> <mi>c</mi> </msub> </msub> </semantics></math> satisfies <math display="inline"><semantics> <mrow> <msub> <mfenced separators="" open="&#x2225;" close="&#x2225;"> <mrow> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>−</mo> <msub> <mi>x</mi> <msub> <mi>i</mi> <mi mathvariant="normal">c</mi> </msub> </msub> </mrow> </mfenced> <mn>2</mn> </msub> <mo>&lt;</mo> <mi>ε</mi> </mrow> </semantics></math>. These matched blocks form the <span class="html-italic">i</span>-th patch group <math display="inline"><semantics> <mrow> <msub> <mi>X</mi> <mi>i</mi> </msub> <mo>∈</mo> <msup> <mi>R</mi> <mrow> <mi>d</mi> <mo>⁕</mo> <mi>k</mi> </mrow> </msup> </mrow> </semantics></math>, which has a low-rank property.</p>
Full article ">Figure 2
<p>The MSE comparison of different methods on the first test data.</p>
Full article ">Figure 3
<p>The MSE comparison of different methods on the second test data.</p>
Full article ">Figure 4
<p>The MCC comparison of different methods on the first test data.</p>
Full article ">Figure 5
<p>The MCC comparison of different methods on the second test data.</p>
Full article ">Figure 6
<p>MSE value vs. <span class="html-italic">q</span> value on the first test data with <math display="inline"><semantics> <mrow> <mi>r</mi> <mi>a</mi> <mi>t</mi> <mi>e</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>MSE vs. <span class="html-italic">p</span> value on the second test data with <math display="inline"><semantics> <mrow> <mi>r</mi> <mi>a</mi> <mi>t</mi> <mi>e</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>q</mi> <mo>=</mo> <mn>0.3</mn> </mrow> </semantics></math>.</p>
Full article ">
19 pages, 2670 KiB  
Article
Distributed Dispatch and Profit Allocation for Parks Using Co-Operative Game Theory and the Generalized Nash Bargaining Approach
by Hanwen Wang, Xiang Li, Haojun Hu and Yizhou Zhou
Energies 2024, 17(23), 6143; https://doi.org/10.3390/en17236143 - 5 Dec 2024
Viewed by 388
Abstract
To improve the regulatory capacity of distributed resources within the park and enhance the flexibility of market transactions, this paper introduces a distributed dispatch and profit allocation method grounded in cooperative game theory and the generalized Nash bargaining framework. Initially, models for individual [...] Read more.
To improve the regulatory capacity of distributed resources within the park and enhance the flexibility of market transactions, this paper introduces a distributed dispatch and profit allocation method grounded in cooperative game theory and the generalized Nash bargaining framework. Initially, models for individual park equipment are established. Subsequently, a distributed dispatch model is constructed, followed by the development of a profit allocation strategy based on contribution levels, using the generalized Nash bargaining method. The model is solved using the alternating direction method of multipliers. The results show that the proposed approach achieves fast convergence, optimizes resource sharing and mutual support within the park, lowers operational costs, ensures a fairer distribution of profits, and promotes increased cooperation among park entities. Full article
(This article belongs to the Section C: Energy Economics and Policy)
Show Figures

Figure 1

Figure 1
<p>Conceptual diagram of the park energy management system.</p>
Full article ">Figure 2
<p>Park market transaction framework.</p>
Full article ">Figure 3
<p>Solution flowchart.</p>
Full article ">Figure 4
<p>Predicted load and PV power of parks.</p>
Full article ">Figure 5
<p>Predicted load power and PV power values: (<b>a</b>) Park 1, (<b>b</b>) Park 2, and (<b>c</b>) Park 3.</p>
Full article ">Figure 6
<p>Energy trading between parks and the market operator across various cases.</p>
Full article ">Figure 7
<p>Results of electric energy interactions among parks.</p>
Full article ">Figure 8
<p>Variation in residuals.</p>
Full article ">Figure 9
<p>Cost variations in park alliances over iterations.</p>
Full article ">Figure 10
<p>Convergence analysis of the model with varying numbers of parks.</p>
Full article ">Figure A1
<p>Variation in residuals.</p>
Full article ">Figure A2
<p>Cost variations in park alliances over iterations.</p>
Full article ">
22 pages, 3483 KiB  
Article
A Flexible Framework for Decentralized Composite Optimization with Compressed Communication
by Zhongyi Chang, Zhen Zhang, Shaofu Yang and Jinde Cao
Fractal Fract. 2024, 8(12), 721; https://doi.org/10.3390/fractalfract8120721 - 5 Dec 2024
Viewed by 488
Abstract
This paper addresses the decentralized composite optimization problem, where a network of agents cooperatively minimize the sum of their local objective functions with non-differentiable terms. We propose a novel communication-efficient decentralized ADMM framework, termed as CE-DADMM, by combining the ADMM framework with the [...] Read more.
This paper addresses the decentralized composite optimization problem, where a network of agents cooperatively minimize the sum of their local objective functions with non-differentiable terms. We propose a novel communication-efficient decentralized ADMM framework, termed as CE-DADMM, by combining the ADMM framework with the three-point compressed (3PC) communication mechanism. This framework not only covers existing mainstream communication-efficient algorithms but also introduces a series of new algorithms. One of the key features of the CE-DADMM framework is its flexibility, allowing it to adapt to different communication and computation needs, balancing communication efficiency and computational overhead. Notably, when employing quasi-Newton updates, CE-DADMM becomes the first communication-efficient second-order algorithm based on compression that can efficiently handle composite optimization problems. Theoretical analysis shows that, even in the presence of compression errors, the proposed algorithm maintains exact linear convergence when the local objective functions are strongly convex. Finally, numerical experiments demonstrate the algorithm’s impressive communication efficiency. Full article
(This article belongs to the Section Optimization, Big Data, and AI/ML)
Show Figures

Figure 1

Figure 1
<p>Distribution of samples across agents for the a9a dataset (<b>left</b>) and ijcnn1 (<b>right</b>).</p>
Full article ">Figure 2
<p>Random communication graph of network with 10 agents.</p>
Full article ">Figure 3
<p>Performance comparison of distributed logistic regression the on a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 4
<p>Performance comparison of distributed logistic regression the on ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 5
<p>Performance comparison of distributed ridge regression on the a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 6
<p>Performance comparison of distributed ridge regression on the ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 7
<p>Performance comparison of distributed LASSO on the a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 8
<p>Performance comparison of distributed LASSO on the ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">
19 pages, 3016 KiB  
Article
Phase-Only Transmit Beampattern Synthesis Method for Cluttered Environments for Airborne Radar
by Jing Shi, Cao Zeng, Lichu Lai and Jiaqi Zhang
Electronics 2024, 13(23), 4766; https://doi.org/10.3390/electronics13234766 - 2 Dec 2024
Viewed by 373
Abstract
In order to solve the problem of strong downward clutter jamming in airborne radar detection, we propose a phase-only transmit beampattern synthesis method. Firstly, with the aim of minimizing the sidelobe gain in the cluttered region, the desired radiation pattern is constructed by [...] Read more.
In order to solve the problem of strong downward clutter jamming in airborne radar detection, we propose a phase-only transmit beampattern synthesis method. Firstly, with the aim of minimizing the sidelobe gain in the cluttered region, the desired radiation pattern is constructed by using terrain environmental information from where the airborne radar operates. Secondly, an optimization model for phase-only transmit beampattern synthesis accounting for four constraints (the mainlobe gain, the sidelobe gain in the highly cluttered region, the sidelobe gain at other angles, and the amplitude of the weight vector) is established. The Alternating Direction Method of Multipliers (ADMM) is then used to find the iterative solution. Based on the results of four sets of simulation examples designed to verify the effectiveness of the proposed method, it is concluded that the method can reduce the echo intensity in the cluttered region and is suitable for a wide range of array configurations. Full article
(This article belongs to the Special Issue Advances in Array Signal Processing for Diverse Applications)
Show Figures

Figure 1

Figure 1
<p>The program flow of the proposed beampattern synthesis method.</p>
Full article ">Figure 2
<p>The relationship between clutter echo power and <math display="inline"><semantics> <mi>θ</mi> </semantics></math> simulated by using the Morchin model: (<b>a</b>) ground clutter; (<b>b</b>) sea clutter.</p>
Full article ">Figure 3
<p>Simulation results of Example 1: (<b>a</b>) evolution curve; (<b>b</b>) amplitude- and phase-weighted results; (<b>c</b>) beampattern synthesis results; (<b>d</b>) unnormalized beampattern synthesis results; (<b>e</b>) echo signal power.</p>
Full article ">Figure 4
<p>Simulation results of Example 2: (<b>a</b>) evolution curve; (<b>b</b>) amplitude- and phase-weighted results; (<b>c</b>) beampattern synthesis results; (<b>d</b>) unnormalized beampattern synthesis results; (<b>e</b>) echo signal power.</p>
Full article ">Figure 5
<p>Simulation results of Example 3: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">Figure 6
<p>Simulation results of Example 4: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">Figure 6 Cont.
<p>Simulation results of Example 4: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">
18 pages, 2075 KiB  
Article
Multiple-Input Multiple-Output Synthetic Aperture Radar Waveform and Filter Design in the Presence of Uncertain Interference Environment
by Ke Xu, Guohao Sun, Yuandong Ji, Zhiquan Ding and Wenhao Chen
Remote Sens. 2024, 16(23), 4413; https://doi.org/10.3390/rs16234413 - 25 Nov 2024
Viewed by 482
Abstract
Multiple-input multiple-output synthetic aperture radar (MIMO-SAR) anti-jamming waveform design relies on accurate prior information about the interference. However, it is difficult to obtain accurate prior knowledge about uncertain intermittent sampling repeater jamming (ISRJ), leading to a severe decline in the detection performance of [...] Read more.
Multiple-input multiple-output synthetic aperture radar (MIMO-SAR) anti-jamming waveform design relies on accurate prior information about the interference. However, it is difficult to obtain accurate prior knowledge about uncertain intermittent sampling repeater jamming (ISRJ), leading to a severe decline in the detection performance of MIMO-SAR systems. Therefore, this article studies the robust joint design problem of MIMO radar transmit waveform and filter against uncertain ISRJ. We characterize two categories of uncertain interference, including sample length uncertainty and sample-time uncertainty, modeled as Gaussian distribution in different range bins. Based on the uncertain interference model, we formulate the maximizing SINR as a figure of merit, which is a non-convex quadratic optimization problem under specific waveform constraints. Based on the alternating direction method of multipliers (ADMM) framework, a novel joint design algorithm of waveform and filter is proposed. In order to improve the convergence performance of ADMM, the difference in convex functions (DC) programming is applied to the ADMM iterations framework to solve the problem of waveform energy inequality constraint. Finally, numerical results demonstrate the effectiveness and robustness of the proposed method, compared to the existing methods that utilize deterministic interference models in the uncertain ISRJ environment. Moreover, the spaceborne SAR real scene imaging simulations are conducted to evaluate the anti-ISRJ performance. Full article
Show Figures

Figure 1

Figure 1
<p>Uncertain store-and-forward schematic. (<b>a</b>) sample-length; (<b>b</b>) sample-time; (<b>c</b>) sample-length and sample-time.</p>
Full article ">Figure 2
<p>Schematic representation of the uncertainty in the location of the source of interference.</p>
Full article ">Figure 3
<p>Iterative output SINR for ISRJ under sample-length uncertainty environment. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 4
<p>Comparison of the robustness of different waveforms under sample−length uncertainty environment. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low−energy waveform design condition.</p>
Full article ">Figure 5
<p>Estimation error of different waveforms regarding DOA localization. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 6
<p>Interference spectra under uncertain sample-length environment. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 7
<p>Iterative output SINR for ISRJ under sample-time uncertainty environment. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 8
<p>Comparison of the robustness of different waveform under sampling time uncertainties. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 9
<p>Estimation error of different waveform regarding DOA localization. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 10
<p>Interference spectra under uncertainty of sample time. (<b>a</b>) unit energy waveform design condition; (<b>b</b>) low-energy waveform design condition.</p>
Full article ">Figure 11
<p>Imaging results in the presence of uncertain ISRJ. (<b>a</b>) image without uncertain ISRJ suppression; (<b>b</b>) image obtained using waveform of the proposed method.</p>
Full article ">Figure 12
<p>Imaging results in the presence of uncertain ISRJ. (<b>a</b>) image without uncertain ISRJ suppression; (<b>b</b>) image obtained using waveform of the proposed method.</p>
Full article ">
26 pages, 2544 KiB  
Article
Two-Stage, Three-Layer Stochastic Robust Model and Solution for Multi-Energy Access System Based on Hybrid Game Theory
by Guodong Wu, Xiaohu Li, Jianhui Wang, Ruixiao Zhang and Guangqing Bao
Processes 2024, 12(12), 2656; https://doi.org/10.3390/pr12122656 - 25 Nov 2024
Viewed by 537
Abstract
This paper proposes a two-stage, three-layer stochastic robust model and its solution method for a multi-energy access system (MEAS) considering different weather scenarios which are described through scenario probabilities and output uncertainties. In the first stage, based on the principle of the master–slave [...] Read more.
This paper proposes a two-stage, three-layer stochastic robust model and its solution method for a multi-energy access system (MEAS) considering different weather scenarios which are described through scenario probabilities and output uncertainties. In the first stage, based on the principle of the master–slave game, the master–slave relationship between the grid dispatch department (GDD) and the MEAS is constructed and the master–slave game transaction mechanism is analyzed. The GDD establishes a stochastic pricing model that takes into account the uncertainty of wind power scenario probabilities. In the second stage, considering the impacts of wind power and photovoltaic scenario probability uncertainties and output uncertainties, a max–max–min three-layer structured stochastic robust model for the MEAS is established and its cooperation model is constructed based on the Nash bargaining principle. A variable alternating iteration algorithm combining Karush–Kuhn–Tucker conditions (KKT) is proposed to solve the stochastic robust model of the MEAS. The alternating direction method of multipliers (ADMM) is used to solve the cooperation model of the MEAS and a particle swarm algorithm (PSO) is employed to solve the non-convex two-stage model. Finally, the effectiveness of the proposed model and method is verified through case studies. Full article
Show Figures

Figure 1

Figure 1
<p>A master–slave framework for trading.</p>
Full article ">Figure 2
<p>Variable exchange process of the dual-layer model.</p>
Full article ">Figure 3
<p>Load curve of MEAS.</p>
Full article ">Figure 4
<p>Comparison of electricity purchase and sale prices at different confidence levels.</p>
Full article ">Figure 5
<p>Electricity purchased and sold at different confidence levels.</p>
Full article ">Figure A1
<p>Solution procedure of the bilayer robust model.</p>
Full article ">Figure A2
<p>Feed-in tariffs and grid tariffs.</p>
Full article ">Figure A3
<p>Ten typical scenarios for WT.</p>
Full article ">Figure A4
<p>Cooperation volume of MEASs.</p>
Full article ">Figure A5
<p>Cooperation price of MEASs.</p>
Full article ">
21 pages, 19996 KiB  
Article
UAV Visual Object Tracking Based on Spatio-Temporal Context
by Yongxiang He, Chuang Chao, Zhao Zhang, Hongwu Guo and Jianjun Ma
Drones 2024, 8(12), 700; https://doi.org/10.3390/drones8120700 - 22 Nov 2024
Viewed by 547
Abstract
To balance the real-time and robustness of UAV visual tracking on a single CPU, this paper proposes an object tracker based on spatio-temporal context (STCT). STCT integrates the correlation filter and Siamese network into a unified framework and introduces the target’s motion model, [...] Read more.
To balance the real-time and robustness of UAV visual tracking on a single CPU, this paper proposes an object tracker based on spatio-temporal context (STCT). STCT integrates the correlation filter and Siamese network into a unified framework and introduces the target’s motion model, enabling the tracker to adapt to target scale variations and effectively address challenges posed by rapid target motion, etc. Furthermore, a spatio-temporal regularization term based on the dynamic attention mechanism is proposed, and it is introduced into the correlation filter to suppress the aberrance of the response map. The filter solution is provided through the alternating direction method of multipliers (ADMM). In addition, to ensure efficiency, this paper proposes the average maximum response value-related energy (AMRE) for adaptive tracking state evaluation, which considers the time context of the tracking process in STCT. Experimental results show that the proposed STCT tracker can achieve a favorable balance between tracking robustness and real-time performance for UAV object tracking while running at ∼38 frames/s on a low-cost CPU. Full article
Show Figures

Figure 1

Figure 1
<p>The algorithmic framework of STCT.</p>
Full article ">Figure 2
<p>The dynamic adjustment process of AMRE.</p>
Full article ">Figure 3
<p>Overall performance of CPU-based trackers on UAV123.</p>
Full article ">Figure 4
<p>Overall performance of CPU-based trackers on UAV20L.</p>
Full article ">Figure 5
<p>Comprehensive evaluation of the performance and speed.</p>
Full article ">Figure 6
<p>Visualization results of the real-time trackers.</p>
Full article ">Figure 7
<p>The testing success rate of each attribute on UAV123.</p>
Full article ">Figure 8
<p>The testing precision of each attribute on UAV123.</p>
Full article ">Figure 9
<p>The testing success rate of each attribute on UAV20L.</p>
Full article ">Figure 10
<p>The testing precision of each attribute on UAV20L.</p>
Full article ">Figure 11
<p>Attribute evaluation of real-time trackers.</p>
Full article ">
27 pages, 7784 KiB  
Article
Nash Bargaining-Based Coordinated Frequency-Constrained Dispatch for Distribution Networks and Microgrids
by Ziming Zhou, Zihao Wang, Yanan Zhang and Xiaoxue Wang
Energies 2024, 17(22), 5661; https://doi.org/10.3390/en17225661 - 13 Nov 2024
Viewed by 468
Abstract
As the penetration of distributed renewable energy continues to increase in distribution networks, the traditional scheduling model that the inertia and primary frequency support of distribution networks are completely dependent on the transmission grid will place enormous regulatory pressure on the transmission grid [...] Read more.
As the penetration of distributed renewable energy continues to increase in distribution networks, the traditional scheduling model that the inertia and primary frequency support of distribution networks are completely dependent on the transmission grid will place enormous regulatory pressure on the transmission grid and hinder the active regulation capabilities of distribution networks. To address this issue, this paper proposes a coordinated optimization method for distribution networks and microgrid clusters considering frequency constraints. First, the confidence interval of disturbances was determined based on historical forecast deviation data. On this basis, a second-order cone programming model for distribution networks with embedded frequency security constraints was established. Then, microgrids performed economic dispatch considering the reserves requirement to provide inertia and primary frequency support, and a stochastic optimization model with conditional value-at-risk was built to address uncertainties. Finally, a cooperative game between the distribution network and microgrid clusters was established, determining the reserve capacity provided by each microgrid and the corresponding prices through Nash bargaining. The model was further transformed into two sub-problems, which were solved in a distributed manner using the ADMM algorithm. The effectiveness of the proposed method in enhancing the operational security and economic efficiency of the distribution networks is validated through simulation analysis. Full article
Show Figures

Figure 1

Figure 1
<p>Interaction structure diagram.</p>
Full article ">Figure 2
<p>Equivalent system frequency response model control block diagram.</p>
Full article ">Figure 3
<p>Mathematical model for coordination between distribution networks and microgrids.</p>
Full article ">Figure 4
<p>IEEE 33-bus test case structure.</p>
Full article ">Figure 5
<p>The selling price of electricity from the distribution network.</p>
Full article ">Figure 6
<p>Primal residual and dual residual of Problem 1.</p>
Full article ">Figure 7
<p>Primal residual and dual residual of Problem 2.</p>
Full article ">Figure 8
<p>PV and wind power generation.</p>
Full article ">Figure 9
<p>Power balance results of the electric, thermal, and cooling loads in Microgrid 1.</p>
Full article ">Figure 9 Cont.
<p>Power balance results of the electric, thermal, and cooling loads in Microgrid 1.</p>
Full article ">Figure 10
<p>Charging and discharging results of the energy storage system in Microgrid 1.</p>
Full article ">Figure 11
<p>Frequency response results of the distribution network.</p>
Full article ">Figure 12
<p>Frequency response coefficient ratio.</p>
Full article ">Figure 13
<p>Reserve for each period.</p>
Full article ">Figure 14
<p>Node Voltage of the Distribution Network at Each Time Period.</p>
Full article ">Figure 15
<p>Frequency response process.</p>
Full article ">Figure 16
<p>Frequency response results for each period.</p>
Full article ">Figure 16 Cont.
<p>Frequency response results for each period.</p>
Full article ">Figure 17
<p>SOC of energy storage.</p>
Full article ">Figure 18
<p>Negotiated reserve capacity prices.</p>
Full article ">
18 pages, 4220 KiB  
Article
Coordinated Optimal Operation Method for Snow-Shaped Distribution Networks Based on Game Theory
by Zhe Wang, Zhang Zhang, Fengzhang Luo, Ranfeng Mu, Xuan Wu, Xuefei Zhang and Jiali Duan
Energies 2024, 17(21), 5470; https://doi.org/10.3390/en17215470 - 31 Oct 2024
Viewed by 525
Abstract
The snow-shaped distribution network is developed and upgraded from the traditional single-loop network and double-loop network structure. It is composed of three or four groups of single-loop networks in pairs that form a feeder cluster in the form of a ring network. Based [...] Read more.
The snow-shaped distribution network is developed and upgraded from the traditional single-loop network and double-loop network structure. It is composed of three or four groups of single-loop networks in pairs that form a feeder cluster in the form of a ring network. Based on this topology, the coordinated optimization operation problem is studied. First, the game elements are analyzed, and then a cooperative game-based, coordinated optimization operation model is established by taking the minimum network loss and voltage deviation of the system as the utility function. Then, the alternating direction multiplier method (ADMM) is employed in Cplex solver to solve the established optimization model. Finally, a numerical case is given to verify the effectiveness of the proposed model and method. The results show that, by using the complementary difference relationship of source–charge characteristics between different regions in the snow-shaped distribution networks, the cooperative game model can realize the energy interconnection among different regions to improve the operation level. Full article
(This article belongs to the Section F1: Electrical Power System)
Show Figures

Figure 1

Figure 1
<p>Evolution of the structure of the three-station, three-group, single-loop network to the snow-shaped distribution network.</p>
Full article ">Figure 2
<p>Simplified diagram of the basic units of the three-station (<b>left</b>) and four-station (<b>right</b>) snow-shaped distribution networks.</p>
Full article ">Figure 3
<p>Cooperative game model diagram.</p>
Full article ">Figure 4
<p>Flowchart for solving the game optimization model of a snow-shaped distribution network.</p>
Full article ">Figure 5
<p>Structural diagram of the three-station snow-shaped distribution network.</p>
Full article ">Figure 6
<p>Example of a network structure diagram.</p>
Full article ">Figure 7
<p>Load fluctuation curves of various industries.</p>
Full article ">Figure 8
<p>Total load curve of region 1.</p>
Full article ">Figure 9
<p>Total load curve of region 2.</p>
Full article ">Figure 10
<p>Photovoltaic output curve.</p>
Full article ">Figure 11
<p>Output curve of wind power.</p>
Full article ">Figure 12
<p>Voltage fluctuation curves of at node 50 in the different scenarios.</p>
Full article ">
31 pages, 32500 KiB  
Article
ILN-SSR: Improved Logarithmic Norm and Sparse Structure Refinement for Infrared Small Target Detection
by Liqi Liu, Rongguo Zhang, Jian Mei, Xinyue Ni, Liyuan Li, Xiaofeng Su and Fansheng Chen
Remote Sens. 2024, 16(21), 4018; https://doi.org/10.3390/rs16214018 - 29 Oct 2024
Viewed by 579
Abstract
The effective discrimination of targets from backgrounds in environments characterized by a low signal-to-clutter ratio (SCR) is paramount for the advancement of infrared small target detection (IRSTD). In this work, we propose a novel detection framework predicated on low-rank sparse decomposition (LRSD), incorporating [...] Read more.
The effective discrimination of targets from backgrounds in environments characterized by a low signal-to-clutter ratio (SCR) is paramount for the advancement of infrared small target detection (IRSTD). In this work, we propose a novel detection framework predicated on low-rank sparse decomposition (LRSD), incorporating an improved logarithmic norm and a mechanism for sparse structure refinement, herein referred to as the improved logarithmic norm and sparse structure refinement (ILN-SSR). The ILN-SSR framework more precisely characterizes the sparse properties of both the background and the target, enabling a more effective distinction between the target and its background. Initially, our approach entails the utilization of an improved logarithmic norm to precisely estimate the low-rank attributes of the infrared image background. This is followed by the employment of a linear sparse regularization term alongside a target-traits-based sparse regularization term aimed at meticulously identifying targets within sparse regions and refining the sparse structure. Subsequently, we combine these components into the ILN-SSR framework, which formulates IRSTD as an optimization problem. The resolution of this framework is achieved through the implementation of the alternating direction method of multipliers (ADMM). The efficacy of the proposed framework is corroborated through the analysis of six image sequences. Comprehensive experimental assessments affirmed the framework’s substantial robustness in navigating various complex backgrounds. Full article
Show Figures

Figure 1

Figure 1
<p>The conceptual diagram of the proposed framework. (<b>a</b>) illustrates the process of transforming the original image into a patch tensor. (<b>b</b>–<b>g</b>) succinctly summarize the innovations presented in this paper, encompassing the improved logarithmic norm and sparse structure refinement. (<b>h</b>,<b>i</b>) signifies the output of the detection results.</p>
Full article ">Figure 2
<p>(<b>a</b>) Construction of a corresponding tensor from original image, where <math display="inline"><semantics> <msub> <mi>n</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>n</mi> <mn>2</mn> </msub> </semantics></math> correspond to the width and height of the constructed image. (<b>b</b>) Stack tensors in chronological order.</p>
Full article ">Figure 3
<p>Analysis of low-rank properties. (<b>b</b>–<b>d</b>) are the singular value trends of the patches in (<b>a</b>); (<b>f</b>–<b>h</b>) are the singular value trends of the patches in (<b>e</b>); (<b>i</b>,<b>j</b>) correspond to the global singular value trends of images (<b>a</b>,<b>e</b>), respectively.</p>
Full article ">Figure 4
<p>Formation of kernel <math display="inline"><semantics> <mi mathvariant="script">K</mi> </semantics></math>, where (<b>a1</b>,<b>b1</b>) represents the IR image with highlighted targets, (<b>a2</b>,<b>b2</b>) is extracted target 5 × 5 neighborhood, and (<b>a3</b>,<b>b3</b>) are the generated result, <math display="inline"><semantics> <mi mathvariant="script">K</mi> </semantics></math>.</p>
Full article ">Figure 5
<p>Overview of the ILN-SSR framework.</p>
Full article ">Figure 6
<p>Images and 3-D surface diagrams of six sequences: (<b>a1</b>–<b>f1</b>) display infrared images from Seq.1 to Seq.6, with targets highlighted by red boxes and enlarged in the image corners, and (<b>a2</b>–<b>f2</b>) depict the corresponding 3-D surface mesh diagrams for each sequence.</p>
Full article ">Figure 7
<p>The neighboring background area of target.</p>
Full article ">Figure 8
<p>ROC curves for different parameters are displayed as follows: the first row for patch size results across three datasets, the second for adjacent frames, and the third and fourth for penalty and balance factors. Panels (<b>a1</b>–<b>a4</b>,<b>b1</b>–<b>b4</b>,<b>c1</b>–<b>c4</b>) correspond to each dataset’s results, respectively.</p>
Full article ">Figure 9
<p>In analyzing Seq.1–Seq.6, targets are indicated with red boxes and magnified in corners, while yellow boxes mark undetected targets. Rows 1 to 6 correspond to the six sequences, and columns (<b>a1</b>–<b>a6</b>,<b>b1</b>–<b>b6</b>,<b>c1</b>–<b>c6</b>,<b>d1</b>–<b>d6</b>,<b>e1</b>–<b>e6</b>,<b>f1</b>–<b>f6</b>,<b>g1</b>–<b>g6</b>,<b>h1</b>–<b>h6</b>,<b>i1</b>–<b>i6</b>,<b>j1</b>–<b>j6</b>) denote different detection methods.</p>
Full article ">Figure 10
<p>Comparing the intuitive 3D qualitative results for Seq.1–Seq.6, with image annotations corresponding to <a href="#remotesensing-16-04018-f009" class="html-fig">Figure 9</a>.</p>
Full article ">Figure 11
<p>ROC curves achieved by different methods, (<b>a</b>–<b>f</b>) corresponding to Seq.1–Seq.6.</p>
Full article ">
27 pages, 5195 KiB  
Article
A Three-Block Inexact Heterogeneous Alternating Direction Method of Multipliers for Elliptic PDE-Constrained Optimization Problems with a Control Gradient Penalty Term
by Xiaotong Chen, Tongtong Wang and Xiaoliang Song
Axioms 2024, 13(11), 744; https://doi.org/10.3390/axioms13110744 - 29 Oct 2024
Viewed by 566
Abstract
Optimization problems with PDE constraints are widely used in engineering and technical fields. In some practical applications, it is necessary to smooth the control variables and suppress their large fluctuations, especially at the boundary. Therefore, we propose an elliptic PDE-constrained optimization model with [...] Read more.
Optimization problems with PDE constraints are widely used in engineering and technical fields. In some practical applications, it is necessary to smooth the control variables and suppress their large fluctuations, especially at the boundary. Therefore, we propose an elliptic PDE-constrained optimization model with a control gradient penalty term. However, introducing this penalty term increases the complexity and difficulty of the problems. To solve the problems numerically, we adopt the strategy of “First discretize, then optimize”. First, the finite element method is employed to discretize the optimization problems. Then, a heterogeneous strategy is introduced to formulate the augmented Lagrangian function for the subproblems. Subsequently, we propose a three-block inexact heterogeneous alternating direction method of multipliers (three-block ihADMM). Theoretically, we provide a global convergence analysis of the three-block ihADMM algorithm and discuss the iteration complexity results. Numerical results are provided to demonstrate the efficiency of the proposed algorithm. Full article
Show Figures

Figure 1

Figure 1
<p>The numerical optimal control, <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math>, with different values of parameter <math display="inline"><semantics> <mi>β</mi> </semantics></math> for Example 1. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>3</mn> <mi>e</mi> <mo>−</mo> <mn>5</mn> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mn>3</mn> <mo>×</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>4</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>1</mn> <mo>×</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>2</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>The numerical optimal control, <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math>, with different values of parameter <math display="inline"><semantics> <mi>β</mi> </semantics></math> for Example 2. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>8</mn> <mo>×</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>8</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>8</mn> <mo>×</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>7</mn> </mrow> </msup> </mrow> </semantics></math>. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>u</mi> <mi>h</mi> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>1</mn> <mo>×</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">
19 pages, 5557 KiB  
Article
Microwave Coincidence Imaging with Phase-Coded Stochastic Radiation Field
by Hang Lin, Hongyan Liu, Yongqiang Cheng, Ke Xu, Kang Liu and Yang Yang
Remote Sens. 2024, 16(20), 3851; https://doi.org/10.3390/rs16203851 - 16 Oct 2024
Viewed by 849
Abstract
Microwave coincidence imaging (MCI) represents a novel forward-looking radar imaging method with high-resolution capabilities. Most MCI methods rely on random frequency modulation to generate stochastic radiation fields, which introduces the complexity of radar systems and imposes limitations on imaging quality under noisy conditions. [...] Read more.
Microwave coincidence imaging (MCI) represents a novel forward-looking radar imaging method with high-resolution capabilities. Most MCI methods rely on random frequency modulation to generate stochastic radiation fields, which introduces the complexity of radar systems and imposes limitations on imaging quality under noisy conditions. In this paper, microwave coincidence imaging with phase-coded stochastic radiation fields is proposed, which generates spatio-temporally uncorrelated stochastic radiation fields with phase coding. Firstly, the radiation field characteristics are analyzed, and the coding sequences are designed. Then, pulse compression is applied to achieve a one-dimensional range image. Furthermore, an azimuthal imaging model is built, and a reference matrix is derived from the frequency domain. Finally, sparse Bayesian learning (SBL) and alternating direction method of multipliers (ADMM)-based total variation are implemented to reconstruct targets. The methods have better imaging performance at low signal-to-noise ratios (SNRs), as shown by the imaging results and mean square error (MSE) curves. In addition, compared with the SBL and ADMM-based total variation methods based on the direct frequency-domain solution, the proposed method’s computational complexity is reduced, giving it great potential in forward-looking high-resolution scenarios, such as autonomous obstacle avoidance with vehicle-mounted radar and terminal guidance. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Principle of radar coincidence imaging.</p>
Full article ">Figure 2
<p>Wavefront undulations of different bandwidths at the same moment. (<b>a</b>) B = 200 MHz. (<b>b</b>) B = 400 MHz. (<b>c</b>) B = 600 MHz. (<b>d</b>) B = 800 MHz.</p>
Full article ">Figure 3
<p>Effective-rank change curves for different influencing factors. (<b>a</b>) Effective-rank change curves at different bandwidths. (<b>b</b>) Effective-rank change curves with different array spacings and numbers of codes.</p>
Full article ">Figure 4
<p>Radiation field distribution of chaotic sequences generating cyclic codes.</p>
Full article ">Figure 5
<p>Variation in the effective rank corresponding to random codes and chaotic sequences for different imaging times. (<b>a</b>) B = 600 MHz. (<b>b</b>) B = 800 MHz.</p>
Full article ">Figure 6
<p>Aircraft point targets.</p>
Full article ">Figure 7
<p>SBL imaging results. (<b>a</b>) FM results at 0 dB. (<b>b</b>) FM results at 5 dB. (<b>c</b>) AziPM results at 0 dB. (<b>d</b>) AziPM results at 5 dB.</p>
Full article ">Figure 8
<p>Azimuthal dimensional slices at 0 dB. (<b>a</b>) FM method. (<b>b</b>) AziPM method.</p>
Full article ">Figure 9
<p>MSE curves of FM and AziPM methods with different modulation counts: (<b>a</b>) 16 modulations, (<b>b</b>) 48 modulations, (<b>c</b>) 64 modulations, (<b>d</b>) 96 modulations.</p>
Full article ">Figure 9 Cont.
<p>MSE curves of FM and AziPM methods with different modulation counts: (<b>a</b>) 16 modulations, (<b>b</b>) 48 modulations, (<b>c</b>) 64 modulations, (<b>d</b>) 96 modulations.</p>
Full article ">Figure 10
<p>Imaging results with different codes at 0 dB. (<b>a</b>) Cyclic code. (<b>b</b>) Random code.</p>
Full article ">Figure 11
<p>MSE curves of cyclic code and random code methods.</p>
Full article ">Figure 12
<p>Imaging results for different targets. (<b>a</b>–<b>c</b>) Targets. (<b>d</b>–<b>f</b>) Imaging results at 0 dB. (<b>g</b>–<b>i</b>) Imaging results at 5 dB.</p>
Full article ">Figure 13
<p>ADMM total variation imaging results. (<b>a</b>,<b>c</b>,<b>e</b>) Imaging results at 0 dB. (<b>b</b>,<b>d</b>,<b>f</b>) Imaging results at 5 dB.</p>
Full article ">Figure 14
<p>MSE curves for different methods.</p>
Full article ">Figure 15
<p>Comparison of runtimes of different methods.</p>
Full article ">
5 pages, 790 KiB  
Proceeding Paper
Monolithic and Decomposition Methods for Optimal Scheduling of Dynamically Adaptive Water Networks
by Bradley Jenks, Aly-Joy Ulusoy and Ivan Stoianov
Eng. Proc. 2024, 69(1), 191; https://doi.org/10.3390/engproc2024069191 - 14 Oct 2024
Viewed by 319
Abstract
This paper presents an optimal scheduling problem for coordinating pressure and self-cleaning operations in dynamically adaptive water networks. Our problem imposes a set of time-coupling constraints to manage pressure variations during the transition between operational modes. Solving this time-coupled, nonlinear optimization problem poses [...] Read more.
This paper presents an optimal scheduling problem for coordinating pressure and self-cleaning operations in dynamically adaptive water networks. Our problem imposes a set of time-coupling constraints to manage pressure variations during the transition between operational modes. Solving this time-coupled, nonlinear optimization problem poses challenges for off-the-shelf nonlinear solvers due to its high memory demands. We compare the performance of a decomposition method using the alternating direction method of multipliers (ADMM) with a gradient-based sequential convex programming (SCP) monolithic solver. Solution quality and computational efficiency are evaluated using a model of a large-scale network in the UK. Full article
Show Figures

Figure 1

Figure 1
<p>BWFLnet layout and control actuator placement.</p>
Full article ">Figure 2
<p>(<b>a</b>) AZP and (<b>b</b>) SCC objectives values across scheduling horizon <math display="inline"><semantics> <mi mathvariant="script">T</mi> </semantics></math>; (<b>c</b>) distribution of nodal pressure range for each experiment.</p>
Full article ">
Back to TopTop