# On the Transit Obfuscation Problem

arXiv: https://arxiv.org/abs/2402.07420 · HTML: https://mlsanity.com/paper/2402.07420/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 4 of its 20 references that are in the map.
- First posted on arXiv 12 Feb 2024.

## Builds on (most cited first, 4 of 4)

- [Explicability? Legibility? Predictability? Transparency? Privacy? Security? The Emerging Landscape of Interpretable Agent Behavior](https://mlsanity.com/paper/1811.09722/) (2018)
- [A Unified Framework for Planning in Adversarial and Cooperative Environments](https://mlsanity.com/paper/1802.06137/) (2018)
- [Deceptive Decision-Making Under Uncertainty](https://mlsanity.com/paper/2109.06740/) (2021)
- [Deceptive Reinforcement Learning in Model-Free Domains](https://mlsanity.com/paper/2303.10838/) (2023)

## Built on by (most cited first, 1 of 1)

- [Value of Information-based Deceptive Path Planning Under Adversarial Interventions](https://mlsanity.com/paper/2503.24284/) (2025)

## Abstract (arXiv)

Concealing an intermediate point on a route or visible from a route is an important goal in some transportation and surveillance scenarios. This paper studies the Transit Obfuscation Problem, the problem of traveling from some start location to an end location while "covering" a specific transit point that needs to be concealed from adversaries. We propose the notion of transit anonymity, a quantitative guarantee of the anonymity of a specific transit point, even with a powerful adversary with full knowledge of the path planning algorithm. We propose and evaluate planning/search algorithms that satisfy this anonymity criterion.