Search arXivSearch

arXiv · 2510.15573

Hypergame-based Cognition Modeling and Intention Interpretation for Human-Driven Vehicles in Connected Mixed Traffic

Abstract

With the practical implementation of connected and autonomous vehicles (CAVs), the traffic system is expected to remain a mix of CAVs and human-driven vehicles (HVs) for the foreseeable future. To enhance safety and traffic efficiency, the trajectory planning strategies of CAVs must account for the influence of HVs, necessitating accurate HV trajectory prediction. Current research often assumes that human drivers have perfect knowledge of all vehicles' objectives, an unrealistic premise. This paper bridges the gap by leveraging hypergame theory to account for cognitive and perception limitations in HVs. We model human bounded rationality without assuming them to be merely passive followers and propose a hierarchical cognition modeling framework that captures cognitive relationships among vehicles. We further analyze the cognitive stability of the system, proving that the strategy profile where all vehicles adopt cognitively equilibrium strategies constitutes a hyper Nash equilibrium when CAVs accurately learn HV parameters. To achieve this, we develop an inverse learning algorithm for distributed intention interpretation via vehicle-to-everything (V2X) communication, which extends the framework to both offline and online scenarios. Additionally, we introduce a distributed trajectory prediction and planning approach for CAVs, leveraging the learned parameters in real time. Simulations in highway lane-changing scenarios demonstrate the proposed method's accuracy in parameter learning, robustness to noisy trajectory observations, and safety in HV trajectory prediction. The results validate the effectiveness of our method in both offline and online implementations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianguo Chen, Zhengqin Liu, Jinlong Lei, Peng Yi, Yiguang Hong, Hong Chen. 2025-10-17. Hypergame-based Cognition Modeling and Intention Interpretation for Human-Driven Vehicles in Connected Mixed Traffic. https://arxiv.org/abs/2510.15573

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY