The k-canadian travelers problem with communication

Authors:
Huili Zhang;Yinfeng Xu
Affiliations:
School of Management, Xi'an JiaoTong University, Xi'an, China and State Key Lab for Manufacturing Systems Engineering, Xi'an, China and Ministry of Education Key Lab for Process Control & Effi ...;School of Management, Xi'an JiaoTong University, Xi'an, China and State Key Lab for Manufacturing Systems Engineering, Xi'an, China and Ministry of Education Key Lab for Process Control & Effi ...
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 7
Cited 0

Shortest paths without a map

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the online point of view, this paper studies a variation of the k-Canadian Traveler Problem (k-CTP), in which there are multiple travelers who communicate with each other to share real-time information. The objective is to find a route from the origination to the destination as soon as possible. Based on different communication levels, we consider two problems with full communication(P1) and with limited communication(P2) respectively. We present lower bounds for the two problems respectively. Considering the urban traffic environment, we propose a Retrace-Alternating strategy for both problems, and prove that increasing the proportion of full communication travelers may not always improve the competitive performance of online strategies.