اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWireless Charging Lane Deployment in Urban Areas Considering Traffic Light and Regional Energy Supply-Demand Balance
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, to optimize the Wireless Charging Lane (WCL) deployment in urban areas, we focus on installation cost reduction while achieving regional balance of energy supply and demand, as well as vehicle continuous operability issues. In order to explore the characteristics of energy demand in various regions of the city, we first analyze the daily driving trajectory of taxis in different regions and find that the daily energy demand fluctuates to different degrees in different regions. Then, we establish the WCL power supply model to obtain the wireless charging supply situation in line with the real urban traffic condition, which is the first work considering the influence of traffic lights on charging situation. To ensure minimum deployment cost and to coordinate the contradiction between regional energy supply-demand balance and overall supply-demand matching, we formulate optimization problems ensuring the charge-energy consumption ratio of vehicles. In addition, we rank the priority of WCL efficiency to reduce the complexity of solution and solve the Mixed Integer NonLinear Programming (MINLP) problem to determine deployment plan. Compared with the baseline, the proposed method in this paper has significantly improved the effect.
قيم البحث
اقرأ أيضاً
In cells and in vitro assays the number of motor proteins involved in biological transport processes is far from being unlimited. The cytoskeletal binding sites are in contact with the same finite reservoir of motors (either the cytosol or the flow c
hamber) and hence compete for recruiting the available motors, potentially depleting the reservoir and affecting cytoskeletal transport. In this work we provide a theoretical framework to study, analytically and numerically, how motor density profiles and crowding along cytoskeletal filaments depend on the competition of motors for their binding sites. We propose two models in which finite processive motor proteins actively advance along cytoskeletal filaments and are continuously exchanged with the motor pool. We first look at homogeneous reservoirs and then examine the effects of free motor diffusion in the surrounding medium. We consider as a reference situation recent in vitro experimental setups of kinesin-8 motors binding and moving along microtubule filaments in a flow chamber. We investigate how the crowding of linear motor proteins moving on a filament can be regulated by the balance between supply (concentration of motor proteins in the flow chamber) and demand (total number of polymerised tubulin heterodimers). We present analytical results for the density profiles of bound motors, the reservoir depletion, and propose novel phase diagrams that present the formation of jams of motor proteins on the filament as a function of two tuneable experimental parameters: the motor protein concentration and the concentration of tubulins polymerized into cytoskeletal filaments. Extensive numerical simulations corroborate the analytical results for parameters in the experimental range and also address the effects of diffusion of motor proteins in the reservoir.
Mitigating traffic congestion on urban roads, with paramount importance in urban development and reduction of energy consumption and air pollution, depends on our ability to foresee road usage and traffic conditions pertaining to the collective behav
ior of drivers, raising a significant question: to what degree is road traffic predictable in urban areas? Here we rely on the precise records of daily vehicle mobility based on GPS positioning device installed in taxis to uncover the potential daily predictability of urban traffic patterns. Using the mapping from the degree of congestion on roads into a time series of symbols and measuring its entropy, we find a relatively high daily predictability of traffic conditions despite the absence of any a priori knowledge of drivers origins and destinations and quite different travel patterns between weekdays and weekends. Moreover, we find a counterintuitive dependence of the predictability on travel speed: the road segment associated with intermediate average travel speed is most difficult to be predicted. We also explore the possibility of recovering the traffic condition of an inaccessible segment from its adjacent segments with respect to limited observability. The highly predictable traffic patterns in spite of the heterogeneity of drivers behaviors and the variability of their origins and destinations enables development of accurate predictive models for eventually devising practical strategies to mitigate urban road congestion.
Service platforms must determine rules for matching heterogeneous demand (customers) and supply (workers) that arrive randomly over time and may be lost if forced to wait too long for a match. We show how to balance the trade-off between making a les
s good match quickly and waiting for a better match, at the risk of losing impatient customers and/or workers. When the objective is to maximize the cumulative value of matches over a finite-time horizon, we propose discrete-review matching policies, both for the case in which the platform has access to arrival rate parameter information and the case in which the platform does not. We show that both the blind and nonblind policies are asymptotically optimal in a high-volume setting. However, the blind policy requires frequent re-solving of a linear program. For that reason, we also investigate a blind policy that makes decisions in a greedy manner, and we are able to establish an asymptotic lower bound for the greedy, blind policy that depends on the matching values and is always higher than half of the value of an optimal policy. Next, we develop a fluid model that approximates the evolution of the stochastic model and captures explicitly the nonlinear dependence between the amount of demand and supply waiting and the distribution of their patience times. We use the fluid model to propose a policy for a more general objective that additionally penalizes queue build-up. We run numerous simulations to investigate the performance of the aforementioned proposed matching policies.
Effective traffic optimization strategies can improve the performance of transportation networks significantly. Most exiting works develop traffic optimization strategies depending on the local traffic states of congested road segments, where the con
gestion propagation is neglected. This paper proposes a novel distributed traffic optimization method for urban freeways considering the potential congested road segments, which are called potential-homogeneous-area. The proposed approach is based on the intuition that the evolution of congestion may affect the neighbor segments due to the mobility of traffic flow. We identify potential-homogeneous-area by applying our proposed temporal-spatial lambda-connectedness method using historical traffic data. Further, global dynamic capacity constraint of this area is integrated with cell transmission model (CTM) in the traffic optimization problem. To reduce computational complexity and improve scalability, we propose a fully distributed algorithm to solve the problem, which is based on the partial augmented Lagrangian and dual-consensus alternating direction method of multipliers (ADMM). By this means, distributed coordination of ramp metering and variable speed limit control is achieved. We prove that the proposed algorithm converges to the optimal solution so long as the traffic optimization objective is convex. The performance of the proposed method is evaluated by macroscopic simulation using real data of Shanghai, China.
Wireless Energy Transfer (WET) has recently emerged as an appealing solution for power supplying mobile / Internet of Things (IoT) devices. As an enabling WET technology, Resonant Beam Charging (RBC) is well-documented for its long-range, high-power,
and safe WiFi-like mobile power supply. To provide high-quality wireless charging services for multi-user in a given region, we formulate a deployment problem of multiple RBC transmitters for balancing the charging fairness and quality of charging service. Based on the RBC transmitters coverage model and receivers charging / discharging model, a Genetic Algorithm (GA)-based and a Particle Swarm Optimization (PSO)-based scheme are put forth to resolve the above issue. Moreover, we present a scheduling method to evaluate the performance of the proposed algorithms. Numerical results corroborate that the optimized deployment schemes outperform uniform and random deployment in 10%-20% charging efficiency improvement.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
