Honey-pot constrained searching with local sensory information
- 1 November 2006
- journal article
- Published by Elsevier in Nonlinear Analysis
- Vol. 65 (9) , 1773-1793
- https://doi.org/10.1016/j.na.2005.10.049
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An Optimal Algorithm for Euclidean Shortest Paths in the PlaneSIAM Journal on Computing, 1999
- An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the PlaneDiscrete & Computational Geometry, 1997
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search ProblemOperations Research, 1990
- Technical Note—The Complexity of the Optimal Searcher Path ProblemOperations Research, 1986
- Feature Article—The Process of Search Planning: Current Approaches and Continuing ProblemsOperations Research, 1983
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- Discrete Sequential Search with Positive Switch CostMathematics of Operations Research, 1982
- A singular perturbation approach to modeling and control of Markov chainsIEEE Transactions on Automatic Control, 1981
- Experience with a Branch-and-Bound Algorithm for Constrained Searcher MotionPublished by Springer Nature ,1980
- Search for a moving target when searcher motion is restrictedComputers & Operations Research, 1979