Navigation algorithms for optimal pathfinding in the stochastic obstacle scene problem

DOI10.1051/RO/2026063MaRDI QIDQ7348867zbMATH OpenFDO

Authors Elvan Ceyhan, Polat Charyyev, Li Zhou

Publication date 15 September 2026

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2026063

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Stochastic programming (90C15) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A Limited Memory Algorithm for Bound Constrained Optimization
• A note on the k-Canadian traveller problem
• A note on two problems in connexion with graphs
• A penalty search algorithm for the obstacle neutralization problem
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• scientific article; zbMATH DE number 432827 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Optimal obstacle placement with disambiguations
• Penalty-based algorithms for the stochastic obstacle scene problem
• Random disambiguation paths for traversing a mapped hazard field
• Repeated-task Canadian traveler problem
• Shortest paths without a map
• The Canadian Traveller Problem and its competitive analysis
• The reset disambiguation policy for navigating stochastic obstacle fields

This page was built for publication: Navigation algorithms for optimal pathfinding in the stochastic obstacle scene problem

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