Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem

References

• Aksakalli V (2007) The BAO* algorithm for stochastic shortest path problems with dynamic learning. Proc. 46th IEEE Conf. Decision and Control, New Orleans, LA, 6003–6008.Crossref, Google Scholar
• Aksakalli V, Ceyhan E (2012) Optimal obstacle placement with disambiguations. Ann. Appl. Statist. 6:1730–1774.Crossref, Google Scholar
• Aksakalli V, Fishkind DE, Priebe CE (2006) Adaptation of the simulated risk disambiguation protocol to a discrete setting. Proc. ICAPS Workshop on POMDP, Classification Regression: Relationships Joint Utilization, Ambleside, UK.Google Scholar
• Aksakalli V, Fishkind DE, Priebe CE, Ye X (2011) The reset disambiguation policy for navigating stochastic obstacle fields. Naval Res. Logist. 58:389–399.Crossref, Google Scholar
• Blatz J, Fishkind DE, Priebe CE (2010) Efficient, optimal stochastic-action selection when limited by an action budget. Math. Meth. Oper. Res. 72:63–74.Crossref, Google Scholar
• Blei DM, Kaelbling LP (1999) Shortest paths in a dynamic uncertain domain. Proc. IJCAI Workshop Adaptive Spatial Representations Dynam. Environ. (AAAI Press, Palo Alto, CA).Google Scholar
• Eyerich P, Keller T, Helmert M (2009) High-quality policies for the Canadian traveler's problem. Proc. 24th AAAI Conf. Artificial Intelligence, Atlanta, 51–58.Google Scholar
• Fawcett J, Robinson P (2000) Adaptive routing for road traffic. IEEE Comp. Graphics Appl. 20:46–53.Crossref, Google Scholar
• Ferguson D, Stenz A, Thrun S (2004) PAO* for planning with hidden state. Proc. 2004 IEEE Internat. Conf. Robotics and Automation (IEEE Press, Hoboken, NJ), 2840–2847.Crossref, Google Scholar
• Fishkind DE, Priebe CE, Giles K, Smith LN, Aksakalli V (2007) Disambiguation protocols based on risk simulation. IEEE Trans. Systems, Man, Cybernetics, Part A 37:814–823.Crossref, Google Scholar
• Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Trans. Res. Part B-Methodological 40:93–122.Crossref, Google Scholar
• Likhachev M, Stentz A (2009) Probabilistic planning with clear preferences on missing information. Artificial Intelligence 173:696–721.Crossref, Google Scholar
• Likhachev M, Gordon G, Thrun S (2005) Planning for Markov decision processes with sparse stochasticity. Saul LK, Weiss Y, Bottou L, eds. Advances in Neural Information Processing Systems (MIT Press, Cambridge, MA), 785–792.Google Scholar
• Muhandiramge R (2008) Maritime maneuvering optimization: Path planning in minefield threat environments. Ph.D. dissertation, University of Western Australia, Crawley, Australia.Google Scholar
• Nikolova E, Karger DR (2008) Route planning under uncertainty: The Canadian traveller problem. Proc. 23rd AAAI Conf. Artificial Intelligence, Chicago, 969–974.Google Scholar
• Papadimitriou CH, Yannakakis M (1991) Shortest paths without a map. Theoret. Comp. Sci. 84:127–150.Crossref, Google Scholar
• Priebe CE, Olson TE, Healy DM (1997) Exploiting stochastic partitions for minefield detection. Proc. SPIE 3079:508–518.Crossref, Google Scholar
• Priebe CE, Fishkind DE, Abrams L, Piatko CD (2005) Random disambiguation paths for traversing a mapped hazard field. Naval Res. Logist. 52:285–292.Crossref, Google Scholar
• Provan JS (2003) A polynomial-time algorithm to find shortest paths with recourse. Networks 41:115–125.Crossref, Google Scholar
• Smith DL (1995) Detection technologies for mines and minelike targets. Proc. SPIE 2496:404–408.Crossref, Google Scholar
• Witherspoon NH, Holloway JH, Davis KS, Miller RW, Dubey AC (1995) The coastal battlefield reconnaissance and analysis (COBRA) program for minefield detection. Proc. SPIE 2496:500–508.Crossref, Google Scholar
• Xu Y, Hu M, Su B, Zhu B, Zhu Z (2009) The Canadian traveller problem and its competitive analysis. J. Combin. Optim. 18:195–205.Crossref, Google Scholar
• Ye X, Priebe CE (2010) A graph-search based navigation algorithm for traversing a potentially hazardous area with disambiguation. Internat. J. Oper. Res. Inform. Sys. 1:14–27.Crossref, Google Scholar
• Ye X, Fishkind DE, Priebe CE (2011) Sensor information monotonicity in disambiguation protocols. J. Oper. Res. Soc. 62:142–151.Crossref, Google Scholar