An optimal algorithm for the obstacle neutralization problem
From MaRDI portal
Publication:2628188
DOI10.3934/jimo.2016049zbMath1364.90284OpenAlexW2512995755MaRDI QIDQ2628188
Publication date: 12 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016049
Related Items (1)
Cites Work
- Unnamed Item
- A penalty search algorithm for the obstacle neutralization problem
- Search space reduction in QoS routing.
- Optimal obstacle placement with disambiguations
- Algorithms for the Weight Constrained Shortest Path Problem
- Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
- The reset disambiguation policy for navigating stochastic obstacle fields
- Aircraft routing under the risk of detection
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- A dual algorithm for the constrained shortest path problem
- Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem
- Finding the K Shortest Loopless Paths in a Network
- Random disambiguation paths for traversing a mapped hazard field
This page was built for publication: An optimal algorithm for the obstacle neutralization problem