Trustworthiness of Optimality Condition Violation in Inverse Dynamic Game Methods Based on the Minimum Principle

In this work, we analyze the applicability of Inverse Dynamic Game (IDG) methods based on the Minimum Principle (MP). The IDG method determines unknown cost functions in a single- or multi-agent setting from observed system trajectories by minimizing the so-called residual error, i.e. the extent to which the optimality conditions of the MP are violated with a current guess of cost functions. The main assumption of the IDG method to recover cost functions such that the resulting trajectories match the observed ones is that the given trajectories are the result of a Dynamic Game (DG) problem with known parameterized cost function structures. However, in practice, when the IDG method is used to identify the behavior of unknown agents, e.g. humans, this assumption cannot be guaranteed. Hence, we introduce the notion of the trustworthiness of the residual error and provide necessary conditions for it to define when the IDG method based on the MP is applicable to such problems. From the necessary conditions, we conclude that the MP-based IDG method cannot be used to validate DG models for unknown agents but can yield under certain conditions robust parameter identifications, e.g. to measurement noise. Finally, we illustrate these conclusions by validating a DG model for the collision avoidance behavior between two mobile robots with human operators.

Authors

Institutions

Publication Details

Published
2024-08-21
DOI
https://doi.org/10.1109/ccta60707.2024.10666619
Citations
1
Primary Topic
Guidance and Control Systems
Type
article
Field-Weighted Citation Impact
1.30

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Trustworthiness of Optimality Condition Violation in Inverse Dynamic Game Methods Based on the Minimum Principle

Philipp Karg, Bálint Varga, Sören Hohmann, Adrian Kienzle et al.
1 citations
Guidance and Control Systems
1.30
article

Trustworthiness of Optimality Condition Violation in Inverse Dynamic Game Methods Based on the Minimum Principle

Philipp Karg, Bálint Varga, Sören Hohmann, Adrian Kienzle, Jonas Kaub
article en
1 citations

Abstract

In this work, we analyze the applicability of Inverse Dynamic Game (IDG) methods based on the Minimum Principle (MP). The IDG method determines unknown cost functions in a single- or multi-agent setting from observed system trajectories by minimizing the so-called residual error, i.e. the extent to which the optimality conditions of the MP are violated with a current guess of cost functions. The main assumption of the IDG method to recover cost functions such that the resulting trajectories match the observed ones is that the given trajectories are the result of a Dynamic Game (DG) problem with known parameterized cost function structures. However, in practice, when the IDG method is used to identify the behavior of unknown agents, e.g. humans, this assumption cannot be guaranteed. Hence, we introduce the notion of the trustworthiness of the residual error and provide necessary conditions for it to define when the IDG method based on the MP is applicable to such problems. From the necessary conditions, we conclude that the MP-based IDG method cannot be used to validate DG models for unknown agents but can yield under certain conditions robust parameter identifications, e.g. to measurement noise. Finally, we illustrate these conclusions by validating a DG model for the collision avoidance behavior between two mobile robots with human operators.

Karlsruhe Institute of Technology (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 13%
Guidance and Control Systems
1.30
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.