Safe path planning for UAV urban operation under GNSS signal occlusion risk

Abstract This paper introduces a concept of safe path planning for UAV’s autonomous operation in an urban environment where GNSS-positioning may become unreliable or even unavailable. If the operation environment is a priori known and geo-localized, it is possible to predict a GNSS satellite constellation and hence to anticipate its signal occlusions at a given point and time. Motivated from this, our main idea is to utilize such sensor availability map in path planning task for ensuring UAV navigation safety. The proposed concept is implemented by a Partially Observable Markov Decision Process (POMDP) model. It incorporates a low-level navigation and guidance module for propagating the UAV state uncertainty in function of the probabilistic sensor availability. A new definition of cost function is introduced in this model such that the resulting optimal policy respects a user-defined safety requirement. A goal-oriented version of Monte-Carlo Tree Search algorithm, called POMCP-GO, is proposed for POMDP solving. The developed safe path planner is evaluated on two simple obstacle benchmark maps as well as on a real elevation map of San Diego downtown, along with GPS availability maps.

[1]  Thomas Keller,et al.  Balancing Exploration and Exploitation in Classical Planning , 2014, SOCS.

[2]  Roland Siegwart,et al.  Motion‐ and Uncertainty‐aware Path Planning for Micro Aerial Vehicles , 2014, J. Field Robotics.

[3]  Bernard Mettler,et al.  Benchmarking of obstacle field navigation algorithms for autonomous helicopters , 2010 .

[4]  Blai Bonet,et al.  Solving POMDPs: RTDP-Bel vs. Point-based Algorithms , 2009, IJCAI.

[5]  Mausam,et al.  A Theory of Goal-Oriented MDPs with Dead Ends , 2012, UAI.

[6]  Olivier Buffet,et al.  A Closer Look at MOMDPs , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[7]  Nancy M. Amato,et al.  FIRM: Sampling-based feedback motion-planning under motion uncertainty and imperfect measurements , 2014, Int. J. Robotics Res..

[8]  Jonathan P. How,et al.  An online algorithm for constrained POMDPs , 2010, 2010 IEEE International Conference on Robotics and Automation.

[9]  Leslie Pack Kaelbling,et al.  Belief space planning assuming maximum likelihood observations , 2010, Robotics: Science and Systems.

[10]  Nicholas Roy,et al.  Rapidly-exploring Random Belief Trees for motion planning under uncertainty , 2011, 2011 IEEE International Conference on Robotics and Automation.

[11]  Nicholas Roy,et al.  Planning in information space for a quadrotor helicopter in a GPS-denied environment , 2008, 2008 IEEE International Conference on Robotics and Automation.

[12]  Grace Xingxin Gao,et al.  Predicting State Uncertainty for GNSS-based UAV Path Planning using Stochastic Reachability , 2019 .

[13]  Nikos A. Vlassis,et al.  A point-based POMDP algorithm for robot planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  Olivier Buffet,et al.  Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art , 2016, J. Artif. Intell. Res..

[15]  David Hsu,et al.  SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2008, Robotics: Science and Systems.

[16]  Yoko Watanabe,et al.  Entropy-Based Adaptive Exploit-Explore Coefficient for Monte-Carlo Path Planning , 2020, ECAI.

[17]  N. Roy,et al.  The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance , 2009, Int. J. Robotics Res..

[18]  Joelle Pineau,et al.  Anytime Point-Based Approximations for Large POMDPs , 2006, J. Artif. Intell. Res..

[19]  Giancarmine Fasano,et al.  Multi-UAV Path Planning for Autonomous Missions in Mixed GNSS Coverage Scenarios , 2018, Sensors.

[20]  Panos E. Trahanias,et al.  Real-time hierarchical POMDPs for autonomous robot navigation , 2007, Robotics Auton. Syst..

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[22]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..

[23]  Florent Teichteil-Königsbuch.  Stochastic Safest and Shortest Path Problems , 2012, AAAI.

[24]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[25]  Charles Lesire,et al.  Multi-Target Detection and Recognition by UAVs Using Online POMDPs , 2013, AAAI.

[26]  Li-Ta Hsu,et al.  A New Path Planning Algorithm Using a GNSS Localization Error Map for UAVs in an Urban Area , 2018, Journal of Intelligent & Robotic Systems.

[27]  Yoko Watanabe,et al.  Safe Path Planning with Localization Uncertainty for Urban Operation of VTOL UAV , 2014 .

[28]  David Hsu,et al.  Planning under Uncertainty for Robotic Tasks with Mixed Observability , 2010, Int. J. Robotics Res..

[29]  Reid G. Simmons,et al.  Heuristic Search Value Iteration for POMDPs , 2004, UAI.

[30]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[31]  Zaher M. Kassas,et al.  Optimal GPS Integrity-Constrained Path Planning for Ground Vehicles , 2020, 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS).

[32]  Masahiro Ono,et al.  Collision-Free Encoding for Chance-Constrained Nonconvex Path Planning , 2019, IEEE Transactions on Robotics.

[33]  S. Patek.  On partially observed stochastic shortest path problems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[34]  Sylvie Thiébaux,et al.  I-dual: Solving Constrained SSPs via Heuristic Search in the Dual Space , 2017, IJCAI.

[35]  Charles Lesire,et al.  AMPLE: an anytime planning and execution framework for dynamic and uncertain problems in robotics , 2019, Auton. Robots.

[36]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[37]  D. Odijk,et al.  Prediction of GNSS Availability and Accuracy in Urban Environments Case Study Schiphol Airport , 2009 .

[38]  David Hsu,et al.  DESPOT: Online POMDP Planning with Regularization , 2013, NIPS.

[39]  Masahiro Ono,et al.  Chance-Constrained Optimal Path Planning With Obstacles , 2011, IEEE Transactions on Robotics.

[40]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[41]  Ron Alterovitz,et al.  Motion planning under uncertainty using iterative local optimization in belief space , 2012, Int. J. Robotics Res..

[42]  Mykel J. Kochenderfer,et al.  Online Algorithms for POMDPs with Continuous State, Action, and Observation Spaces , 2017, ICAPS.

[43]  Malte Helmert,et al.  Trial-Based Heuristic Tree Search for Finite Horizon MDPs , 2013, ICAPS.

[44]  Joel Veness,et al.  Monte-Carlo Planning in Large POMDPs , 2010, NIPS.

[45]  Jesse Hoey,et al.  Solving POMDPs with Continuous or Large Discrete Observation Spaces , 2005, IJCAI.

[46]  Yoko Watanabe,et al.  Solving path planning problems in urban environments based on a priori sensor availability and execution error propagation , 2019 .