Risk-Aware Motion Planning in Partially Known Environments

Recent trends envisage robots being deployed in areas deemed dangerous to humans, such as buildings with gas and radiation leaks. In such situations, the model of the underlying hazardous process might be unknown to the agent a priori, giving rise to the problem of planning for safe behaviour in partially known environments. We employ Gaussian process regression to create a probabilistic model of the hazardous process from local noisy samples. The result of this regression is then used by a risk metric, such as the Conditional Valueat-Risk, to reason about the safety at a certain state. The outcome is a risk function that can be employed in optimal motion planning problems. We demonstrate the use of the proposed function in two approaches. First is a sampling-based motion planning algorithm with an event-based trigger for online replanning. Second is an adaptation to the incremental Gaussian Process motion planner (iGPMP2), allowing it to quickly react and adapt to the environment. Both algorithms are evaluated in representative simulation scenarios, where they demonstrate the ability of avoiding high-risk areas.

[1]  Sonia Martínez,et al.  Planning Under Non-Rational Perception of Uncertain Spatial Costs , 2021, IEEE Robotics and Automation Letters.

[2]  Nick Hawes,et al.  Markov Decision Processes with Unknown State Feature Values for Safe Exploration using Gaussian Processes , 2020, 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[3]  Scott Sanner,et al.  Sequential Bayesian Optimisation for Spatial-Temporal Monitoring , 2014, UAI.

[4]  Morteza Lahijanian,et al.  Safety Verification of Unknown Dynamical Systems via Gaussian Process Regression , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

[5]  Patric Jensfelt,et al.  Guiding Autonomous Exploration With Signal Temporal Logic , 2019, IEEE Robotics and Automation Letters.

[6]  Songhwai Oh,et al.  A cost-aware path planning algorithm for mobile robots , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Max Q.-H. Meng,et al.  Risk-RRT∗: A robot motion planning algorithm for the human robot coexisting environment , 2017, 2017 18th International Conference on Advanced Robotics (ICAR).

[8]  Time-Bounded Mission Planning in Time-Varying Domains with Semi-MDPs and Gaussian Processes , 2020, CoRL.

[9]  Ruggero Carli,et al.  Machine learning meets Kalman Filtering , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[10]  Didier Devaurs,et al.  Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms , 2016, IEEE Transactions on Automation Science and Engineering.

[11]  Felix Berkenkamp,et al.  Safe Exploration for Interactive Machine Learning , 2019, NeurIPS.

[12]  Torsten Koller,et al.  Learning-based Model Predictive Control for Safe Exploration and Reinforcement Learning , 2019, ArXiv.

[13]  Alexis Boukouvalas,et al.  GPflow: A Gaussian Process Library using TensorFlow , 2016, J. Mach. Learn. Res..

[14]  Andreas Krause,et al.  Safe Exploration in Finite Markov Decision Processes with Gaussian Processes , 2016, NIPS.

[15]  Insoon Yang,et al.  Risk-Aware Motion Planning and Control Using CVaR-Constrained Optimization , 2019, IEEE Robotics and Automation Letters.

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

[17]  Jonathan D. Gammell,et al.  A Survey of Asymptotically Optimal Sampling-based Motion Planning Methods , 2020, ArXiv.

[18]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[19]  Michael A. Goodrich,et al.  Online RRT∗ and online FMT∗: Rapid replanning with dynamic cost , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[20]  Byron Boots,et al.  Continuous-time Gaussian process motion planning via probabilistic inference , 2017, Int. J. Robotics Res..

[21]  Nicholas Roy,et al.  Information-Guided Robotic Maximum Seek-and-Sample in Partially Observable Continuous Environments , 2019, IEEE Robotics and Automation Letters.

[22]  Stefan Schaal,et al.  STOMP: Stochastic trajectory optimization for motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[23]  Jonathan P. How,et al.  Robust Sampling-based Motion Planning with Asymptotic Optimality Guarantees , 2013 .

[24]  Siddhartha S. Srinivasa,et al.  CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.

[25]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[26]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[27]  Jana Tumova,et al.  Sampling-based Motion Planning with Temporal Logic Missions and Spatial Preferences , 2020 .

[28]  Marco Pavone,et al.  How Should a Robot Assess Risk? Towards an Axiomatic Theory of Risk in Robotics , 2017, ISRR.

[29]  Siddhartha S. Srinivasa,et al.  Regionally accelerated batch informed trees (RABIT*): A framework to integrate local information into optimal path planning , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[30]  Kourosh Naderi,et al.  RT-RRT*: a real-time path planning algorithm based on RRT* , 2015, MIG.