Planning a multi-sensors search for a moving target considering traveling costs

DOI10.1016/j.ejor.2020.11.012zbMath1487.90343OpenAlexW3099552436MaRDI QIDQ2030597

André Rossi, Marc Sevaux, Patrick Jaillet, Florian Delavernhe

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.012

zbMATH Keywords

combinatorial optimizationnonlinear optimizationsearch theorymoving targetmulti-sensors search

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Related Items

A competitive search game with a moving target, A discrete optimisation approach for target path planning whilst evading sensors

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DC programming approach for planning a multisensor multizone search for a target
• A hierarchical approach for planning a multisensor multizone search for a moving target
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Solving the moving target search problem using indistinguishable searchers
• On the Lambert \(w\) function
• Search for an immobile hider on a stochastic network
• Search for an immobile hider in a known subset of a network
• SEARCH GAMES: LITERATURE AND SURVEY
• Integer Programming Formulation of Traveling Salesman Problems
• Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
• Optimal Search for a Moving Target in Discrete Time and Space
• Search Games with Mobile and Immobile Hider
• A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target
• The Traveling Salesman Problem: A Survey
• A Survey of Search Theory