A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment

DOI10.1016/J.COR.2012.05.002zbMATH Open1349.90642OpenAlexW2166416212MaRDI QIDQ339716FDOQ339716

Authors: Jean Berger, Abdeslem Boukhtouta, Abdelhamid Benmoussa, Ossama Kettani 

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.002

Recommendations

• Planning high-level paths in hostile, dynamic, and uncertain environments
• An innovative multi-agent search-and-rescue path planning approach
• A discrete optimisation approach for target path planning whilst evading sensors
• An information theoretic based integer linear programming approach for the discrete search path planning problem
• scientific article; zbMATH DE number 5025426

zbMATH Keywords

path planningmixed-integer linear programmingconstrained shortest path

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• An algorithm for the resource constrained shortest path problem
• Aircraft routing under the risk of detection
• Title not available (Why is that?)
• The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
• The weighted region problem
• Experimental and Efficient Algorithms

Cited In (3)

• Extended multi-interval Legendre-Gauss-Radau pseudospectral method for mixed-integer optimal control problem in engineering
• A quantum computing based numerical method for solving mixed-integer optimal control problems
• Ant colony optimization for path planning in search and rescue operations

Uses Software

• CPLEX

This page was built for publication: A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339716)