4 papers
Adversarial Graph Traversal
David Banks, Elvan Ceyhan, Leah Johnson +1
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who c…
Stochastic Path Planning in Correlated Obstacle Fields
Li Zhou, Elvan Ceyhan
We introduce the Stochastic Correlated Obstacle Scene (SCOS) problem, a navigation setting with spatially correlated obstacles of uncertain blockage status, realistically constrain…
Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
Li Zhou, Elvan Ceyhan, Polat Charyyev
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. W…
Solving the Constrained Random Disambiguation Path Problem via Lagrangian Relaxation and Graph Reduction
Li Zhou, Elvan Ceyhan
We study a resource-constrained variant of the Random Disambiguation Path (RDP) problem, a generalization of the Stochastic Obstacle Scene (SOS) problem, in which a navigating agen…