Intent Demonstration in General-Sum Dynamic Games via Iterative Linear-Quadratic Approximations

Abstract (excerpt)

Autonomous agents should coordinate effectively without prior knowledge of others' intents. While prior work has focused on intent inference, we address the inverse problem: how agents can strategically demonstrate their intents within general-sum dynamic games. We model this problem and propose an algorithm that balances intent demonstration with task performance. To handle nonlinear dynamic games with continuous state-action spaces, our method leverages iterative linear-quadratic game approximations and provides efficient intent-teaching guarantees: the uncertain agent's belief can be driven

Excerpt shown for reference under fair use — read the full paper at the publisher.

Related failures