Skip to main content

On Infusing Reachability-Based Safety Assurance Within Probabilistic Planning Frameworks for Human-Robot Vehicle Interactions

  • Conference paper
  • First Online:
Proceedings of the 2018 International Symposium on Experimental Robotics (ISER 2018)

Part of the book series: Springer Proceedings in Advanced Robotics ((SPAR,volume 11))

Included in the following conference series:

  • 2287 Accesses

Abstract

Action anticipation, intent prediction, and proactive behavior are all desirable characteristics for autonomous driving policies in interactive scenarios. Paramount, however, is ensuring safety on the road—a key challenge in doing so is accounting for uncertainty in human driver actions without unduly impacting planner performance. This paper introduces a minimally-interventional safety controller operating within an autonomous vehicle control stack with the role of ensuring collision-free interaction with an externally controlled (e.g., human-driven) counterpart. We leverage reachability analysis to construct a real-time (100 Hz) controller that serves the dual role of (1) tracking an input trajectory from a higher-level planning algorithm using model predictive control, and (2) assuring safety through maintaining the availability of a collision-free escape maneuver as a persistent constraint regardless of whatever future actions the other car takes. A full-scale steer-by-wire platform is used to conduct traffic weaving experiments wherein the two cars, initially side-by-side, must swap lanes in a limited amount of time and distance, emulating cars merging onto/off of a highway. We demonstrate that, with our control stack, the autonomous vehicle is able to avoid collision even when the other car defies the planner’s expectations and takes dangerous actions, either carelessly or with the intent to collide, and otherwise deviates minimally from the planned trajectory to the extent required to maintain safety.

M. Chen—Work performed as a postdoctoral scholar at Stanford University.

K. Leung and E. Schmerling—Contributed equally to this work. This work was supported by the Office of Naval Research (Grant N00014-17-1-2433), by Qualcomm, and by the Toyota Research Institute (“TRI”). This article solely reflects the opinions and conclusions of its authors and not ONR, Qualcomm, TRI, or any other Toyota entity. The authors would like to thank Thunderhill Raceway Park for accommodating testing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The HJI PDE is solved starting from the boundary condition \(V(0, x_{_\mathscr {R}})\), the sign of which reflects set membership of \(x_{_\mathscr {R}}\) in \(\mathscr {T}\); see Sect. 5 for discussion of specific choices of \(V(0, x_{_\mathscr {R}})\).

  2. 2.

    For ease of notation going forward we will often write \(V := V_\infty \).

  3. 3.

    The computation becomes notoriously expensive past five or more states without compromising on grid discretization or employing some decoupling strategy. We use a grid size of \(13\times 13\times 9\times 9\times 9\times 9\times 9\) for our 7D system uniformly spaced over \((x_\mathrm {rel}, y_\mathrm {rel}, \psi _\mathrm {rel}, U_{x_\mathrm {R}}, U_{y_\mathrm {R}}, v_{_\mathrm {H}}, r_{_\mathrm {R}}) \in [-15, 15] \times [-5, 5] \times [-\pi /2, \pi /2] \times [1, 12] \times [-2, 2] \times [1, 12] \times [-1, 1]\); computing the BRS with this discretization takes approximately 16 hours on a 3.6 GHz octocore AMD Ryzen 1800X CPU.

  4. 4.

    Only a single iteration of SQP is solved for the tracking problem at each MPC step, rather than the usual iteration until convergence. Since the tracking problems are so similar from one MPC step to the next, we find that this approach yields sufficient performance for our purposes.

  5. 5.

    We scaled the highway traffic-weaving scenario (mean speed \(\sim \)28 m/s) in [11] down to a mean speed of \(\sim \)8 m/s by shortening the track (reducing longitudinal velocity by a constant) and scaling time by a factor of 4/3 (with the effect of scaling speeds by 3/4 and accelerations by 9/16).

  6. 6.

    For comparative purposes, the controllers were simulated with the displayed nominal trajectory held fixed, but in reality, the nominal trajectory in these experiments was updated at \(\sim \)4 Hz.

  7. 7.

    By literature standards we already use a relatively coarse discretization grid for solving the HJI PDE; associated numerical inaccuracies may be another source of the observed safety mismatch.

References

  1. Wolf, M.T., Burdick, J.W.: Artificial potential functions for highway driving with collision avoidance. In: Proceedings of IEEE Conference on Robotics and Automation (2008)

    Google Scholar 

  2. Funke, J., Brown, M., Erlien, S.M., Gerdes, J.C.: Collision avoidance and stabilization for autonomous vehicles in emergency scenarios. IEEE Trans. Control Syst. Technol. 25, 1204–1216 (2017)

    Article  Google Scholar 

  3. Arora, S., Choudhury, S., Althoff, D., Scherer, S.: Emergency maneuver library – ensuring safe navigation in partially known environments. In: Proceedings of IEEE Conference on Robotics and Automation (2015)

    Google Scholar 

  4. Bokanowski, O., Forcadel, N., Zidani, H.: Reachability and minimal times for state constrained nonlinear problems without any controllability assumption. SIAM J. Control Optim. 48, 4292–4316 (2010)

    Article  MathSciNet  Google Scholar 

  5. Chen, M., Hu, Q., Fisac, J., Akametalu, K., Mackin, C., Tomlin, C.: Reachability-based safety and goal satisfaction of unmanned aerial platoons on air highways. AIAA J. Guid. Control Dyn. 40, 1360–1373 (2017)

    Article  Google Scholar 

  6. Dhinakaran, A., Chen, M., Chou, G., Shih, J.C., Tomlin, C.J.: A hybrid framework for multi-vehicle collision avoidance. In: Proceedings of IEEE Conference on Decision and Control (2017)

    Google Scholar 

  7. Gattami, A., Al Alam, A., Johansson, K.H., Tomlin, C.J.: Establishing safety for heavy duty vehicle platooning: a game theoretical approach. IFAC World Congr. 44, 3818–3823 (2011)

    Google Scholar 

  8. Margellos, K., Lygeros, J.: Hamilton-Jacobi formulation for reach-avoid differential games. IEEE Trans. Autom. Control 56, 1849–1861 (2011)

    Article  MathSciNet  Google Scholar 

  9. Mitchell, I.M., Bayen, A.M., Tomlin, C.J.: A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Trans. Autom. Control 50, 947–957 (2005)

    Article  MathSciNet  Google Scholar 

  10. Fisac, J.F., Akametalu, A.K., Zeilinger, M.N., Kaynama, S., Gillula, J., Tomlin, C.J.: A general safety framework for learning-based control in uncertain robotic systems. J. IEEE TAC 64(7), 2737–2752 (2018)

    MathSciNet  MATH  Google Scholar 

  11. Schmerling, E., Leung, K., Vollprecht, W., Pavone, M.: Multimodal probabilistic model-based planning for human-robot interaction. In: Proceedings of IEEE Conference on Robotics and Automation (2018)

    Google Scholar 

  12. Brown, M., Funke, J., Erlien, S., Gerdes, J.C.: Safe driving envelopes for path tracking in autonomous vehicles. Control Eng. Pract. 61, 307–316 (2017)

    Article  Google Scholar 

  13. Yoon, S., Fern, A., Givan, R., Kambhampati, S.: Probabilistic planning via determinization in hindsight. In: Proceedings of AAAI Conferrence on Artificial Intelligence (2008)

    Google Scholar 

  14. Chen, M., Tomlin, C.J.: Hamilton-Jacobi reachability: some recent theoretical advances and applications in unmanned airspace management. Robot. Auton. Syst. Annu. Rev. Control 1, 333–358 (2018)

    Article  Google Scholar 

  15. Fisac, J.F., Chen, M., Tomlin, C.J., Sastry, S.S.: Reach-avoid problems with time-varying dynamics, targets and constraints. In: Hybrid Systems: Computation and Control (2015)

    Google Scholar 

  16. Tanabe, K., Chen, M.: BEACLS: Berkeley Efficient API in C++ for Level Set methods. https://github.com/HJReachability/beacls

  17. Revels, J., Lubin, M., Papamarkou, T.: Forward-mode automatic differentiation in Julia (2016). https://arxiv.org/abs/1607.07892

  18. Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: An operator splitting solver for quadratic programs (2017). https://arxiv.org/abs/1711.08013

  19. Koolen, T., Contributors: Parametron.jl: Efficiently solving parameterized families of optimization problems in Julia. https://github.com/tkoolen/Parametron.jl

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Karen Leung .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Leung, K., Schmerling, E., Chen, M., Talbot, J., Gerdes, J.C., Pavone, M. (2020). On Infusing Reachability-Based Safety Assurance Within Probabilistic Planning Frameworks for Human-Robot Vehicle Interactions. In: Xiao, J., Kröger, T., Khatib, O. (eds) Proceedings of the 2018 International Symposium on Experimental Robotics. ISER 2018. Springer Proceedings in Advanced Robotics, vol 11. Springer, Cham. https://doi.org/10.1007/978-3-030-33950-0_48

Download citation

Publish with us

Policies and ethics