Search Results (127)

In the context of achieving low-carbon goals, building low-carbon energy systems is a crucial development direction and implementation pathway. Renewable energy is favored because of its clean characteristics, but the access may have an impact on the power grid. Microgrid technology provides an effective solution to this problem. Uncertainty exists in single microgrids, so multiple microgrids are introduced to improve system stability and robustness. Electric carbon trading and profit redistribution among multiple microgrids have been challenges. To promote energy commensurability among microgrids, expand the types of energy interactions, and improve the utilization rate of renewable energy, this paper proposes a cooperative operation optimization model of multi-microgrids based on the green certificate and carbon trading mechanism to promote local energy consumption and a low carbon economy. First, this paper introduces a carbon capture system (CCS) and power-to-gas (P2G) device in the microgrid and constructs a cogeneration operation model coupled with a power-to-gas carbon capture system. On this basis, a low-carbon operation model for multi-energy microgrids is proposed by combining the local carbon trading market, the stepped carbon trading mechanism, and the green certificate trading mechanism. Secondly, this paper establishes a cooperative game model for multiple microgrid electricity carbon trading based on the Nash negotiation theory after constructing the single microgrid model. Finally, the ADMM method and the asymmetric energy mapping contribution function are used for the solution. The case study uses a typical 24 h period as an example for the calculation. Case study analysis shows that, compared with the independent operation mode of microgrids, the total benefits of the entire system increased by 38,296.1 yuan and carbon emissions were reduced by 30,535 kg through the coordinated operation of electricity–carbon coupling. The arithmetic example verifies that the method proposed in this paper can effectively improve the economic benefits of each microgrid and reduce carbon emissions. Full article

With the widespread application of combined heat and power (CHP) units, the coupling between electricity and heat systems has become increasingly close. In response to the problem of low operational efficiency of electricity–heat integrated energy systems (EH-IESs) with buildings in uncertain environments, this paper proposes a chance-constrained programming (CCP)-based decentralized optimization method for EH-IESs with buildings. First, based on the thermal storage capacity of building envelopes and considering the operational constraints of an electrical system (ES) and thermal system (TS), a mathematical model of EH-IESs, accounting for building thermal inertia, was constructed. Considering the uncertainty of sunlight intensity and outdoor temperature, a CCP-based optimal scheduling strategy for EH-IESs is proposed to achieve a moderate trade-off between the optimal objective function and constraints. To address the disadvantages of high computational complexity and poor information privacy in centralized optimization, an accelerated asynchronous decentralized alternating direction method of multipliers (A-AD-ADMM) algorithm is proposed, which decomposes the original optimization problem into sub-problems of ES and TS for distributed solving, significantly improving solution efficiency. Finally, numerical simulations prove that the proposed strategy can fully utilize the thermal storage characteristics of building envelopes, improve the operational economics of the EH-IES under uncertain environments, and ensure both user temperature comfort and the information privacy of each subject. Full article

Multi-view data improve the effectiveness of clustering tasks, but they often encounter complex noise and corruption. The missing view of the multi-view samples leads to serious degradation of the clustering model’s performance. Current multi-view clustering methods always try to compensate for the missing information in the original domain, which is limited by the linear representation function. Even more, their clustering structures across views are not sufficiently considered, which leads to suboptimal results. To solve these problems, a tensioned multi-view subspace clustering algorithm is proposed based on sequential kernels to integrate complementary information in multi-source heterogeneous data. By superimposing the kernel matrix based on the sequential characteristics onto the third-order tensor, the robust low-rank representation for the missing is reconstructed by the matrix calculation of sequential kernel learning. Moreover, the tensor structure helps subspace learning to mine the high-order associations between different views. Tensioned Multi-view Ordered Kernel Subspace Clustering (TMOKSC) implements the ADMM framework. Compared with current representative multi-view clustering algorithms, the proposed TMOKSC algorithm is the best in many objective measures. In general, the robust sequential kernel represents the tensor fusion potential subspace structure. Full article

In distribution networks, energy storage serves as a crucial means to mitigate power fluctuations from renewable energy sources. However, due to its high cost, energy storage remains a resource whose large-scale adoption in power systems faces significant challenges. In recent years, the emergence of shared energy storage business models has provided new opportunities for the efficient operation of multi-distribution networks. Nevertheless, distribution network operators and shared energy storage operators belong to different stakeholders, and traditional centralized scheduling strategies suffer from issues such as privacy leakage and overly conservative decision-making. To address these challenges, this paper proposes a Nash bargaining game-based optimal energy management and trading strategy for multi-distribution networks with shared energy storage. First, we establish optimal scheduling models for active distribution networks (ADNs) and shared energy storage operators, respectively, and then develop a cooperative scheduling model aimed at maximizing collaborative benefits. The interactive variables—power exchange and electricity prices between distribution networks and shared energy storage operators—are iteratively solved using the Alternating Direction Method of Multipliers (ADMM). Finally, case studies based on modified IEEE-33 test systems validate the effectiveness and feasibility of the proposed method. The results demonstrate that the presented approach significantly outperforms conventional centralized optimization and distributed robust techniques, achieving a maximum improvement of 3.6% in renewable energy utilization efficiency and an 11.2% reduction in operational expenses. While maintaining computational performance on par with centralized methods, it effectively addresses data privacy concerns. Furthermore, the proposed strategy enables a substantial decrease in load curtailment, with reductions reaching as high as 63.7%. Full article

Under carbon emission constraints, to promote low-carbon transformation and achieve the aim of carbon peaking and carbon neutrality in the energy sector, this paper constructs an operational optimization model for the coordinated operation of a virtual power plant cluster (VPPC). Considering the resource characteristics of different virtual power plants (VPPs) within a cooperative alliance, we propose a multi-VPP interaction and sharing architecture accounting for electricity–carbon interaction. An optimization model for VPPC is developed based on the asymmetric Nash bargaining theory. Finally, the proposed model is solved using an alternating-direction method of multipliers (ADMM) algorithm featuring an improved penalty factor. The research results show that P2P trading within the VPPC achieves resource optimization and allocation at a larger scale. The proposed distributed ADMM solution algorithm requires only the exchange of traded electricity volume and price among VPPs, thus preserving user privacy. Compared with independent operation, the total operation cost of the VPPC is reduced by 20.37%, and the overall proportion of new energy consumption is increased by 16.83%. The operation costs of the three VPPs are reduced by 1.12%, 20.51%, and 6.42%, respectively, while their carbon emissions are decreased by 4.47%, 5.80%, and 5.47%, respectively. In addition, the bargaining index incorporated in the proposed (point-to-point) P2P trading mechanism motivates each VPP to enhance its contribution to the alliance to achieve higher bargaining power, thereby improving the resource allocation efficiency of the entire alliance. The ADMM algorithm based on the improved penalty factor demonstrates good computational performance and achieves a solution speed increase of 15.8% compared to the unimproved version. Full article

As an essential platform for aggregating and coordinating distributed energy resources (DERs), the virtual power plant (VPP) has attracted widespread attention in recent years. With the increasing scale of VPPs, energy interaction and sharing among VPP clusters (VPPCs) have become key approaches to improving energy utilization efficiency and reducing operational costs. Therefore, studying the coordinated operation mechanism of VPPCs is of great significance. This paper proposes a two-stage coordinated operation model for VPPCs based on energy interaction to enhance the overall economic performance and coordination of the cluster. In the day-ahead stage, a cooperative operation model based on Nash bargaining theory is constructed. The inherently non-convex and nonlinear problem is decomposed into a cluster-level benefit maximization subproblem and a benefit allocation subproblem. The Alternating Direction Method of Multipliers (ADMM) is employed to achieve distributed optimization, ensuring both the efficiency of coordination and the privacy and decision independence of each VPP. In the intra-day stage, to address the uncertainty in renewable generation and load demand, a real-time pricing mechanism based on the supply–demand ratio is designed. Each VPP performs short-term energy forecasting and submits real-time supply–demand information to the coordination center, which dynamically determines the price for the next trading interval according to the reported imbalance. This pricing mechanism facilitates real-time electricity sharing among VPPs. Finally, numerical case studies validate the effectiveness and practical value of the proposed model in improving both operational efficiency and fairness. Full article

The increasing integration of distributed photovoltaics (PVs) has intensified voltage violations in active distribution networks (ADNs). Traditional centralized voltage regulation approaches face substantial challenges in terms of communication and computation. Distributed control methods can help mitigate these issues through distributed algorithms but struggle to track real-time fluctuations in PV generation. Local control offers fast voltage adjustments but lacks coordination among different PV units. This paper presents a hierarchical distributed and local voltage control strategy for PV clusters. First, the alternating direction method of multipliers (ADMM) algorithm is adopted to coordinate the reactive power outputs of PV inverters across clusters, providing reference values for local control. Then, in the local control phase, a Q-P control strategy is utilized to address real-time PV fluctuations. The flexibility of the local control strategy is enhanced using the lifted linear decision rule, enabling a rapid response to PV power fluctuations. Finally, the proposed strategy is tested on both the modified IEEE 33-node distribution system and a practical 53-node distribution system to evaluate its performance. The results demonstrate that the proposed method effectively mitigates voltage issues, reducing the average voltage deviation by 53.93% while improving flexibility and adaptability to real-time changes in PV output. Full article

Recently, many stochastic Alternating Direction Methods of Multipliers (ADMMs) have been proposed to solve large-scale machine learning problems. However, for large-scale saddle-point problems, the state-of-the-art (SOTA) stochastic ADMMs still have high per-iteration costs. On the other hand, the stochastic primal–dual hybrid gradient (SPDHG) has a low per-iteration cost but only a suboptimal convergence rate of $\mathsf{𝒪}(1/\sqrt{S})$. Thus, there still remains a gap in the convergence rates between SPDHG and SOTA ADMMs. Motivated by the two matters, we propose (accelerated) stochastic variance reduced primal–dual hybrid gradient ((A)SVR-PDHG) methods. We design a linear extrapolation step to improve the convergence rate and a new adaptive epoch length strategy to remove the extra boundedness assumption. Our algorithms have a simpler structure and lower per-iteration complexity than SOTA ADMMs. As a by-product, we present the asynchronous parallel variants of our algorithms. In theory, we rigorously prove that our methods converge linearly for strongly convex problems and improve the convergence rate to $\mathsf{𝒪}(1/S^2)$ for non-strongly convex problems as opposed to the existing $\mathsf{𝒪}(1/S)$ convergence rate. Compared with SOTA algorithms, various experimental results demonstrate that ASVR-PDHG can achieve an average speedup of $2\times \sim 5\times$. Full article

Frequency agile radar (FAR) exhibits robust anti-jamming capabilities and a superior low probability of intercept performance due to its randomized carrier frequency (CF) and pulse repetition frequency (PRF) hopping sequences. The advent of compressed sensing (CS) theory has effectively addressed the coherent processing challenges of frequency agile signals. Nonetheless, the reconstructed results often suffer from elevated sidelobe levels, which lead to significant sparse recovery errors. The performance of sparse reconstruction is greatly influenced by the correlation between the dictionary matrix columns. Specifically, weaker correlation usually means better target detection performance and lower false alarm probability. Consequently, this paper adopts the maximum coherence coefficient (MCC) between the dictionary matrix columns as the cost function. In addition, in order to reduce the correlation of the dictionary matrix and improve the target detection performance, a genetic algorithm (GA) is employed to jointly optimize the CF hopping coefficients and PRFs of the FAR. The echo of optimized signals is subsequently reconstructed using the alternating direction method of multipliers (ADMM) algorithm. Simulation results demonstrate the effectiveness of the proposal. Full article

The cooperative interconnection of multi-microgrid systems offers significant advantages in enhancing energy utilization efficiency and economic performance, providing innovative pathways for promoting sustainable development. To establish a fair energy trading mechanism for electricity–hydrogen sharing within multi-energy multi-microgrid (MEMG) systems, this study first analyzes the operational architecture of MEMG energy sharing and establishes a multi-energy coordinated single-microgrid model integrating electricity, heat, natural gas, and hydrogen. To achieve low-carbon operation, carbon capture systems (CCSs) and power-to-gas (P2G) units are incorporated into conventional combined heat and power (CHP) systems. Subsequently, an asymmetric Nash bargaining-based optimization framework is proposed to coordinate the MEMG network, which decomposes the problem into two subproblems: (1) minimizing the total operational cost of MEMG networks, and (2) maximizing payment benefits through fair benefit allocation. Notably, Subproblem 2 employs the energy trading volume of individual microgrids as bargaining power to ensure equitable profit distribution. The improved alternating direction multiplier method (ADMM) is adopted for distributed problem-solving. Experimental results demonstrate that the cost of each MG decreased by 5894.14, 3672.44, and 2806.64 CNY, while the total cost of the MEMG network decreased by 12,431.22 CNY. Additionally, the carbon emission reduction ratios were 2.84%, 2.77%, and 5.51% for each MG and 11.12% for the MEMG network. Full article

With the continuous expansion of low-Earth-orbit (LEO) satellite networks, the services within these networks have exhibited diverse and differentiated demand characteristics. Due to the limited onboard resources, efficient network resource allocation is required to ensure high-quality network performance. However, the dynamic topology and differentiated resource requirements for diversified services pose great challenges when existing resource awareness or prediction methods are applied to satellite networks, resulting in poor awareness latency and the inaccurate prediction of resource status. To solve these problems, a network resource allocation method based on awareness–prediction joint compensation is proposed. The method utilizes the node awareness latency as a prediction step and employs a long short-term memory model for resource status prediction. A dynamic compensation model is also proposed to compensate for the prediction results, which is achieved by adjusting compensation weights according to the awareness latencies and prediction accuracies. Furthermore, an efficient, accelerated alternating-direction method of multipliers (ADMM) resource allocation algorithm is proposed with the aim of maximizing the satisfaction of service resources requirements. The simulation results indicate that the relative error between the compensation data and onboard resource status does not exceed 5%, and the resource allocation method can improve the service resource coverage by 15.8%, thus improving the evaluation and allocation capabilities of network resources. Full article

Existing forest height estimation methods based on polarimetric interferometric synthetic aperture radar (PolInSAR) typically process each pixel independently, potentially introducing inconsistent estimates and additional decorrelation in the covariance matrix estimation. To address these limitations and effectively exploit the spatial context information, this paper proposes the first patch-based inversion method named joint pixel optimization inversion (JPO). By leveraging the smoothness and regularity of homogeneous pixels, a joint-pixel optimization problem is constructed, incorporating a first-order regularization on the ground phase. To solve the non-parallelizable problem of the alternating direction method of multipliers (ADMM), we devise a new parallelizable ADMM algorithm and prove its sublinear convergence. With the contextual information of neighboring pixels, JPO can provide more reliable forest height estimation and reduce the overestimation caused by additional decorrelation. The effectiveness of the proposed method is verified using spaceborne L-band repeat-pass SAOCOM acquisitions and LiDAR heights obtained from ICESat-2. Quantitative evaluations in forest height estimation show that the proposed method achieves a lower mean error (1.23 m) and RMSE (3.67 m) than the existing method (mean error: 3.09 m; RMSE: 4.70 m), demonstrating its improved reliability. Full article

With the increasing connection between integrated natural gas, thermal energy, and electric power systems, the integrated energy system (IES) needs to coordinate the internal unit scheduling and meet the different load demands of customers. However, when the energy subjects involved in scheduling are engaged in conflicts of interest, aspects such as hierarchical status relationships and cooperative and competitive relationships must be considered. Therefore, this paper studies the problem of achieving optimal energy scheduling for multiple subjects of source, storage, and load under the same distribution network while ensuring that their benefits are not impaired. First, this paper establishes a dual master-slave game model with a shared energy storage system (SESS), IES, and the alliance of prosumers (APs) as the main subjects. Second, based on the Nash negotiation theory and considering the sharing of electric energy among prosumers, the APs model is equated into two sub-problems of coalition cost minimization and cooperative benefit distribution to ensure that the coalition members distribute the cooperative benefits equitably. Further, the Stackelberg-Stackelberg-Nash three-layer game model is established, and the dichotomous distributed optimization algorithm combined with the alternating direction multiplier method (ADMM) is used to solve this three-layer game model. Finally, in the simulation results of the arithmetic example, the natural gas consumption is reduced by 9.32%, the economic efficiency of IES is improved by 3.95%, and the comprehensive energy purchase cost of APs is reduced by 12.16%, the proposed model verifies the sustainability co-optimization and mutual benefits of source, storage and load multi-interested subjects. Full article

Inverse synthetic aperture radar (ISAR) technology is widely used in the field of target recognition. This research addresses the image reconstruction error in sparse imaging for bistatic radar systems. In this paper, sparse imaging technology is studied, and a sparse imaging recovery algorithm based on an improved Alternating Direction Method of Multipliers is proposed. The algorithm accelerates the convergence of the algorithm by dynamically adjusting iterative parameters in the iterative process. Experiments show that the algorithm proposed in this paper has lower relative recovery error in the case of different noise levels and sparsity, and it can be concluded that the algorithm proposed in this paper has a lower relative recovery error than the ADMMs (Alternating Direction Method of Multipliers). Full article

Compared to conventional single-aperture infrared cameras, the bio-inspired infrared compound eye camera integrates the advantages of infrared imaging technology with the benefits of multi-aperture systems, enabling simultaneous information acquisition from multiple perspectives. This enhanced detection capability demonstrates unique performance in applications such as autonomous driving, surveillance, and unmanned aerial vehicle reconnaissance. Current single-aperture small target detection algorithms fail to exploit the spatial relationships among compound eye apertures, thereby underutilizing the inherent advantages of compound eye imaging systems. This paper proposes a low-rank and sparse decomposition method based on bio-inspired infrared compound eye image features for small target detection. Initially, a compound eye structural weighting operator is designed according to image characteristics, which enhances the sparsity of target points when combined with the reweighted $l_1$-norm. Furthermore, to improve detection speed, the structural tensor of the effective imaging region in infrared compound eye images is reconstructed, and the Representative Coefficient Total Variation method is employed to avoid complex singular value decomposition and regularization optimization computations. Our model is efficiently solved using the Alternating Direction Method of Multipliers (ADMM). Experimental results demonstrate that the proposed model can rapidly and accurately detect small infrared targets in bio-inspired compound eye image sequences, outperforming other comparative algorithms. Full article