Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments

10.1109/IROS.2011.6095072

10.1109/ICRA.2011.5980124

10.1162/neco.2006.18.8.1790

karumanchi, 2010, Off-road Mobility Analysis from Proprioceptive Feedback

thompson, 2008, Intelligent maps for autonomous kilometer-scale site survey, Proc Int Symp Artif Intell Robot Autom Space

10.1109/ROBOT.2009.5152754

10.1613/jair.2096

harris, 1973, The bandwidth heuristic search, Proc Int Joint Conf Artif Intell, 23

10.1016/0004-3702(70)90007-X

10.1109/ROBOT.1994.351061

10.1023/A:1008916000526

10.1109/TSSC.1968.300136

10.2307/3033543

koenig, 2002, D<formula formulatype="inline"><tex Notation="TeX">$^*$</tex></formula> lite, Proc 18th Nat Conf Artif Intell, 476

0

10.1007/BF01386390

goldberg, 2005, Computing the shortest path: A<formula formulatype="inline"><tex Notation="TeX">$^*$</tex></formula> search meets graph theory, presented at the 16th Annu ACM-SIAM Symp Discrete Algorithm

10.1007/978-3-540-69507-3_6

grant, 2008, LPI: Approximating shortest paths using landmarks, presented at the Workshop AI Games

10.1007/978-3-540-28633-2_13

likhachev, 2003, ARA <formula formulatype="inline"><tex Notation="TeX">$^*$</tex></formula>: Anytime A<formula formulatype="inline"><tex Notation="TeX">$^*$</tex> </formula> search with provable bounds on sub-optimality, presented at the Conf Neural Inf Process Syst

10.1109/IROS.2008.4651026

smith, 2005, Point-based POMDP algorithms: Improved analysis and implementation, Proc Conf Uncert Artif Intell, 542

rasmussen, 2006, Gaussian Processes for Machine Learning

pineau, 2003, Point-based value iteration: An anytime algorithm for POMDPs, Proc Int Joint Conf Artif Intell, 1025

10.1109/IROS.2007.4399557

10.15607/RSS.2008.IV.009

10.1109/ROBOT.2010.5509363

ferguson, 2004, PAO <formula formulatype="inline"><tex Notation="TeX">$^*$</tex></formula> for planning with hidden state, Proc IEEE Int Conf Robot Autom, 2840

philippsen, 2008, Mobile robot planning in dynamic environments and on growable costmaps, presented at the IEEE Int Conf Robot Autom Workshop Path Plann Costmaps

10.1016/S0004-3702(98)00023-X

10.1016/j.artint.2008.10.014

sondik, 1971, The optimal control of partially observable Markov processes

likhachev, 2005, Anytime dynamic A<formula formulatype="inline"><tex Notation="TeX">$^*$</tex></formula>: An anytime, replanning algorithm, Proc Int Conf Autom Plann Sched, 262

10.1145/358523.358553

10.1109/ROBOT.2006.1642057

10.1109/IROS.2006.282100

10.1287/opre.13.3.462

10.1109/TPAMI.1982.4767270

10.1080/0022250X.2001.9990249

10.1145/3828.3830

kaufman, 1990, Finding Groups in Data An Introduction to Cluster Analysis

10.1109/ROBOT.2010.5509501

10.1108/01443579110139778

pearl, 1984, Heuristics Intelligent Search Strategies for Computer Problem Solving