TAB-Fields: A Maximum Entropy Framework for Mission-Aware Adversarial Planning
Not on the map. Why?
Abstract (arXiv)
Autonomous agents operating in adversarial scenarios face a fundamental challenge: while they may know their adversaries' high-level objectives, such as reaching specific destinations within time constraints, the exact policies these adversaries will employ remain unknown. Traditional approaches address this challenge by treating the adversary's state as a partially observable element, leading to a formulation as a Partially Observable Markov Decision Process (POMDP). However, the induced belief-space dynamics in a POMDP require knowledge of the system's transition dynamics, which, in this case, depend on the adversary's unknown policy. Our key observation is that while an adversary's exact policy is unknown, their behavior is necessarily constrained by their mission objectives and the physical environment, allowing us to characterize the space of possible behaviors without assuming specific policies. In this paper, we develop Task-Aware Behavior Fields (TAB-Fields), a representation that captures adversary state distributions over time by computing the most unbiased probability distribution consistent with known constraints. We construct TAB-Fields by solving a constrained optimization problem that minimizes additional assumptions about adversary behavior beyond mission and environmental requirements. We integrate TAB-Fields with standard planning algorithms by introducing TAB-conditioned POMCP, an adaptation of Partially Observable Monte Carlo Planning. Through experiments in simulation with underwater robots and hardware implementations with ground robots, we demonstrate that our approach achieves superior performance compared to baselines that either assume specific adversary policies or neglect mission constraints altogether. Evaluation videos and code are available at https://tab-fields.github.io.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 49 references that are in the map. First posted on arXiv 3 Dec 2024.
Builds on
14 of 49 references.
References · 14
- 2018A Survey of Inverse Reinforcement Learning: Challenges, Methods and Progresscited by 294
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2020Robust Deep Reinforcement Learning against Adversarial Perturbations on State Observationscited by 235
- 2016DESPOT: Online POMDP Planning with Regularizationcited by 105
- 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 81
- 2021Review of Pedestrian Trajectory Prediction Methods: Comparing Deep Learning and Knowledge-based Approachescited by 30
- 2018Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraintscited by 11
- 2023Robust Markov Decision Processes without Model Estimationcited by 11
- 2019Exploration-Exploitation Trade-off in Reinforcement Learning on Online Markov Decision Processes with Global Concave Rewardscited by 8
- 2020Decentralized MCTS via Learned Teammate Modelscited by 6
- 2021Multi-Robot Coordination and Planning in Uncertain and Adversarial Environmentscited by 6
- 2018Efficient Dependency-Guided Named Entity Recognitioncited by 5
Built on by
Citing papers per year: 2025: 2.
2 papers.