SearcharxivSearch

arXiv subjects

Behrad Toghi

Publications and source records attributed to Behrad Toghi.

At least 19 recordsLinked to original sources

Scalable Cellular V2X Solutions: Large-Scale Deployment Challenges of Connected Vehicle Safety Networks

Vehicle-to-Everything (V2X) communication is expected to accomplish a long-standing goal of the Connected and Autonomous Vehicle (CAV) community to bring connected vehicles to roads on a large scale. A major challenge, and perhaps the biggest hurdle on the path towards this goal is the scalability issues associated with it, especially when vehicular safety is concerned. As a major stakeholder, 3rd Generation Partnership Project (3GPP) based Cellular V2X (C-V2X) community has long been trying to research on whether vehicular networks are able to support the safety-critical applications in high-density vehicular scenarios. This paper attempts to answer this by first presenting an overview on the scalability challenges faced by 3GPP Release 14 Long Term Evolution C-V2X (LTE-V2X) using the PC5 sidelink interface for low and heavy-density traffic scenarios. Next, it demonstrates a series of solutions that address network congestion, packet losses and other scalability issues associated with LTE-V2X to enable this communication technology for commercial deployment. In addition, a brief survey is provided into 3GPP Release 16 5G New Radio V2X (NR-V2X) that utilizes the NR sidelink interface and works as an evolution of C-V2X towards better performance for V2X communications including new enhanced V2X (eV2X) scenarios that possess ultra-low-latency and high-reliability requirements.

cs.NI

Learning-based social coordination to improve safety and robustness of cooperative autonomous vehicles in mixed traffic

It is expected that autonomous vehicles(AVs) and heterogeneous human-driven vehicles(HVs) will coexist on the same road. The safety and reliability of AVs will depend on their social awareness and their ability to engage in complex social interactions in a socially accepted manner. However, AVs are still inefficient in terms of cooperating with HVs and struggle to understand and adapt to human behavior, which is particularly challenging in mixed autonomy. In a road shared by AVs and HVs, the social preferences or individual traits of HVs are unknown to the AVs and different from AVs, which are expected to follow a policy, HVs are particularly difficult to forecast since they do not necessarily follow a stationary policy. To address these challenges, we frame the mixed-autonomy problem as a multi-agent reinforcement learning (MARL) problem and propose an approach that allows AVs to learn the decision-making of HVs implicitly from experience, account for all vehicles' interests, and safely adapt to other traffic situations. In contrast with existing works, we quantify AVs' social preferences and propose a distributed reward structure that introduces altruism into their decision-making process, allowing the altruistic AVs to learn to establish coalitions and influence the behavior of HVs.

cs.RO

Prediction-aware and Reinforcement Learning based Altruistic Cooperative Driving

Autonomous vehicle (AV) navigation in the presence of Human-driven vehicles (HVs) is challenging, as HVs continuously update their policies in response to AVs. In order to navigate safely in the presence of complex AV-HV social interactions, the AVs must learn to predict these changes. Humans are capable of navigating such challenging social interaction settings because of their intrinsic knowledge about other agents behaviors and use that to forecast what might happen in the future. Inspired by humans, we provide our AVs the capability of anticipating future states and leveraging prediction in a cooperative reinforcement learning (RL) decision-making framework, to improve safety and robustness. In this paper, we propose an integration of two essential and earlier-presented components of AVs: social navigation and prediction. We formulate the AV decision-making process as a RL problem and seek to obtain optimal policies that produce socially beneficial results utilizing a prediction-aware planning and social-aware optimization RL framework. We also propose a Hybrid Predictive Network (HPN) that anticipates future observations. The HPN is used in a multi-step prediction chain to compute a window of predicted future observations to be used by the value function network (VFN). Finally, a safe VFN is trained to optimize a social utility using a sequence of previous and predicted observations, and a safety prioritizer is used to leverage the interpretable kinematic predictions to mask the unsafe actions, constraining the RL policy. We compare our prediction-aware AV to state-of-the-art solutions and demonstrate performance improvements in terms of efficiency and safety in multiple simulated scenarios.

cs.RO

Robustness and Adaptability of Reinforcement Learning based Cooperative Autonomous Driving in Mixed-autonomy Traffic

Building autonomous vehicles (AVs) is a complex problem, but enabling them to operate in the real world where they will be surrounded by human-driven vehicles (HVs) is extremely challenging. Prior works have shown the possibilities of creating inter-agent cooperation between a group of AVs that follow a social utility. Such altruistic AVs can form alliances and affect the behavior of HVs to achieve socially desirable outcomes. We identify two major challenges in the co-existence of AVs and HVs. First, social preferences and individual traits of a given human driver, e.g., selflessness and aggressiveness are unknown to an AV, and it is almost impossible to infer them in real-time during a short AV-HV interaction. Second, contrary to AVs that are expected to follow a policy, HVs do not necessarily follow a stationary policy and therefore are extremely hard to predict. To alleviate the above-mentioned challenges, we formulate the mixed-autonomy problem as a multi-agent reinforcement learning (MARL) problem and propose a decentralized framework and reward function for training cooperative AVs. Our approach enables AVs to learn the decision-making of HVs implicitly from experience, optimizes for a social utility while prioritizing safety and allowing adaptability; robustifying altruistic AVs to different human behaviors and constraining them to a safe action space. Finally, we investigate the robustness, safety and sensitivity of AVs to various HVs behavioral traits and present the settings in which the AVs can learn cooperative policies that are adaptable to different situations.

cs.RO

Towards Learning Generalizable Driving Policies from Restricted Latent Representations

Training intelligent agents that can drive autonomously in various urban and highway scenarios has been a hot topic in the robotics society within the last decades. However, the diversity of driving environments in terms of road topology and positioning of the neighboring vehicles makes this problem very challenging. It goes without saying that although scenario-specific driving policies for autonomous driving are promising and can improve transportation safety and efficiency, they are clearly not a universal scalable solution. Instead, we seek decision-making schemes and driving policies that can generalize to novel and unseen environments. In this work, we capitalize on the key idea that human drivers learn abstract representations of their surroundings that are fairly similar among various driving scenarios and environments. Through these representations, human drivers are able to quickly adapt to novel environments and drive in unseen conditions. Formally, through imposing an information bottleneck, we extract a latent representation that minimizes the \textit{distance} -- a quantification that we introduce to gauge the similarity among different driving configurations -- between driving scenarios. This latent space is then employed as the input to a Q-learning module to learn generalizable driving policies. Our experiments revealed that, using this latent representation can reduce the number of crashes to about half.

cs.RO

Altruistic Maneuver Planning for Cooperative Autonomous Vehicles Using Multi-agent Advantage Actor-Critic

With the adoption of autonomous vehicles on our roads, we will witness a mixed-autonomy environment where autonomous and human-driven vehicles must learn to co-exist by sharing the same road infrastructure. To attain socially-desirable behaviors, autonomous vehicles must be instructed to consider the utility of other vehicles around them in their decision-making process. Particularly, we study the maneuver planning problem for autonomous vehicles and investigate how a decentralized reward structure can induce altruism in their behavior and incentivize them to account for the interest of other autonomous and human-driven vehicles. This is a challenging problem due to the ambiguity of a human driver's willingness to cooperate with an autonomous vehicle. Thus, in contrast with the existing works which rely on behavior models of human drivers, we take an end-to-end approach and let the autonomous agents to implicitly learn the decision-making process of human drivers only from experience. We introduce a multi-agent variant of the synchronous Advantage Actor-Critic (A2C) algorithm and train agents that coordinate with each other and can affect the behavior of human drivers to improve traffic flow and safety.

cs.RO

Cooperative Autonomous Vehicles that Sympathize with Human Drivers

Widespread adoption of autonomous vehicles will not become a reality until solutions are developed that enable these intelligent agents to co-exist with humans. This includes safely and efficiently interacting with human-driven vehicles, especially in both conflictive and competitive scenarios. We build up on the prior work on socially-aware navigation and borrow the concept of social value orientation from psychology -- that formalizes how much importance a person allocates to the welfare of others -- in order to induce altruistic behavior in autonomous driving. In contrast with existing works that explicitly model the behavior of human drivers and rely on their expected response to create opportunities for cooperation, our Sympathetic Cooperative Driving (SymCoDrive) paradigm trains altruistic agents that realize safe and smooth traffic flow in competitive driving scenarios only from experiential learning and without any explicit coordination. We demonstrate a significant improvement in both safety and traffic-level metrics as a result of this altruistic behavior and importantly conclude that the level of altruism in agents requires proper tuning as agents that are too altruistic also lead to sub-optimal traffic flow. The code and supplementary material are available at: https://symcodrive.toghi.net/

cs.RO

Social Coordination and Altruism in Autonomous Driving

Despite the advances in the autonomous driving domain, autonomous vehicles (AVs) are still inefficient and limited in terms of cooperating with each other or coordinating with vehicles operated by humans. A group of autonomous and human-driven vehicles (HVs) which work together to optimize an altruistic social utility -- as opposed to the egoistic individual utility -- can co-exist seamlessly and assure safety and efficiency on the road. Achieving this mission without explicit coordination among agents is challenging, mainly due to the difficulty of predicting the behavior of humans with heterogeneous preferences in mixed-autonomy environments. Formally, we model an AV's maneuver planning in mixed-autonomy traffic as a partially-observable stochastic game and attempt to derive optimal policies that lead to socially-desirable outcomes using a multi-agent reinforcement learning framework. We introduce a quantitative representation of the AVs' social preferences and design a distributed reward structure that induces altruism into their decision making process. Our altruistic AVs are able to form alliances, guide the traffic, and affect the behavior of the HVs to handle competitive driving scenarios. As a case study, we compare egoistic AVs to our altruistic autonomous agents in a highway merging setting and demonstrate the emerging behaviors that lead to a noticeable improvement in the number of successful merges as well as the overall traffic flow and safety.

cs.RO

Performance Analysis of Cellular-V2X with Adaptive and Selective Power Control

LTE based Cellular Vehicle-To-Everything (C-V2X) allows vehicles to communicate with each other directly without the need for infrastructure and is expected to be a critical enabler for connected and autonomous vehicles. V2X communication based safety applications are built on periodic broadcast of basic safety messages with vehicle state information. Vehicles use this information to identify collision threats and take appropriate countermeasures. As the vehicle density increases, these broadcasts can congest the communication channel resulting in increased packet loss; fundamentally impacting the ability to identify threats in a timely manner. To address this issue, it is important to incorporate a congestion control mechanism. Congestion management scheme based on rate and power control has proved to be effective for DSRC. In this paper, we investigate the suitability of similar congestion control to C-V2X with particular focus on transmit power control. In our evaluation, we include periodic basic safety messages and high priority event messages that are generated when an event such as hard braking occurs. Our study reveals that while power control does not improve packet delivery performance of basic safety messages, it is beneficial to high priority event message delivery. In this paper, we investigate the reasons for this behavior using simulations and analysis.

cs.NI

A Maneuver-based Urban Driving Dataset and Model for Cooperative Vehicle Applications

Short-term future of automated driving can be imagined as a hybrid scenario in which both automated and human-driven vehicles co-exist in the same environment. In order to address the needs of such road configuration, many technology solutions such as vehicular communication and predictive control for automated vehicles have been introduced in the literature. Both aforementioned solutions rely on driving data of the human driver. In this work, we investigate the currently available driving datasets and introduce a real-world maneuver-based driving dataset that is collected during our urban driving data collection campaign. We also provide a model that embeds the patterns in maneuver-specific samples. Such model can be employed for classification and prediction purposes.

eess.SP

Spatio-temporal Dynamics of Cellular V2X Communication in Dense Vehicular Networks

Cellular Vehicle-to-everything (C-V2X) communication is a major V2X solution proposed and developed by the 3rd Generation Partnership Project (3GPP). Our previous work has studied scalability aspects of C-V2X and demonstrated its potential for accommodating large numbers of vehicles in dense vehicular scenarios. However, existing studies in the scientific literature mostly have a network-level approach to the problem and do not assess the temporal and spatial dynamics of C-V2X networks in heavy network load situations. In this work we shed light on the spatio-temporal characteristics of these networks and investigate the effectiveness of the congestion control algorithm in dense vehicular ad-hoc networks (VANETs) in terms of settling time, stability, and reliability to be employed for the purpose of safety-critical vehicular applications, where latency plays a major role.

eess.SY

Real-Time Hardware-In-the-Loop Emulation Framework for DSRC-based Connected Vehicle Applications

The rapid growth of connected and automated vehicle (CAV) solutions have made a significant impact on the safety of intelligent transportation systems. However, similar to any other emerging technology, thorough testing and evaluation studies are of paramount importance for the effectiveness of these solutions. Due to the safety-critical nature of this problem, large-scale real-world field tests do not seem to be a feasible and practical option. Thus, employing simulation and emulation approaches are preferred in the development phase of the safety-related applications in CAVs. Such methodologies not only mitigate the high cost of deploying large number of real vehicles, but also enable researchers to exhaustively perform repeatable tests in various scenarios. Software simulation of very large-scale vehicular scenarios is mostly a time consuming task and as a matter of fact, any simulation environment would include abstractions in order to model the real-world system. In contrast to the simulation-based solutions, network emulators are able to produce more realistic test environments. In this work, we propose a high-fidelity hardware-in-the-loop network emulator framework in order to create testing environments for vehicle-to-vehicle (V2V) communication. The proposed architecture is able to run in real-time fashion in contrast to other existing systems, which can potentially boost the development and validation of V2V systems.

cs.NI

Intelligent Wide-band Spectrum Classifier

We introduce a new technique for narrow-band (NB) signal classification in sparsely populated wide-band (WB) spectrum using supervised learning approach. For WB spectrum acquisition, Nyquist rate sampling is required at the receiver's analog-to-digital converter (ADC), hence we use compressed sensing (CS) theory to alleviate such high rate sampling requirement at the receiver ADC. From the estimated WB spectrum, we then extract various spectral features of each of the NB signal. These features are then used to train and classify each NB signal into its respective modulation using the random forest classifier. In the end, we evaluate the performance of the proposed algorithm under different empirical setups and verify its superior performance in comparison to a recently proposed signal classification algorithm.

eess.SP

Analysis of Distributed Congestion Control in Cellular Vehicle-to-everything Networks

Cellular Vehicle-to-everything (C-V2X) communication has been proposed in the 3rd Generation Partnership Project release 14 standard to address the latency and reliability requirements of cooperative safety applications. Such applications can involve highly congested vehicular scenarios where the network experiences high data loads. Thus, a sophisticated congestion control solution is vital in order to maintain the network performance required for safety-related applications. With the aid of our high-fidelity link-level network simulator, we investigate the feasibility of implementing the distributed congestion control algorithm specified in SAE J2945/1 standard on top of the C-V2X stack. We describe our implementation and evaluate the performance of transmission rate and range control mechanisms using relevant metrics. Additionally, we identify areas for potential design enhancements and further investigation.

cs.NI

V2X System Architecture Utilizing Hybrid Gaussian Process-based Model Structures

Scalable communication is of utmost importance for reliable dissemination of time-sensitive information in cooperative vehicular ad-hoc networks (VANETs), which is, in turn, an essential prerequisite for the proper operation of the critical cooperative safety applications. The model-based communication (MBC) is a recently-explored scalability solution proposed in the literature, which has shown a promising potential to reduce the channel congestion to a great extent. In this work, based on the MBC notion, a technology-agnostic hybrid model selection policy for Vehicle-to-Everything (V2X) communication is proposed which benefits from the characteristics of the non-parametric Bayesian inference techniques, specifically Gaussian Processes. The results show the effectiveness of the proposed communication architecture on both reducing the required message exchange rate and increasing the remote agent tracking precision.

eess.SP

MNIST Dataset Classification Utilizing k-NN Classifier with Modified Sliding-window Metric

The MNIST dataset of the handwritten digits is known as one of the commonly used datasets for machine learning and computer vision research. We aim to study a widely applicable classification problem and apply a simple yet efficient K-nearest neighbor classifier with an enhanced heuristic. We evaluate the performance of the K-nearest neighbor classification algorithm on the MNIST dataset where the $L2$ Euclidean distance metric is compared to a modified distance metric which utilizes the sliding window technique in order to avoid performance degradation due to slight spatial misalignments. The accuracy metric and confusion matrices are used as the performance indicators to compare the performance of the baseline algorithm versus the enhanced sliding window method and results show significant improvement using this proposed method.

cs.CV

Multiple Access in Cellular V2X: Performance Analysis in Highly Congested Vehicular Networks

Vehicle-to-everything (V2X) communication enables vehicles, roadside vulnerable users, and infrastructure facilities to communicate in an ad-hoc fashion. Cellular V2X (C-V2X), which was introduced in the 3rd generation partnership project (3GPP) release 14 standard, has recently received significant attention due to its perceived ability to address the scalability and reliability requirements of vehicular safety applications. In this paper, we provide a comprehensive study of the resource allocation of the C-V2X multiple access mechanism for high-density vehicular networks, as it can strongly impact the key performance indicators such as latency and packet delivery rate. Phenomena that can affect the communication performance are investigated and a detailed analysis of the cases that can cause possible performance degradation or system limitations, is provided. The results indicate that a unified system configuration may be necessary for all vehicles, as it is mandated for IEEE 802.11p, in order to obtain the optimum performance. In the end, we show the inter-dependence of different parameters on the resource allocation procedure with the aid of our high fidelity simulator.

cs.NI

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