A discrete optimisation approach for target path planning whilst evading sensors
From MaRDI portal
Publication:2669689
DOI10.1016/j.cor.2021.105587OpenAlexW3202313047MaRDI QIDQ2669689
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.08826
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- A cooperative pursuit-evasion game in wireless sensor and actor networks
- A comparison of solution strategies for biobjective shortest path problems
- A bilevel exposure-oriented sensor location problem for border security
- A biobjective Dijkstra algorithm
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Optimizing source and receiver placement in multistatic sonar networks to monitor fixed targets
- Planning a multi-sensors search for a moving target considering traveling costs
- Robust scheduling for target tracking using wireless sensor networks
- An exact method for the biobjective shortest path problem for large-scale road networks
- “Lion and Man”: A Postscript
- Solution of David Gale's lion and man problem
This page was built for publication: A discrete optimisation approach for target path planning whilst evading sensors
