Constrained Probabilistic Search for a One-Dimensional Random Walker


This paper addresses a fundamental search problem in which a searcher subject to time and energy constraints tries to find a mobile target. The target's motion is modeled as a random walk on a discrete set of points on a line segment. At each time step, the target chooses one of the adjacent nodes at random and moves there. We study two detection models. In… (More)
DOI: 10.1109/TRO.2015.2513751


16 Figures and Tables

Cite this paper

@article{Noori2016ConstrainedPS, title={Constrained Probabilistic Search for a One-Dimensional Random Walker}, author={Narges Noori and Alessandro Renzaglia and Joshua Vander Hook and Volkan Isler}, journal={IEEE Transactions on Robotics}, year={2016}, volume={32}, pages={261-274} }