An information theoretic based integer linear programming approach for the discrete search path planning problem

DOI10.1007/S11590-015-0874-7MaRDI QIDQ895784zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

linear programmingcombinatorial optimizationinformation theorynetwork flowsearch path planningopen-loop with anticipated feedback

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)

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

Cites work

• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 739166 (Why is no real title available?)
• Branch and bound methods for a search problem
• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• Elements of Information Theory
• 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

Describes a project that uses

Uses Software

• CPLEX

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)