arXiv subjects

Yaser P. Fallah

Publications and source records attributed to Yaser P. Fallah.

41 records · Page 3Linked to original sources

arXiv2018

A Stochastic Hybrid Framework for Driver Behavior Modeling Based on Hierarchical Dirichlet Process

Scalability is one of the major issues for real-world Vehicle-to-Vehicle network realization. To tackle this challenge, a stochastic hybrid modeling framework based on a non-parametric Bayesian inference method, i.e., hierarchical Dirichlet process (HDP), is investigated in this paper. This framework is able to jointly model driver/vehicle behavior through forecasting the vehicle dynamical time-series. This modeling framework could be merged with the notion of model-based information networking, which is recently proposed in the vehicular literature, to overcome the scalability challenges in dense vehicular networks via broadcasting the behavioral models instead of raw information dissemination. This modeling approach has been applied on several scenarios from the realistic Safety Pilot Model Deployment (SPMD) driving data set and the results show a higher performance of this model in comparison with the zero-hold method as the baseline.

eess.SP↗

arXiv2018

A Driver Behavior Modeling Structure Based on Non-parametric Bayesian Stochastic Hybrid Architecture

Heterogeneous nature of the vehicular networks, which results from the co-existence of human-driven, semi-automated, and fully autonomous vehicles, is a challenging phenomenon toward the realization of the intelligent transportation systems with an acceptable level of safety, comfort, and efficiency. Safety applications highly suffer from communication resource limitations, specifically in dense and congested vehicular networks. The idea of model-based communication (MBC) has been recently proposed to address this issue. In this work, we propose Gaussian Process-based Stochastic Hybrid System with Cumulative Relevant History (CRH-GP-SHS) framework, which is a hierarchical stochastic hybrid modeling structure, built upon a non-parametric Bayesian inference method, i.e. Gaussian processes. This framework is proposed in order to be employed within the MBC context to jointly model driver/vehicle behavior as a stochastic object. Non-parametric Bayesian methods relieve the limitations imposed by non-evolutionary model structures and enable the proposed framework to properly capture different stochastic behaviors. The performance of the proposed CRH-GP-SHS framework at the inter-mode level has been evaluated over a set of realistic lane change maneuvers from NGSIM-US101 dataset. The results show a noticeable performance improvement for GP in comparison to the baseline constant speed model, specifically in critical situations such as highly congested networks. Moreover, an augmented model has also been proposed which is a composition of GP and constant speed models and capable of capturing the driver behavior under various network reliability conditions.

eess.SP↗

arXiv2018

A Learning-based Stochastic MPC Design for Cooperative Adaptive Cruise Control to Handle Interfering Vehicles

Vehicle to Vehicle (V2V) communication has a great potential to improve reaction accuracy of different driver assistance systems in critical driving situations. Cooperative Adaptive Cruise Control (CACC), which is an automated application, provides drivers with extra benefits such as traffic throughput maximization and collision avoidance. CACC systems must be designed in a way that are sufficiently robust against all special maneuvers such as cutting-into the CACC platoons by interfering vehicles or hard braking by leading cars. To address this problem, a Neural- Network (NN)-based cut-in detection and trajectory prediction scheme is proposed in the first part of this paper. Next, a probabilistic framework is developed in which the cut-in probability is calculated based on the output of the mentioned cut-in prediction block. Finally, a specific Stochastic Model Predictive Controller (SMPC) is designed which incorporates this cut-in probability to enhance its reaction against the detected dangerous cut-in maneuver. The overall system is implemented and its performance is evaluated using realistic driving scenarios from Safety Pilot Model Deployment (SPMD).

eess.SY↗

arXiv2014

Adaptive Content Control for Communication amongst Cooperative Automated Vehicles

Cooperative automated vehicles exchange information to assist each other in creating a more precise and extended view of their surroundings, with the aim of improving automated-driving decisions. This paper addresses the need for scalable communication among these vehicles. To this end, a general communication framework is proposed through which automated cars exchange information derived from multi-resolution maps created using their local sensing modalities. This method can extend the region visible to a car beyond the area directly sensed by its own sensors. An adaptive, probabilistic, distance-dependent strategy is proposed that controls the content of the messages exchanged among vehicles based on performance measures associated with the load on the communication channel.

cs.NI↗

arXiv2012

Fairness and Stability Analysis of Congestion Control Schemes in Vehicular Ad-hoc Networks

Cooperative vehicle safety (CVS) systems operate based on broadcast of vehicle position and safety information to neighboring cars. The communication medium of CVS is a vehicular ad-hoc network. One of the main challenges in large scale deployment of CVS systems is the issue of scalability. To address the scalability problem, several congestion control methods have been proposed and are currently under field study. These algorithms adapt transmission rate and power based on network measures such as channel busy ratio. We examine two such algorithms and study their dynamic behavior in time and space to evaluate stability (in time) and fairness (in space) properties of these algorithms. We present stability conditions and evaluate stability and fairness of the algorithms through simulation experiments. Results show that there is a trade-off between fast convergence, temporal stability and spatial fairness. The proper ranges of parameters for achieving stability are presented for the discussed algorithms. Stability is verified for all typical road density cases. Fairness is shown to be naturally achieved for some algorithms, while under the same conditions other algorithms may suffer from unfairness issues. A method for resolving unfairness is introduced and evaluated through simulations.

cs.NI↗