A penalty search algorithm for the obstacle neutralization problem

DOI10.1016/J.COR.2014.08.013MaRDI QIDQ337275zbMATH OpenOpenAlexFDO

Authors Ali Fuat Alkaya, Vural Aksakalli, Carey E. Priebe

Publication date 10 November 2016

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

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

zbMATH Keywords

combinatorial optimizationpath planningsuboptimal algorithmweight-constrained shortest path

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for the obstacle neutralization problem
• Penalty-based algorithms for the stochastic obstacle scene problem
• Optimal obstacle placement with disambiguations
• Planning safe navigation routes through mined waters
• The reset disambiguation policy for navigating stochastic obstacle fields

Cites work

• scientific article; zbMATH DE number 1670670 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1517139 (Why is no real title available?)
• A dual algorithm for the constrained shortest path problem
• Aircraft routing under the risk of detection
• Algorithms for the weight constrained shortest path problem
• An algorithm for the resource constrained shortest path problem
• Convergent network approximation for the continuous Euclidean length constrained minimum cost path problem
• Flight string models for aircraft fleeting and routing
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• Optimal obstacle placement with disambiguations
• Random disambiguation paths for traversing a mapped hazard field
• Search space reduction in QoS routing.
• Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
• The reset disambiguation policy for navigating stochastic obstacle fields

Cited in

(4)

• Penalty-based algorithms for the stochastic obstacle scene problem
• The multiple shortest path problem with path deconfliction
• An optimal algorithm for the obstacle neutralization problem
• Optimal obstacle placement with disambiguations

This page was built for publication: A penalty search algorithm for the obstacle neutralization problem

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