Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Dynamic-System-Based Approach to Modeling Driver Movements Across General-Purpose/Managed Lane Interfaces
76
0
0.0
(
0
)
Added by
Matthew A. Wright
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
To help mitigate road congestion caused by the unrelenting growth of traffic demand, many transportation authorities have implemented managed lane policies, which restrict certain freeway lanes to certain types of vehicles. It was originally thought that managed lanes would improve the use of existing infrastructure through demand-management behaviors like carpooling, but implementations have often been characterized by unpredicted phenomena that are sometimes detrimental to system performance. The development of traffic models that can capture these sorts of behaviors is a key step for helping managed lanes deliver on their promised gains. Towards this goal, this paper presents an approach for solving for driver behavior of entering and exiting managed lanes at the macroscopic (i.e., fluid approximation of traffic) scale. Our method is inspired by recent work in extending a dynamic-system-based modeling framework from traffic behaviors on individual roads, to models at junctions, and can be considered a further extension of this dynamic-system paradigm to the route/lane choice problem. Unlike traditional route choice models that are often based on discrete-choice methods and often rely on computing and comparing drivers estimated travel times from taking different routes, our method is agnostic to the particular choice of physical traffic model and is suited specifically towards making decisions at these interfaces using only local information. These features make it a natural drop-in component to extend existing dynamic traffic modeling methods.
rate research
Read More
This paper addresses an open problem in traffic modeling: the second-order macroscopic node problem. A second-order macroscopic traffic model, in contrast to a first-order model, allows for variation of driving behavior across subpopulations of vehicles in the flow. The second-order models are thus more descriptive (e.g., they have been used to model variable mixtures of behaviorally-different traffic, like car/truck traffic, autonomous/human-driven traffic, etc.), but are much more complex. The second-order node problem is a particularly complex problem, as it requires the resolution of discontinuities in traffic density and mixture characteristics, and solving of throughflows for arbitrary numbers of input and output roads to a node (in other words, this is an arbitrary-dimensional Riemann problem with two conserved quantities). In this paper, we extend the well-known Generic Class of Node Model constraints to the second order and present a simple solution algorithm to the second-order node problem. Our solution makes use of a recently-introduced dynamic system characterization of the first-order node model problem, which gives insight and intuition as to the continuous-time dynamics implicit in node models. We further argue that the common supply and demand construction of node models that decouples them from link models is not suitable to the second-order node problem. Our second-order node model and solution method have immediate applications in allowing modeling of behaviorally-complex traffic flows of contemporary interest (like partially-autonomous-vehicle flows) in arbitrary road networks.
Misunderstanding of driver correction behaviors (DCB) is the primary reason for false warnings of lane-departure-prediction systems. We propose a learning-based approach to predicting unintended lane-departure behaviors (LDB) and the chance for drivers to bring the vehicle back to the lane. First, in this approach, a personalized driver model for lane-departure and lane-keeping behavior is established by combining the Gaussian mixture model and the hidden Markov model. Second, based on this model, we develop an online model-based prediction algorithm to predict the forthcoming vehicle trajectory and judge whether the driver will demonstrate an LDB or a DCB. We also develop a warning strategy based on the model-based prediction algorithm that allows the lane-departure warning system to be acceptable for drivers according to the predicted trajectory. In addition, the naturalistic driving data of 10 drivers is collected through the University of Michigan Safety Pilot Model Deployment program to train the personalized driver model and validate this approach. We compare the proposed method with a basic time-to-lane-crossing (TLC) method and a TLC-directional sequence of piecewise lateral slopes (TLC-DSPLS) method. The results show that the proposed approach can reduce the false-warning rate to 3.07%.
In this paper we present a Learning Model Predictive Controller (LMPC) for autonomous racing. We model the autonomous racing problem as a minimum time iterative control task, where an iteration corresponds to a lap. In the proposed approach at each lap the race time does not increase compared to the previous lap. The system trajectory and input sequence of each lap are stored and used to systematically update the controller for the next lap. The first contribution of the paper is to propose a LMPC strategy which reduces the computational burden associated with existing LMPC strategies. In particular, we show how to construct a safe set and an approximation to the value function, using a subset of the stored data. The second contribution is to present a system identification strategy for the autonomous racing iterative control task. We use data from previous iterations and the vehicles kinematics equations to build an affine time-varying prediction model. The effectiveness of the proposed strategy is demonstrated by experimental results on the Berkeley Autonomous Race Car (BARC) platform.
An analytical approach for a dynamic cyber-security problem that captures progressive attacks to a computer network is presented. We formulate the dynamic security problem from the defenders point of view as a supervisory control problem with imperfect information, modeling the computer networks operation by a discrete event system. We consider a min-max performance criterion and use dynamic programming to determine, within a restricted set of policies, an optimal policy for the defender. We study and interpret the behavior of this optimal policy as we vary certain parameters of the supervisory control problem.
We developed a code that estimates distances to stars using measured spectroscopic and photometric quantities. We employ a Bayesian approach to build the probability distribution function over stellar evolutionary models given these data, delivering estimates of model parameters for each star individually. The code was first tested on simulations, successfully recovering input distances to mock stars with <1% bias.The method-intrinsic random distance uncertainties for typical spectroscopic survey measurements amount to around 10% for dwarf stars and 20% for giants, and are most sensitive to the quality of $log g$ measurements. The code was validated by comparing our distance estimates to parallax measurements from the Hipparcos mission for nearby stars (< 300 pc), to asteroseismic distances of CoRoT red giant stars, and to known distances of well-studied open and globular clusters. The external comparisons confirm that our distances are subject to very small systematic biases with respect to the fundamental Hipparcos scale (+0.4 % for dwarfs, and +1.6% for giants). The typical random distance scatter is 18% for dwarfs, and 26% for giants. For the CoRoT-APOGEE sample, the typical random distance scatter is ~15%, both for the nearby and farther data. Our distances are systematically larger than the CoRoT ones by about +9%, which can mostly be attributed to the different choice of priors. The comparison to known distances of star clusters from SEGUE and APOGEE has led to significant systematic differences for many cluster stars, but with opposite signs, and with substantial scatter. Finally, we tested our distances against those previously determined for a high-quality sample of giant stars from the RAVE survey, again finding a small systematic trend of +5% and an rms scatter of 30%.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
