Abstract
In this paper we introduce a novel algorithm for incorporating uncertainty into lookahead planning. Our algorithm searches through connected graphs with uncertain edge costs represented by known probability distributions. As a robot moves through the graph, the true edge costs of adjacent edges are revealed to the planner prior to traversal. This locally revealed information allows the planner to improve performance by predicting the benefit of edge costs revealed in the future and updating the plan accordingly in an online manner. Our proposed algorithm, Risk-Aware Graph Search (RAGS), selects paths with high probability of yielding low costs based on the probability distributions of individual edge traversal costs. We analyze RAGS for its correctness and computational complexity and provide a bounding strategy to reduce its complexity. We then present results in an example search domain and report improved performance compared to traditional heuristic search techniques. Lastly, we implement the algorithm on satellite imagery to show the benefits of risk-aware planning through uncertain terrain.
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
Polychronopoulos, G.H., Tsitsiklist, J.N.: Stochastic shortest path problems with recourse. Networks 27 (1996) 133–143
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2) (1968) 100–107
Koenig, S., Likhachev, M.: Fast replanning for navigation in unknown terrain. IEEE Transactions on Robotics 21(3) (2005) 354–363
Hollinger, G.A., Pereira, A.A., Binney, J., Somers, T., Sukhatme, G.S.: Learning uncertainty in ocean current predictions for safe and reliable navigation of underwater vehicles. Journal of Field Robotics 33(1) (2016) 47–66
Murphy, L., Newman, P.: Risky planning on probabilistic costmaps for path planning in outdoor environments. IEEE Transactions on Robotics 29(2) (2013) 445– 457
Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research 30(7) (2011) 846–894
Latombe, J.C.: Robot Motion Planning. Springer Science & Business Media (2012)
LaValle, S.M.: Planning Algorithms. Cambridge University Press (2006)
Bohren, J., Rusu, R.B., Jones, E.G., Marder-Eppstein, E., Pantofaru, C., Wise, M., Mösenlechner, L., Meeussen, W., Holzer, S.: Towards autonomous robotic butlers: Lessons learned with the PR2. In: Proc. IEEE International Conference on Robotics and Automation. (2011) 5568–5575
Kalman, R.E.: A new approach to linear filtering and prediction problems. Journal of Fluids Engineering 82(1) (1960) 35–45
Kurniawati, H., Hsu, D., Lee, W.S.: SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In: Robotics: Science and Systems. (2008)
Chaves, S.M., Walls, J.M., Galceran, E., Eustice, R.M.: Risk aversion in beliefspace planning under measurement acquisition uncertainty. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems. (2015) 2079–2086
Bry, A., Roy, N.: Rapidly-exploring random belief trees for motion planning under uncertainty. In: Proc. IEEE International Conference on Robotics and Automation. (2011) 723–730
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84(1) (1991) 127–150
Ferguson, D., Stentz, A., Thrun, S.: PAO for planning with hidden state. In: Proc. IEEE International Conference on Robotics and Automation. Volume 3. (2004) 2840–2847
Monahan, G.E.: State of the Art—-A survey of partially observable Markov decision processes: Theory, models, and algorithms. Management Science 28(1) (1982) 1–16
Hou, P., Yeoh, W., Varakantham, P.R.: Revisiting risk-sensitive MDPs: New algorithms and results. In: Proc. International Conference on Automated Planning and Scheduling. (2014)
Carpin, S., Chow, Y.L., Pavone, M.: Risk aversion in finite Markov Decision Processes using total cost criteria and average value at risk. In: Proc. IEEE International Conference on Robotics and Automation. (2016) 335–342
Marcus, S.I., Fernáandez-Gaucherand, E., Hernáandez-Hernandez, D., Coraluppi, S., Fard, P.: Risk sensitive Markov decision processes. In: Systems and Control in the Twenty-First Century. Springer (1997) 263–279
Sun, W., Patil, S., Alterovitz, R.: High-frequency replanning under uncertainty using parallel sampling-based motion planning. IEEE Transactions on Robotics 31(1) (2015) 104–116
Feyzabadi, S., Carpin, S.: Risk-aware path planning using hierarchical constrained Markov Decision Processes. In: Proc. IEEE International Conference on Automation Science and Engineering. (2014) 297–303
Meliou, A., Krause, A., Guestrin, C., Hellerstein, J.M.: Nonmyopic informative path planning in spatio-temporal models. In: Proc. AAAI Conference. (2007) 602– 607
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skeele, R., Chung, J.J., Hollinger, G.A. (2020). Risk-Aware Graph Search with Dynamic Edge Cost Discovery. In: Goldberg, K., Abbeel, P., Bekris, K., Miller, L. (eds) Algorithmic Foundations of Robotics XII. Springer Proceedings in Advanced Robotics, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-030-43089-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-43089-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43088-7
Online ISBN: 978-3-030-43089-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)