Open Access
| Issue |
RAIRO-Oper. Res.
Volume 60, Number 4, July-August 2026
|
|
|---|---|---|
| Page(s) | 2189 - 2226 | |
| DOI | https://doi.org/10.1051/ro/2026063 | |
| Published online | 28 July 2026 | |
- V. Aksakalli, The BAO* algorithm for stochastic shortest path problem with dynamic learning, in Proceedings of IEEE Conference on Decision and Control, New Orleans, LA (2007). [Google Scholar]
- V. Aksakalli, Protocols for stochastic shortest path problems with dynamic learning. Ph.D. thesis, The Johns Hopkins University (2007). [Google Scholar]
- V. Aksakalli and I. Ari, Penalty-based algorithms for stochastic obstacle scene problem. INFORMS J. Comput. 26 (2013) 370–384. [Google Scholar]
- V. Aksakalli and E. Ceyhan, Optimal obstacle placement with disambiguations. Ann. Appl. Stat. 6 (2012) 1730–1774. [Google Scholar]
- V. Aksakalli, D.E. Fishkind, C.E. Priebe and X. Ye, The reset disambiguation policy for navigating stochastic obstacle fields. Nav. Res. Logist. 58 (2011) 389–399. [Google Scholar]
- V. Aksakalli, O.F. Sahin and I. Ari, An AO* based exact algorithm for the Canadian traveler problem. INFORMS J. Comput. 28 (2016) 96–111. [Google Scholar]
- A.F. Alkaya, V. Aksakalli and C.E. Priebe, A penalty search algorithm for the obstacle neutralization problem. Comput. Oper. Res. 53 (2015) 165–175. [Google Scholar]
- A. Bar-Noy and B. Schieber, The Canadian traveller problem, in Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA (1991) 261–270. [Google Scholar]
- Z. Bnaya, A. Felner, E. Shimony, G.A. Kaminka and E. Merdler, A fresh look at sensor-based navigation: navigation with sensing costs, in AAAI 2008 Workshop on Search in Artificial Intelligence and Robotics, Chicago, IL (2008) 11–17. [Google Scholar]
- Z. Bnaya, A. Felner and S.E. Shimony, Canadian traveler problem with remote sensing, in Proceedings of the International Joint Conference on Artificial Intelligence, Pasadena, CA (2009) 437–442. [Google Scholar]
- Z. Bnaya, A. Felner, D. Fried, O. Maksin and S.E. Shimony, Repeated-task Canadian traveler problem. AI Commun. 28 (2015) 453–477. [Google Scholar]
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, New York (1998). [Google Scholar]
- R.H. Byrd, P. Lu, J. Nocedal and C. Zhu, A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16 (1995) 1190–1208. [Google Scholar]
- E.W. Dijkstra, A note on two problems in connexion with graphs. Numer. Math. 1 (1959) 269–271. [Google Scholar]
- D.E. Fishkind, C.E. Priebe, K. Giles, L.N. Smith and V. Aksakalli, Disambiguation protocols based on risk simulation. IEEE Trans. Syst. Man Cybern. Syst. 37 (2007) 814–823. [Google Scholar]
- D. Fried, Theoretical aspects of the generalized Canadian traveler problem. Ph.D. thesis, Ben-Gurion University of the Negev, Beersheba, Israel (2013). [Google Scholar]
- E. Nikolova and D.R. Karger, Route planning under uncertainty: the Canadian traveller problem, in The 23rd AAAI Conference on Artificial Intelligence, Chicago, IL (2008). [Google Scholar]
- J. Nocedal and S.J. Wright, Numerical Optimization, 2nd edition. Springer, Berlin (2006). [Google Scholar]
- C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map. Theor. Comput. Sci. 84 (1991) 127–150. [Google Scholar]
- C.E. Priebe, D.E. Fishkind, L. Abrams and C.D. Piatko, Random disambiguation paths for traversing a mapped hazard field. Nav. Res. Logist. 52 (2005) 285–292. [Google Scholar]
- S.J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 4th edition. Pearson, Boston (2020). [Google Scholar]
- D. West, Introduction to Graph Theory, 2nd edition. Prentice Hall, NJ (2001). [Google Scholar]
- S. Westphal, A note on the k-Canadian traveller problem. Inform. Process. Lett. 106 (2008) 87–89. [Google Scholar]
- N. Witherspoon, J. Holloway, K. Davis, R. Miller and A. Dubey, The Coastal battlefield reconnaissance and analysis (COBRA) program for minefield detection, in Proceedings of SPIE: Detection Technologies for Mines and Minelike Targets, Vol. 2496 (1995) 500–508. [Google Scholar]
- Y. Xu, M. Hu, B. Su, B. Zhu and Z. Zhu, The Canadian traveler’s problem and its competitive analysis. J. Comb. Optim. 18 (2009) 195–205. [Google Scholar]
- X. Ye and C.E. Priebe, A graph-search based navigation algorithm for traversing a potentially hazardous area with disambiguation. Int. J. Oper. Res. Inf. Syst. 1 (2010) 14–27. [Google Scholar]
- X. Ye, D.E. Fishkind, L. Abrams and C.E. Priebe, Sensor information monotonicity in disambiguation protocols. J. Oper. Res. Soc. 62 (2011) 142–151. [Google Scholar]
- L. Zhou, SOS-pathfinding: R code for penalty-based navigation algorithms in the discretized stochastic obstacle scene (SOS) problem (2026). https://github.com/Li-Z27/sos-pathfinding, Accessed 2026-03-26. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.