Correction: Distributed optimal power flow.
Ontology highlight
ABSTRACT:
SUBMITTER: PLOS ONE Staff
PROVIDER: S-EPMC8282031 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:ObjectiveThe objectives of this paper are to 1) construct a new network model compatible with distributed computation, 2) construct the full optimal power flow (OPF) in a distributed fashion so that an effective, non-inferior solution can be found, and 3) develop a scalable algorithm that guarantees the convergence to a local minimum.Existing challengesDue to the nonconvexity of the problem, the search for a solution to OPF problems is not scalable, which makes the OPF highly limited for the system operation of large-scale real-world power grids-"the curse of dimensionality". The recent attempts at distributed computation aim for a scalable and efficient algorithm by reducing the computational cost per iteration in exchange of increased communication costs.MotivationA new network model allows for efficient computation without increasing communication costs. With the network model, recent advancements in distributed computation make it possible to develop an efficient and scalable algorithm suitable for large-scale OPF optimizations.MethodsWe propose a new network model in which all nodes are directly connected to the center node to keep the communication costs manageable. Based on the network model, we suggest a nodal distributed algorithm and direct communication to all nodes through the center node. We demonstrate that the suggested algorithm converges to a local minimum rather than a point, satisfying the first optimality condition.ResultsThe proposed algorithm identifies solutions to OPF problems in various IEEE model systems. The solutions are identical to those using a centrally optimized and heuristic approach. The computation time at each node does not depend on the system size, and Niter does not increase significantly with the system size.ConclusionOur proposed network model is a star network for maintaining the shortest node-to-node distances to allow a linear information exchange. The proposed algorithm guarantees the convergence to a local minimum rather than a maximum or a saddle point, and it maintains computational efficiency for a large-scale OPF, scalable algorithm.
| S-EPMC8213183 | biostudies-literature
Project description:With the rapid development of wireless sensor networks, reducing energy consumption is becoming one of the important factors to extend node lifetime, and it is necessary to adjust the launching power of each node because of the limited energy available to the sensor nodes in the networks. This paper proposes a power and rate control model based on the network utility maximization (NUM) framework, where a weighting factor is used to reflect the influence degree of the sending power and transmission rate to the utility function. In real networks, nodes interfere with each other in the procedure of transmitting signal, which may lead to signal transmission failure and may negatively have impacts on networks throughput. Using dual decomposition techniques, the NUM problem is decomposed into two distributed subproblems, and then the conjugate gradient method is applied to solve the optimization problem with the calculation of the Hessian matrix and its inverse in order to guarantee fast convergence of the algorithm. The convergence proof is also provided in this paper. Numerical examples show that the proposed solution achieves significant throughput compared with exiting approaches.
| S-EPMC4034712 | biostudies-other
Project description:We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with n nodes that is observed at s remote sites over time [1, t], the two proposed algorithms have communication costs Õ(ns) and Õ(n + s) (Õ hides a polylogarithmic factor), almost matching their lower bounds, Ω(ns) and Ω (n + s), respectively, in the message passing and the blackboard models. More importantly, we prove that at each time point in [1, t] our algorithms generate clustering quality nearly as good as that of centralizing all updates up to that time and then applying a standard centralized clustering algorithm. We conducted extensive experiments on both synthetic and real-life datasets which confirmed the communication efficiency of our approach over baseline algorithms while achieving comparable clustering results.
| S-EPMC9275443 | biostudies-literature
Project description:We consider running-time optimization for band-joins in a distributed system, e.g., the cloud. To balance load across worker machines, input has to be partitioned, which causes duplication. We explore how to resolve this tension between maximum load per worker and input duplication for band-joins between two relations. Previous work suffered from high optimization cost or considered partitionings that were too restricted (resulting in suboptimal join performance). Our main insight is that recursive partitioning of the join-attribute space with the appropriate split scoring measure can achieve both low optimization cost and low join cost. It is the first approach that is not only effective for one-dimensional band-joins but also for joins on multiple attributes. Experiments indicate that our method is able to find partitionings that are within 10% of the lower bound for both maximum load per worker and input duplication for a broad range of settings, significantly improving over previous work.
| S-EPMC7872589 | biostudies-literature
Project description:BACKGROUND:This paper examines the cost and benefits, both financial and environmental, of two leading forms of solar power generation, grid-tied photovoltaic cells and Dish Stirling Systems, using conventional carbon-based fuel as a benchmark. METHODS:First we define how these solar technologies will be implemented and why. Then we delineate a model city and its characteristics, which will be used to test the two methods of solar-powered electric distribution. Then we set the constraining assumptions for each technology, which serve as parameters for our calculations. Finally, we calculate the present value of the total cost of conventional energy needed to power our model city and use this as a benchmark when analyzing both solar models' benefits and costs. RESULTS:The preeminent form of distributed electricity generation, grid-tied photovoltaic cells under net-metering, allow individual homeowners a degree of electric self-sufficiency while often turning a profit. However, substantial subsidies are required to make the investment sensible. Meanwhile, large dish Stirling engine installations have a significantly higher potential rate of return, but face a number of pragmatic limitations. CONCLUSIONS:This paper concludes that both technologies are a sensible investment for consumers, but given that the dish Stirling consumer receives 6.37 dollars per watt while the home photovoltaic system consumer receives between 0.9 and 1.70 dollars per watt, the former appears to be a superior option. Despite the large investment, this paper deduces that it is far more feasible to get few strong investors to develop a solar farm of this magnitude, than to get 150,000 households to install photovoltaic arrays in their roofs. Potential implications of the solar farm construction include an environmental impact given the size of land require for this endeavour. However, the positive aspects, which include a large CO2 emission reduction aggregated over the lifespan of the farm, outweigh any minor concerns or potential externalities.
| S-EPMC3332255 | biostudies-literature
Project description: Not available
| S-EPMC4209954 | biostudies-literature
Project description: Not available
| S-EPMC3958558 | biostudies-literature
Project description:A theoretical model of avian flight is developed which simulates wing motion through a class of methods known as predictive simulation. This approach uses numerical optimization to predict power-optimal kinematics of avian wings in hover, cruise, climb and descent. The wing dynamics capture both aerodynamic and inertial loads. The model is used to simulate the flight of the pigeon, Columba livia, and the results are compared with previous experimental measurements. In cruise, the model unearths a vast range of kinematic modes that are capable of generating the required forces for flight. The most efficient mode uses a near-vertical stroke-plane and a flexed-wing upstroke, similar to kinematics recorded experimentally. In hover, the model predicts that the power-optimal mode uses an extended-wing upstroke, similar to hummingbirds. In flexing their wings, pigeons are predicted to consume 20% more power than if they kept their wings full extended, implying that the typical kinematics used by pigeons in hover are suboptimal. Predictions of climbing flight suggest that the most energy-efficient way to reach a given altitude is to climb as steeply as possible, subjected to the availability of power.
| S-EPMC4277085 | biostudies-literature
Project description:Distributed interval estimation in linear regression may be computationally infeasible in the presence of big data that are normally stored in different computer servers or in cloud. The existing challenge represents the results from the distributed estimation may still contain redundant information about the population characteristics of the data. To tackle this computing challenge, we develop an optimization procedure to select the best subset from the collection of data subsets, based on which we perform interval estimation in the context of linear regression. The procedure is derived based on minimizing the length of the final interval estimator and maximizing the information remained in the selected data subset, thus is named as the LIC criterion. Theoretical performance of the LIC criterion is studied in this paper together with a simulation study and real data analysis.
| S-EPMC10291943 | biostudies-literature
Project description: Not available
| S-EPMC2909090 | biostudies-literature