اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMacroscopic Modeling, Calibration, and Simulation of Managed Lane-Freeway Networks, Part II: Network-scale Calibration and Case Studies
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In Part I of this paper series, several macroscopic traffic model elements for mathematically describing freeway networks equipped with managed lane facilities were proposed. These modeling techniques seek to capture at the macroscopic the complex phenomena that occur on managed lane-freeway networks, where two parallel traffic flows interact with each other both in the physical sense (how and where cars flow between the two lane groups) and the physiological sense (how driving behaviors are changed by being adjacent to a quantitatively and qualitatively different traffic flow). The local descriptions we developed in Part I are not the only modeling complexity introduced in managed lane-freeway networks. The complex topologies mean that network-scale modeling of a freeway corridor is increased in complexity as well. The already-difficult model calibration problem for a dynamic model of a freeway becomes more complex when the freeway becomes, in effect, two interrelating flow streams. In the present paper, we present an iterative-learning-based approach to calibrating our models physical and driver-behavioral parameters. We consider the common situation where a complex traffic model needs to be calibrated to recreate real-world baseline traffic behavior, such that counterfactuals can be generated by training purposes. Our method is used to identify traditional freeway parameters as well as the proposed parameters that describe managed lane-freeway-network-specific behaviors. We validate our model and calibration methodology with case studies of simulations of two managed lane-equipped California freeways.
قيم البحث
اقرأ أيضاً
This study demonstrates the implementation of the stochastic ruler discrete simulation optimization method for calibrating an agent-based model (ABM) developed to simulate hepatitis C virus (HCV) transmission. The ABM simulates HCV transmission betwe
en agents interacting in multiple environments relevant for HCV transmission in the Indian context. Key outcomes of the ABM are HCV and injecting drug user (IDU) prevalences among the simulated cohort. Certain input parameters of the ABM need to be calibrated so that simulation outcomes attain values as close as possible to real-world HCV and IDU prevalences. We conceptualize the calibration process as a discrete simulation optimization problem by discretizing the calibration parameter ranges, defining an appropriate objective function, and then applying the stochastic ruler random search method to solve this problem. We also present a method that exploits the monotonic relationship between the simulation outcomes and calibration parameters to yield improved calibration solutions with lesser computational effort.
This paper presents a network hardware-in-the-loop (HIL) simulation system for modeling large-scale power systems. Researchers have developed many HIL test systems for power systems in recent years. Those test systems can model both microsecond-level
dynamic responses of power electronic systems and millisecond-level transients of transmission and distribution grids. By integrating individual HIL test systems into a network of HIL test systems, we can create large-scale power grid digital twins with flexible structures at required modeling resolution that fits for a wide range of system operating conditions. This will not only significantly reduce the need for field tests when developing new technologies but also greatly shorten the model development cycle. In this paper, we present a networked OPAL-RT based HIL test system for developing transmission-distribution coordinative Volt-VAR regulation technologies as an example to illustrate system setups, communication requirements among different HIL simulation systems, and system connection mechanisms. Impacts of communication delays, information exchange cycles, and computing delays are illustrated. Simulation results show that the performance of a networked HIL test system is satisfactory.
The vulnerability of artificial intelligence (AI) and machine learning (ML) against adversarial disturbances and attacks significantly restricts their applicability in safety-critical systems including cyber-physical systems (CPS) equipped with neura
l network components at various stages of sensing and control. This paper addresses the reachable set estimation and safety verification problems for dynamical systems embedded with neural network components serving as feedback controllers. The closed-loop system can be abstracted in the form of a continuous-time sampled-data system under the control of a neural network controller. First, a novel reachable set computation method in adaptation to simulations generated out of neural networks is developed. The reachability analysis of a class of feedforward neural networks called multilayer perceptrons (MLP) with general activation functions is performed in the framework of interval arithmetic. Then, in combination with reachability methods developed for various dynamical system classes modeled by ordinary differential equations, a recursive algorithm is developed for over-approximating the reachable set of the closed-loop system. The safety verification for neural network control systems can be performed by examining the emptiness of the intersection between the over-approximation of reachable sets and unsafe sets. The effectiveness of the proposed approach has been validated with evaluations on a robotic arm model and an adaptive cruise control system.
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.
Originally, the decision and control of the lane change of the vehicle were on the human driver. In previous studies, the decision-making of lane-changing of the human drivers was mainly used to increase the individuals benefit. However, the lane-cha
nging behavior of these human drivers can sometimes have a bad influence on the overall traffic flow. As technology for autonomous vehicles develop, lane changing action as well as lane changing decision making fall within the control category of autonomous vehicles. However, since many of the current lane-changing decision algorithms of autonomous vehicles are based on the human driver model, it is hard to know the potential traffic impact of such lane change. Therefore, in this study, we focused on the decision-making of lane change considering traffic flow, and accordingly, we study the lane change control system considering the whole traffic flow. In this research, the lane change control system predicts the future traffic situation through the cell transition model, one of the most popular macroscopic traffic simulation models, and determines the change probability of each lane that minimizes the total time delay through the genetic algorithm. The lane change control system then conveys the change probability to this vehicle. In the macroscopic simulation result, the proposed control system reduced the overall travel time delay. The proposed system is applied to microscopic traffic simulation, the oversaturated freeway traffic flow algorithm (OFFA), to evaluate the potential performance when it is applied to the actual traffic system. In the traffic flow-density, the maximum traffic flow has been shown to be increased, and the points in the congestion area have also been greatly reduced. Overall, the time required for individual vehicles was reduced.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
