اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Scenario-based Branch-and-Bound Approach for MES Scheduling in Urban Buildings
291
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents a novel solution technique for scheduling multi-energy system (MES) in a commercial urban building to perform price-based demand response and reduce energy costs. The MES scheduling problem is formulated as a mixed integer nonlinear program (MINLP), a non-convex NPhard problem with uncertainties due to renewable generation and demand. A model predictive control approach is used to handle the uncertainties and price variations. This in-turn requires solving a time-coupled multi-time step MINLP during each time-epoch which is computationally intensive. This investigation proposes an approach called the Scenario-Based Branch-and-Bound (SB3), a light-weight solver to reduce the computational complexity. It combines the simplicity of convex programs with the ability of meta-heuristic techniques to handle complex nonlinear problems. The performance of the SB3 solver is validated in the Cleantech building, Singapore and the results demonstrate that the proposed algorithm reduces energy cost by about 17.26% and 22.46% as against solving a multi-time step heuristic optimization model.
قيم البحث
اقرأ أيضاً
We consider some crucial problems related to the secure and reliable operation of power systems with high renewable penetrations: how much reserve should we procure, how should reserve resources distribute among different locations, and how should we
price reserve and charge uncertainty sources. These issues have so far been largely addressed empirically. In this paper, we first develop a scenario-oriented energy-reserve co-optimization model, which directly connects reserve procurement with possible outages and load/renewable power fluctuations without the need for empirical reserve requirements. Accordingly, reserve can be optimally procured system-wide to handle all possible future uncertainties with the minimum expected system total cost. Based on the proposed model, marginal pricing approaches are developed for energy and reserve, respectively. Locational uniform pricing is established for energy, and the similar property is also established for the combination of reserve and re-dispatch. In addition, properties of cost recovery for generators and revenue adequacy for the system operator are also proven.
In this study, we propose a rotation-based connected automated vehicle (CAV) distributed cooperative control strategy for an on-ramp merging scenario. By assuming the mainline and ramp line are straight, we firstly design a virtual rotation approach
that transfers the merging problem to a virtual car following (CF) problem to reduce the complexity and dimension of the cooperative CAVs merging control. Based on this concept, a multiple-predecessor virtual CF model and a unidirectional multi-leader communication topology are developed to determine the longitudinal behavior of each CAV. Specifically, we exploit a distributed feedback and feedforward longitudinal controller in preparation for actively generating gaps for merging CAVs, reducing the voids caused by merging, and ensuring safety and traffic efficiency during the process. To ensure the disturbance attenuation property of this system, practical string stability is mathematically proved for the virtual CF controllers to prohibit the traffic oscillation amplification through the traffic stream. Moreover, as a provision for extending the virtual CF application scenarios of any curvy ramp geometry, we utilize a curvilinear coordinate to model the two-dimensional merging control, and further design a local lateral controller based on an extended linear-quadratic regulator to regulate the position deviation and angular deviation of the lane centerlines. For the purpose of systematically evaluating the control performance of the proposed methods, numerical simulation experiments are conducted. As the results indicate, the proposed controllers can actively reduce the void and meanwhile guarantee the damping of traffic oscillations in the merging control area.
In this paper, we shed new light on a classical scheduling problem: given a slot-timed, constant-capacity server, what short-run scheduling decisions must be made to provide long-run service guarantees to competing flows of unit-sized tasks? We model
the flows long-run guarantees as worst-case services that map each arrival vector recording a flows cumulative task arrivals to a worst-case acceptable departure vector lower-bounding its cumulative task departures. We show that these services are states that can be updated as tasks arrive and depart, introduce state-based scheduling, and find the schedulability condition that must be preserved to maintain all flows long-run guarantees. We then use this condition to identify, in each slot, all short-run scheduling decisions that preserve schedulability. To illustrate how scheduling complexity can be reduced, we additionally show that special schedules can be efficiently identified by maximizing the servers capacity slack, and that special services can be efficiently specified and updated using properties of the min-plus algebra.
The development of advanced closed-loop irrigation systems requires accurate soil moisture information. In this work, we address the problem of soil moisture estimation for the agro-hydrological systems in a robust and reliable manner. A nonlinear st
ate-space model is established based on the discretization of the Richards equation to describe the dynamics of agro-hydrological systems. We consider that model parameters are unknown and need to be estimated together with the states simultaneously. We propose a consensus-based estimation mechanism, which comprises two main parts: 1) a distributed extended Kalman filtering algorithm used to estimate several model parameters; and 2) a distributed moving horizon estimation algorithm used to estimate the state variables and one remaining model parameter. Extensive simulations are conducted, and comparisons with existing methods are made to demonstrate the effectiveness and superiority of the proposed approach. In particular, the proposed approach can provide accurate soil moisture estimate even when poor initial guesses of the parameters and the states are used, which can be challenging to be handled using existing algorithms.
In high speed CNC (Compute Numerical Control) machining, the feed rate scheduling has played an important role to ensure machining quality and machining efficiency. In this paper, a novel feed rate scheduling method is proposed for generating smooth
feed rate profile conveniently with the consideration of both geometric error and kinematic error. First, a relationship between feed rate value and chord error is applied to determine the feed rate curve. Then, breaking points, which can split whole curve into several blocks, can be found out using proposed two step screening method. For every block, a feed rate profile based on the Sigmoid function is generated. With the consideration of kinematic limitation and machining efficiency, a time-optimal feed rate adjustment algorithm is proposed to further adjust feed rate value at breaking points. After planning feed rate profile for each block, all blocks feed rate profile will be connected smoothly. The resulting feed rate profile is more concise compared with the polynomial profile and more efficient compared with the trigonometric profile. Finally, simulations with two free-form NURBS curves are conducted and comparison with the sine-curve method are carried out to verify the feasibility and applicability of the proposed method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
