An information theoretic based integer linear programming approach for the discrete search path planning problem
DOI10.1007/S11590-015-0874-7zbMATH Open1335.90079OpenAlexW2053680637MaRDI QIDQ895784FDOQ895784
Authors: Jean Berger, Nassirou Lo, Abdeslem Boukhtouta, Martin Noël
Publication date: 4 December 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0874-7
Recommendations
- An innovative multi-agent search-and-rescue path planning approach
- Static target search path planning optimization with heterogeneous agents
- Route optimization for multiple searchers
- Search-trajectory optimization. I: Formulation and theory
- Using multiple searchers in constrained-path, moving-target search problems
linear programmingcombinatorial optimizationinformation theorynetwork flowsearch path planningopen-loop with anticipated feedback
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Elements of Information Theory
- Title not available (Why is that?)
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Branch and bound methods for a search problem
- Title not available (Why is that?)
- On probabilistic search decisions under searcher motion constraints
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
Cited In (4)
- A discrete optimisation approach for target path planning whilst evading sensors
- A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment
- An evolutionary approach for the target search problem in uncertain environment
- Static target search path planning optimization with heterogeneous agents
Uses Software
This page was built for publication: An information theoretic based integer linear programming approach for the discrete search path planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895784)