Papers › A model of communication-enabled traffic interactions

A model of communication-enabled traffic interactions

13 Apr 2023arXiv:2304.06604links table onlyarchive 2025-07-28

O. Siebinga, A. Zgonnikov, D. A. Abbink

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

A major challenge for autonomous vehicles is handling interactive scenarios, such as highway merging, with human-driven vehicles. A better understanding of human interactive behaviour could help address this challenge. Such understanding could be obtained through modelling human behaviour. However, existing modelling approaches predominantly neglect communication between drivers and assume that some drivers in the interaction only respond to others, but do not actively influence them. Here we argue that addressing these two limitations is crucial for accurate modelling of interactions. We propose a new computational framework addressing these limitations. Similar to game-theoretic approaches, we model the interaction in an integral way rather than modelling an isolated driver who only responds to their environment. Contrary to game theory, our framework explicitly incorporates communication and bounded rationality. We demonstrate the model in a simplified merging scenario, illustrating that it generates plausible interactive behaviour (e.g., aggressive and conservative merging). Furthermore, human-like gap-keeping behaviour emerged in a car-following scenario directly from risk perception without the explicit implementation of time or distance gaps in the model's decision-making. These results suggest that our framework is a promising approach to interaction modelling that can support the development of interaction-aware autonomous vehicles.

PaperPDFCode

Code

tud-hri/cei-model officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections