Honey-pot constrained searching with local sensory information

DOI10.1016/j.na.2005.10.049zbMath1138.90402OpenAlexW2103649577MaRDI QIDQ2507866

James Riehl, João P. Hespanha, Bhaskar Das Gupta

Publication date: 5 October 2006

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2005.10.049

Mathematics Subject Classification ID

Search theory (90B40) Discrete-time control/observation systems (93C55) Approximation algorithms (68W25)

Related Items (4)

Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ Detection of an anomalous cluster in a network ⋮ Cluster detection in networks using percolation ⋮ Detecting a Path of Correlations in a Network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of optimal search
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• A singular perturbation approach to modeling and control of Markov chains
• Discrete Sequential Search with Positive Switch Cost
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Hamilton Paths in Grid Graphs
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Honey-pot constrained searching with local sensory information