An AO* Based Exact Algorithm for the Canadian Traveler Problem

DOI10.1287/ijoc.2015.0668zbMath1338.90278OpenAlexW2267848830MaRDI QIDQ2806869

Vural Aksakalli, Ibrahim Ari, O. Furkan Sahin

Publication date: 19 May 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2015.0668

zbMATH Keywords

path planningMarkov decision processCanadian traveler problem\(\mathrm{AO}^{*}\) search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40)

Related Items (1)

The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem

Cites Work

• Complexity of Canadian traveler problem variants
• Shortest paths without a map
• Probabilistic planning with clear preferences on missing information
• The Canadian Traveller Problem and its competitive analysis
• Approximate receding horizon approach for Markov decision processes: average reward case
• Near-optimal reinforcement learning in polynomial time
• Optimal obstacle placement with disambiguations
• An admissible and optimal algorithm for searching AND/OR graphs
• Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
• The reset disambiguation policy for navigating stochastic obstacle fields
• The Linear Programming Approach to Approximate Dynamic Programming
• Optimizing decision trees through heuristically guided search
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• Random disambiguation paths for traversing a mapped hazard field

This page was built for publication: An AO^* Based Exact Algorithm for the Canadian Traveler Problem