Trajectory optimization under kinematical constraints for moving target search
From MaRDI portal
Publication:1651570
DOI10.1016/j.cor.2016.12.016zbMath1391.90339MaRDI QIDQ1651570
Martin Zsifkovits, Manon Raap, Stefan Pickl
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.016
integer linear programming; search theory; moving targets; aerial vehicles; search path optimization
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B40: Search theory
90B10: Deterministic network models in operations research
Related Items
Control variable parameterisation with penalty approach for hypersonic vehicle reentry optimisation, Moving target search optimization -- a literature review, Ant colony optimization for path planning in search and rescue operations, Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
Uses Software
Cites Work
- Unnamed Item
- Optimal search for moving targets
- A DC programming approach for planning a multisensor multizone search for a target
- An innovative multi-agent search-and-rescue path planning approach
- Optimal search-relocation trade-off in Markovian-target searching
- Theory of optimal search
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- Path optimization for the resource-constrained searcher
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Branch and bound methods for a search problem
- Markov Chains
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- Using multiple searchers in constrained-path, moving-target search problems
- The Maximum Weight Connected Subgraph Problem
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
