A discrete optimisation approach for target path planning whilst evading sensors
From MaRDI portal
Publication:2669689
Recommendations
- Evasion of a moving object from detection by a system of observers: sensor-maneuvering search means
- Evasive path planning under surveillance uncertainty
- Sensor planning for elusive targets
- An information theoretic based integer linear programming approach for the discrete search path planning problem
- Static target search path planning optimization with heterogeneous agents
Cites work
- A bilevel exposure-oriented sensor location problem for border security
- A biobjective Dijkstra algorithm
- A comparison of solution strategies for biobjective shortest path problems
- A cooperative pursuit-evasion game in wireless sensor and actor networks
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- A note on two problems in connexion with graphs
- An exact method for the biobjective shortest path problem for large-scale road networks
- 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
- Solution of David Gale's lion and man problem
- “Lion and Man”: A Postscript
Cited in
(4)- Sensor planning for elusive targets
- A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment
- Optimal Opponent Stealth Trajectory Planning Based on an Efficient Optimization Technique
- A discrete optimisation approach for target path planning whilst evading sensors
This page was built for publication: A discrete optimisation approach for target path planning whilst evading sensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669689)