Moving target search optimization -- a literature review
From MaRDI portal
Publication:1722971
DOI10.1016/j.cor.2019.01.004zbMath1458.90391OpenAlexW2910887935WikidataQ128559013 ScholiaQ128559013MaRDI QIDQ1722971
Silja Meyer-Nieberg, Manon Raap, Michael Preuß
Publication date: 19 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.01.004
Search theory (90B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
Bounded-error target localization and tracking using a fleet of UAVs ⋮ Ant colony optimization for path planning in search and rescue operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal search for moving targets
- Search-trajectory optimization. I: Formulation and theory
- Search-trajectory optimization. II: Algorithms and computations
- Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
- Optimal search-relocation trade-off in Markovian-target searching
- Optimal strategy of route and look for the path constrained search problem with reward criterion
- Trajectory optimization under kinematical constraints for moving target search
- Aerial vehicle search-path optimization: a novel method for emergency operations
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- Route optimization for multiple searchers
- Path optimization for the resource-constrained searcher
- Search for a Moving Target: The FAB Algorithm
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Optimizing search with positive information feedback
- Branch and bound methods for a search problem
- Criteria and approximate methods for path-constrained moving-target search problems
- Using multiple searchers in constrained-path, moving-target search problems
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- On Information and Sufficiency
This page was built for publication: Moving target search optimization -- a literature review
