Competition-Aware Decision-Making Approach for Mobile Robots in Racing Scenarios

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ji, Kyoungtae, Bae, Sangjae, Li, Nan, Han, Kyoungseok
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911820807143424
author Ji, Kyoungtae
Bae, Sangjae
Li, Nan
Han, Kyoungseok
author_facet Ji, Kyoungtae
Bae, Sangjae
Li, Nan
Han, Kyoungseok
contents This paper presents a game-theoretic strategy for racing, where the autonomous ego agent seeks to block a racing opponent that aims to overtake the ego agent. After a library of trajectory candidates and an associated reward matrix are constructed, the optimal trajectory in terms of maximizing the cumulative reward over the planning horizon is determined based on the level-K reasoning framework. In particular, the level of the opponent is estimated online according to its behavior over a past window and is then used to determine the trajectory for the ego agent. Taking into account that the opponent may change its level and strategy during the decision process of the ego agent, we introduce a trajectory mixing strategy that blends the level-K optimal trajectory with a fail-safe trajectory. The overall algorithm was tested and evaluated in various simulated racing scenarios, which also includes human-in-the-loop experiments. Comparative analysis against the conventional level-K framework demonstrates the superiority of our proposed approach in terms of overtake-blocking success rates.
format Preprint
id arxiv_https___arxiv_org_abs_2404_00520
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Competition-Aware Decision-Making Approach for Mobile Robots in Racing Scenarios
Ji, Kyoungtae
Bae, Sangjae
Li, Nan
Han, Kyoungseok
Robotics
Optimization and Control
This paper presents a game-theoretic strategy for racing, where the autonomous ego agent seeks to block a racing opponent that aims to overtake the ego agent. After a library of trajectory candidates and an associated reward matrix are constructed, the optimal trajectory in terms of maximizing the cumulative reward over the planning horizon is determined based on the level-K reasoning framework. In particular, the level of the opponent is estimated online according to its behavior over a past window and is then used to determine the trajectory for the ego agent. Taking into account that the opponent may change its level and strategy during the decision process of the ego agent, we introduce a trajectory mixing strategy that blends the level-K optimal trajectory with a fail-safe trajectory. The overall algorithm was tested and evaluated in various simulated racing scenarios, which also includes human-in-the-loop experiments. Comparative analysis against the conventional level-K framework demonstrates the superiority of our proposed approach in terms of overtake-blocking success rates.
title Competition-Aware Decision-Making Approach for Mobile Robots in Racing Scenarios
topic Robotics
Optimization and Control
url https://arxiv.org/abs/2404.00520