Theoretical Computer Science
The Canadian Traveller Problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Adaptive source routing in high-speed networks
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
A system for multi-agent coordination in uncertain environments
Proceedings of the fifth international conference on Autonomous agents
Coordination for Multi-Robot Exploration and Mapping
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A note on the k-Canadian Traveller Problem
Information Processing Letters
| Hi-index | 0.00 |
This paper studies a variation of the online k-Canadian Traveler Problem (k-CTP), in which there are multiple travelers who can communicate with each other, to share real-time blockage information of the edges. We study two different communication levels for the problem, complete communication (where all travelers can receive and send blockage information with each other) and limited communication (where only some travelers can both receive and send information while the others can only receive information). The objective is that at least one traveler finds a feasible route from the origin to the destination with as small cost as possible. We give lower bounds on the competitive ratio for both the two communication levels. Considering the urban traffic environment, we propose the Retrace-Alternating strategy and Greedy strategy for both the two communication levels, and prove that increasing the number of travelers with complete communication ability may not always improve the competitive ratio of online strategies.