Repeated-task Canadian traveler problem

DOI10.3233/AIC-150665MaRDI QIDQ4589110zbMATH OpenOpenAlexWikidataFDO

Authors Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon E. Shimony

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-150665

zbMATH Keywords

Monte-Carlo tree searchnavigationUCTuncertainty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• Complexity of Canadian traveler problem variants
• Generalized Canadian traveller problems
• The Canadian Traveller Problem and its competitive analysis
• Canadians should travel randomly

Cited in

(6)

• The Canadian Traveller Problem and its competitive analysis
• Multiple canadians on the road: minimizing the distance competitive ratio
• The covering Canadian traveller problem
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• Complexity of Canadian traveler problem variants
• Canadian traveller problem with predictions

This page was built for publication: Repeated-task Canadian traveler problem

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