Repeated-task Canadian traveler problem

Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony, Dror Fried, Olga Maksin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In the Canadian Traveler Problem (CTP) a traveling agent is given a graph, where some of the edges may be blocked, with a known probability. A solution for CTP is a policy, that has the smallest expected traversal cost. CTP is intracable. Previous work has focused on the case of a single agent. We generalize CTP to a repeated task version where a number of agents need to travel to the same goal, minimizing their combined travel cost. We provide optimal algorithms for the special case of disjoint path graphs. Based on a previous UCT-based approach for the single agent case, a framework is developed for the multi-agent case and four variants are given - two of which are based on the results for disjoint-path graphs. Empirical results show the benefits of the suggested framework and the resulting heuristics. For small graphs where we could compare to optimal policies, our approach achieves near-optimal results at only a fraction of the computation cost.

Original languageEnglish
Title of host publicationProceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011
Number of pages7
StatePublished - 1 Dec 2011
Event4th International Symposium on Combinatorial Search, SoCS 2011 - Barcelona, Spain
Duration: 15 Jul 201116 Jul 2011

Publication series

NameProceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011


Conference4th International Symposium on Combinatorial Search, SoCS 2011

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'Repeated-task Canadian traveler problem'. Together they form a unique fingerprint.

Cite this