To decrease the degree of dependence on fuel-based resources, it is necessary to reform the energy system. Integrated energy system (IES) combined heating and power networks, realizes the cooperation of heterogeneous ...
详细信息
ISBN:
(数字)9798350373318
ISBN:
(纸本)9798350373325
To decrease the degree of dependence on fuel-based resources, it is necessary to reform the energy system. Integrated energy system (IES) combined heating and power networks, realizes the cooperation of heterogeneous energies. To improve the efficiency of energy utilization, an energy management problem is investigated in this paper. Firstly, an energy management model of IES is constructed with the considerations of economy benefits and carbon emissions. Moreover, the carbon capture device and carbon storage device are installed in IES as well, which introduces a tax trading mechanism. Then, based on the method of alternating multipliers, a fully distributed energy management algorithm is designed to acquire the optimal solutions. Finally, simulation results prove the effectiveness of the constructed model and the distributed algorithm,
Virtual coupling technologies have been widely studied in recent years, due to their merits of flexibility and efficiency. However, to operate a virtually coupled train set (VCTS) as a single train, the synchronous op...
详细信息
ISBN:
(数字)9798331505929
ISBN:
(纸本)9798331505936
Virtual coupling technologies have been widely studied in recent years, due to their merits of flexibility and efficiency. However, to operate a virtually coupled train set (VCTS) as a single train, the synchronous operation is still a critical problem to be addressed, especially in arriving. To this end, we propose a distributed coordinated optimal control (DCOC) approach integrated with distributed optimization and model predictive control. First, we formulate a globally coordinated optimal control problem for VCTS, where the states of units in VCTS are coupled in the cost and constraints. Then, we design a distributed algorithm to solve the global problem, where local problems are decoupled into ones with fewer dimensions. Next, we employ distributed model predictive control to guarantee the satisfaction of safety constraints before the convergence of the distributed algorithm. Finally, experimental results demonstrate that our approach can achieve stable and synchronous operation for VCTS and save by 90% computation time than existing centralized approaches.
We present a distributed conjugate gradient method for distributed optimization problems, where each agent computes an optimal solution of the problem locally without any central computation or coordination, while com...
详细信息
ISBN:
(数字)9798350382655
ISBN:
(纸本)9798350382662
We present a distributed conjugate gradient method for distributed optimization problems, where each agent computes an optimal solution of the problem locally without any central computation or coordination, while communicating with its immediate, one-hop neighbors over a communication network. Each agent updates its local problem variable using an estimate of the average conjugate direction across the network, computed via a dynamic consensus approach. Our algorithm enables the agents to use uncoordinated step-sizes. We prove convergence of the local variable of each agent to the optimal solution of the aggregate optimization problem, without requiring decreasing step-sizes. In addition, we demonstrate the efficacy of our algorithm in distributed state estimation problems, and its robust counterparts, where we show its performance compared to existing distributed first-order optimization methods.
This paper proposes a distributed fixed-time neuro-dynamic algorithm with time-varying coefficients over directed communication networks, based on an event-triggered strategy. Following that, it is shown that the algo...
详细信息
ISBN:
(数字)9798350368604
ISBN:
(纸本)9798350368611
This paper proposes a distributed fixed-time neuro-dynamic algorithm with time-varying coefficients over directed communication networks, based on an event-triggered strategy. Following that, it is shown that the algorithm converges to an economic dispatch problem (EDP) optimum solution, and an upper bound on the convergence time that is independent of the initial conditions is given. Meanwhile, the proof of the exclusion of Zeno behavior is also given in detail. Finally, an EDP numerical simulation example is provided to verify the superiority of the proposed algorithm and the effectiveness of the event-triggered strategy.
The economic dispatch problem (EDP) is crucial in optimizing and controlling power systems. As modern power system become more complex, traditional centralized communication methods are becoming less reliable. Therefo...
详细信息
ISBN:
(数字)9798350356113
ISBN:
(纸本)9798350356120
The economic dispatch problem (EDP) is crucial in optimizing and controlling power systems. As modern power system become more complex, traditional centralized communication methods are becoming less reliable. Therefore, distributed optimization method that relie on communication between neighboring nodes without the need for a central node are proposed. Existing distributed optimization methods for economic dispatch problems mainly focus on equality constraints like supply-demand balance, while problems with global inequality constraints are rarely studied. To address this gap, we propose a distributed optimization algorithm based on the primal-dual method and gradient tracking technique that can handle both global equality and inequality constraints. We thoroughly analyze its convergence and successfully apply it to the EDP with emission constraints to demonstrate its effectiveness.
Ad-hoc networks are a communication protocol used in various sectors, particularly in military technologies. Unlike traditional network structures, Ad-hoc networks operate on the principle of peer-to-peer communicatio...
详细信息
ISBN:
(数字)9798350362541
ISBN:
(纸本)9798350362558
Ad-hoc networks are a communication protocol used in various sectors, particularly in military technologies. Unlike traditional network structures, Ad-hoc networks operate on the principle of peer-to-peer communication. Since the nodes within the network are not connected to a cellular infrastructure, distributed algorithms are required for the communication of nodes. However, it is important to carefully design these distributed algorithms based on essential criteria due to the challenges associated with ad-hoc networks. These criterias are considered to be particularly important when dealing with dynamically variable networks, such as a mobile ad-hoc networks. Mobile ad-hoc networks face significant challenges related to scaling, energy consumption, and stability. To address these challenges, various clustering algorithms employed, each with its own benefits and costs. In this study, a connected dominating set algorithm is proposed for mobile ad hoc networks, which can provide workload balance and protect the backbone structure relatively against mobility and can be an alternative solution to the congestion occurring on a single backbone by creating multiple backbone structures.
Large-scale multi-agent systems are increasingly relevant in various aspects of society; their operation requires advances in multi-agent distributed optimisation algorithms that can handle uncertain environments. Thi...
详细信息
ISBN:
(数字)9798350316339
ISBN:
(纸本)9798350316346
Large-scale multi-agent systems are increasingly relevant in various aspects of society; their operation requires advances in multi-agent distributed optimisation algorithms that can handle uncertain environments. This paper presents a distributed algorithm suitable for solving convex constraint-coupled multi-agent problems with uncertainty directly affecting the coupling constraints. The algorithm exploits the problem structure to solve the large-scale uncertain problem efficiently, leveraging the scenario approach to approximate the coupling chance-constraint. We prove that the number of scenarios required to guarantee a given violation probability level is independent of the agent number, making the solution scalable. We apply the algorithm to a multi-microgrid aggregation problem to provide ancillary services to the Grid, a relevant decarbonisation and energy security topic.
This paper proposes a method to recover from the failure or loss of a subset of agents in a distance-based formation problem, where the system is initially deployed forming a virtual shield embedded in the 3D space. F...
详细信息
ISBN:
(数字)9783907144107
ISBN:
(纸本)9798331540920
This paper proposes a method to recover from the failure or loss of a subset of agents in a distance-based formation problem, where the system is initially deployed forming a virtual shield embedded in the 3D space. First, a distributed algorithm is proposed to restore the topology, which is a Delaunay triangulation. After that, the nodes execute a distance-based distributed control law that considers adaptive target distances. These values are computed in parallel by the nodes, which try to reach an agreement with some constraints, given by the desired shield shape. The updating policy is based on events. The results are illustrated through simulation examples.
This paper introduces a game-theoretic framework aimed at enhancing offloading decisions within a network of multiple tethered aerial vehicles (TAVs) employed as communication base stations and relay platforms. Given ...
详细信息
ISBN:
(数字)9798350395914
ISBN:
(纸本)9798350395921
This paper introduces a game-theoretic framework aimed at enhancing offloading decisions within a network of multiple tethered aerial vehicles (TAVs) employed as communication base stations and relay platforms. Given their advantageous low deployment costs and extensive coverage areas, TAVs represent an innovative solution for dynamic air-ground communication networks. We address the inherent challenges associated with the mobility of ground users and consider across multiple temporal intervals. We initially segment offloading decisions into discrete time slots and model them within a strategic game principle. Subsequently, we prove that this game constitutes an exact potential game and introduce a distributed algorithm based on best response iteration. This algorithm is designed for decentralized deployment across individual tethered aerial vehicles. Through simulation studies, we demonstrate that our proposed methodology enhances network throughput relative to conventional random offloading strategies. It advances the theoretical understanding of offloading in dynamic network environments and offers practical algorithms for real-world applications.
Intelligent transportation systems have recently emerged to address the growing interest for safer, more efficient, and sustainable transportation solutions. In this direction, this paper presents distributed algorith...
详细信息
ISBN:
(数字)9798331529734
ISBN:
(纸本)9798331529741
Intelligent transportation systems have recently emerged to address the growing interest for safer, more efficient, and sustainable transportation solutions. In this direction, this paper presents distributed algorithms for control and optimization over vehicular networks. First, we formulate the autonomous vehicle platooning framework based on model-predictive-control (MPC) strategies and present its objective optimization as a cooperative quadratic cost function. Then, we propose a distributed algorithm to locally optimize this objective at every vehicle subject to data quantization over the communication network of vehicles. In contrast to most existing literature that assumes ideal communication channels, log-scale data quantization over the network is addressed in this work, which is more realistic and practical. In particular, we show by simulation that the proposed log-quantized algorithm reaches optimal convergence with less residual and optimality gap. This outperforms the existing literature considering uniform quantization which leads to a large optimality gap and residual.
暂无评论