Table of Contents
Fetching ...

Risk-aware MPPI for Stochastic Hybrid Systems

Hardik Parwana, Mitchell Black, Bardh Hoxha, Hideki Okamoto, Georgios Fainekos, Danil Prokhorov, Dimitra Panagou

TL;DR

This work proposes a variant of Model Predictive Path Integral Control (MPPI) to plan kinodynamic paths for stochastic hybrid systems and employs recently proposed Unscented Transform-based methods to capture stochasticity in the states as well as the state-dependent switching surfaces.

Abstract

Path Planning for stochastic hybrid systems presents a unique challenge of predicting distributions of future states subject to a state-dependent dynamics switching function. In this work, we propose a variant of Model Predictive Path Integral Control (MPPI) to plan kinodynamic paths for such systems. Monte Carlo may be inaccurate when few samples are chosen to predict future states under state-dependent disturbances. We employ recently proposed Unscented Transform-based methods to capture stochasticity in the states as well as the state-dependent switching surfaces. This is in contrast to previous works that perform switching based only on the mean of predicted states. We focus our motion planning application on the navigation of a mobile robot in the presence of dynamically moving agents whose responses are based on sensor-constrained attention zones. We evaluate our framework on a simulated mobile robot and show faster convergence to a goal without collisions when the robot exploits the hybrid human dynamics versus when it does not.

Risk-aware MPPI for Stochastic Hybrid Systems

TL;DR

This work proposes a variant of Model Predictive Path Integral Control (MPPI) to plan kinodynamic paths for stochastic hybrid systems and employs recently proposed Unscented Transform-based methods to capture stochasticity in the states as well as the state-dependent switching surfaces.

Abstract

Path Planning for stochastic hybrid systems presents a unique challenge of predicting distributions of future states subject to a state-dependent dynamics switching function. In this work, we propose a variant of Model Predictive Path Integral Control (MPPI) to plan kinodynamic paths for such systems. Monte Carlo may be inaccurate when few samples are chosen to predict future states under state-dependent disturbances. We employ recently proposed Unscented Transform-based methods to capture stochasticity in the states as well as the state-dependent switching surfaces. This is in contrast to previous works that perform switching based only on the mean of predicted states. We focus our motion planning application on the navigation of a mobile robot in the presence of dynamically moving agents whose responses are based on sensor-constrained attention zones. We evaluate our framework on a simulated mobile robot and show faster convergence to a goal without collisions when the robot exploits the hybrid human dynamics versus when it does not.

Paper Structure

This paper contains 14 sections, 21 equations, 4 figures, 2 algorithms.

Figures (4)

  • Figure 1: The robot's sampled trajectory (green) induces different responses from each of the human's (the non-ego agent in this example) sigma points. The ellipses represent the distribution of predicted human states and the dots inside them represent the sigma points. At $t=6$, the human perceives the robot for the first time in its field-of-view for 2 out of 3 sigma points. The red and blue points get influenced by robot position at $t=6$ while the pink point does not - resulting in three different future ellipses (of the same color respectively). The compression operation combines the three hollow ellipses into a single (solid) ellipse to represent human state distribution at $t=7$. Note that distribution need not be an ellipse and depends on the variant of UT employed.
  • Figure 2: Simulation results for proposed method in Section \ref{['section::simulation_case_1']}. (a) The robot performs collision avoidance with humans (red) and obstacles (black). Robot trajectory is similarly shown in green. (b) Cost \ref{['eq::mppi_objective']} and stability cost ($Q_c$ only) accumulated with time. (c), (d) Robot's minimum distance to any (c) human and (d) obstacle with time. The solid/dotted lines and shaded areas represent the mean and the 95% confidence interval in variation over 50 runs.
  • Figure 3: Simulation results for RA-MPPI inspired method in Section \ref{['section::simulation_case_1']}. Note from the increasing stability cost that the robot didn't converge to the goal location in the given time.
  • Figure 4: Simulation results for RA-MPPI with 100 samples per human in Section \ref{['section::simulation_case_1']}.

Theorems & Definitions (2)

  • Remark 1
  • Example 1: Simple motion model with attention radius