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

DOI10.1007/S11590-015-0874-7zbMath1335.90079OpenAlexW2053680637MaRDI QIDQ895784

Abdeslem Boukhtouta, Nassirou Lo, Jean Berger, Noël, Martin

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) Integer programming (90C10) Combinatorial optimization (90C27)

Uses Software

• CPLEX

Cites Work

• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• On Probabilistic Search Decisions under Searcher Motion Constraints
• Branch and bound methods for a search problem
• Elements of Information Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: An information theoretic based integer linear programming approach for the discrete search path planning problem