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(P 1) and with limited communication(P 2) 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84, 127–150 (1991)
Bar-Noy, A., Schieber, B.: The Canadian Traveller Problem.In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms, pp. 261–270, San Francisco (1991)
Westphal, S.: A note on the k-Canadian Traveler Problem. Information Processing Letter 106, 87–89 (2008)
Xu, Y.F., Hu, M.L., Su, B., Zhu, B.H., Zhu, Z.J.: The Canadian Traveller Problem and its competitive analysis. Journal of combinatorial optimization 18, 195–205 (2009)
Su, B., Xu, Y.F.: Online recoverable Canadian Traveler Problem on a road. Information 7, 477–486 (2004)
Itai, A., Shachnai, H.: Adaptive source routing in high-speed networks. Journal of Algorithms 20, 218–243 (1996)
Burgard, W., Fox, D., Moors, M., Simmons, R., Thrun, S.: Collaborative multi-robot exploration. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), San Francisco, pp. 476–481 (2000)
Simmons, R., Apfelbaum, D., Burgard, W., Fox, M., Moors, D., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, Austin, pp. 852–858 (2000)
Lita, L.V., Schulte, J., Thrun, S.: A System for Multi-Agent Coordination in Uncertain Environments. In: Proceedings of the Fifth International Conference on Autonomous Agents, Montreal, pp. 21–22 (2001)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Xu, Y. (2011). The k-Canadian Travelers Problem with Communication. In: Atallah, M., Li, XY., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 6681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21204-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-21204-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21203-1
Online ISBN: 978-3-642-21204-8
eBook Packages: Computer ScienceComputer Science (R0)