Arrow Research search
Back to IROS

IROS 2020

A Game-Theoretic Strategy-Aware Interaction Algorithm with Validation on Real Traffic Data

Conference Paper Accepted Paper Artificial Intelligence ยท Robotics

Abstract

Interactive decision-making and motion planning are important to safety-critical autonomous agents, particularly when they interact with humans. Many different interaction strategies can be exploited by humans. For instance, they might ignore the autonomous agents, or might behave as selfish optimizers by treating the autonomous agents as opponents, or might assume themselves as leaders and the autonomous agents as followers who should take responsive actions. Different interaction strategies can lead to quite different closed-loop dynamics, and misalignment between the human's policy and the autonomous agent's belief over the policy will severely impact both safety and efficiency. Moreover, a human's interaction policy can change as interaction goes on. Hence, autonomous agents need to be aware of such uncertainties on the human policy, and integrate such information into their decision-making and motion planning algorithms. In this paper, we propose a policy-aware interaction strategy based on game theory. The goal is to allow autonomous agents to estimate humans' interactive policies and respond consequently. We validate the proposed algorithm with a roundabout scenario with real traffic data. The results show that the proposed algorithm can yield trajectories that are more similar to the ground truth than those with fixed policies. Also, we estimate how humans adjust their interaction strategies statistically based on the proposed algorithm.

Authors

Keywords

  • Uncertainty
  • Switches
  • Autonomous agents
  • Inference algorithms
  • Trajectory
  • Planning
  • Safety
  • Real Traffic Data
  • Path Planning
  • Interaction Strategies
  • Time Step
  • Bayesian Inference
  • Cost Function
  • Autonomous Vehicles
  • Best Response
  • Speed Limit
  • Model Predictive Control
  • Pareto Optimal
  • Reward Function
  • Bayesian Algorithm
  • Nash Equilibrium
  • Cooperative Strategy
  • Tree Search
  • Tree Depth
  • Human Drivers
  • Game Strategy
  • Monte Carlo Tree Search
  • Merging Point
  • Two-player Game
  • Monte Carlo Tree
  • Root Node
  • Statistical Results

Context

Venue
IEEE/RSJ International Conference on Intelligent Robots and Systems
Archive span
1988-2025
Indexed papers
26578
Paper id
583456382092766535
v2026.09.13