Walking in streets with minimal sensing
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-014-9791-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Jian Tang & Guoliang Xue & Weiyi Zhang, 2006. "Reliable Ad Hoc Routing Based on Mobility Prediction," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 71-85, February.
- Danny Z. Chen & Xiaobo (Sharon) Hu & Jinhui Xu, 2003. "Computing Optimal Beams in Two and Three Dimensions," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 111-136, June.
- Yinfeng Xu & Maolin Hu & Bing Su & Binhai Zhu & Zhijun Zhu, 2009. "The canadian traveller problem and its competitive analysis," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 195-205, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
- Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
- Davood Shiri & Hakan Tozan, 2022. "Online routing and searching on graphs with blocked edges," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1039-1059, September.
- Chung-Shou Liao & Yamming Huang, 2015. "Generalized Canadian traveller problems," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 701-712, May.
- Vural Aksakalli & Ibrahim Ari, 2014. "Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 370-384, May.
- Sahin, Halenur & Kara, Bahar Yetis & Karasan, Oya Ekin, 2016. "Debris removal during disaster response: A case for Turkey," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 49-59.
- Yam Ki Cheung & Ovidiu Daescu, 2011. "Line facility location in weighted regions," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 52-70, July.
- Marco Bender & Stephan Westphal, 2015. "An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 87-96, July.
- Yinfeng Xu & Huili Zhang, 2015. "How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1062-1076, November.
- Huili Zhang & Yinfeng Xu & Lan Qin, 2013. "The k-Canadian Travelers Problem with communication," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 251-265, August.
- Henan Liu & Huili Zhang & Yi Xu, 2021. "The m-Steiner Traveling Salesman Problem with online edge blockages," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 844-860, May.
- Vural Aksakalli & O. Furkan Sahin & Ibrahim Ari, 2016. "An AO* Based Exact Algorithm for the Canadian Traveler Problem," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 96-111, February.
- Davood Shiri & F. Sibel Salman, 2017. "On the online multi-agent O–D k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 453-461, August.
- Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
- Madhushini Narayana Prasad & Nedialko Dimitrov & Evdokia Nikolova, 2023. "Non-Aggressive Adaptive Routing in Traffic," Mathematics, MDPI, vol. 11(17), pages 1-25, August.
More about this item
Keywords
Computational geometry; Robotics; Minimal sensing; Online algorithms; Competitive ratio;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9791-4. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.