Static target search path planning optimization with heterogeneous agents
From MaRDI portal
Publication:512934
DOI10.1007/s10479-016-2145-0zbMath1357.90093OpenAlexW2330511976MaRDI QIDQ512934
Nassirou Lo, Mohamed Barkaoui, Jean Berger
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2145-0
Applications of mathematical programming (90C90) Integer programming (90C10) Quadratic programming (90C20)
Related Items (1)
Uses Software
Cites Work
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Route optimization for multiple searchers
- Branch and bound methods for a search problem
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations
- Unnamed Item
- Unnamed Item
This page was built for publication: Static target search path planning optimization with heterogeneous agents