Advertisement

Formal Methods in System Design

, Volume 51, Issue 1, pp 62–86 | Cite as

Collision avoidance for mobile robots with limited sensing and limited information about moving obstacles

  • Dung PhanEmail author
  • Junxing Yang
  • Radu Grosu
  • Scott A. Smolka
  • Scott D. Stoller
Article

Abstract

This paper addresses the problem of safely navigating a mobile robot with limited sensing capability and limited information about stationary and moving obstacles. We consider two sensing limitations: blind spots between sensors and limited sensing range. We study three notions of safety: (1) static safety, which ensures collision-freedom with respect to stationary obstacles, (2) passive safety, which ensures collision-freedom while the robot is moving, and (3) passive friendly safety, which ensures the robot leaves sufficient room for obstacles to avoid collisions. We present a runtime approach, based on the Simplex architecture, to ensure these safety properties. To obtain the switching logic for the Simplex architecture, we identify a set of constraints on the sensor readings whose satisfaction at time t guarantees that the robot will still be able to ensure the safety property at time \(t + {\varDelta } t\), regardless of how it navigates during that time interval. Here, \({\varDelta } t\) is the period with which the switching logic is executed and is bounded by a function of the maximum velocity and braking power of the robot and the range of the sensors. To the best of our knowledge, this work is the first that provides runtime assurance that an autonomous mobile robot with limited sensing can navigate safely with limited information about obstacles. The limited information about obstacles is used to derive an over-approximation of the set of nearby obstacle points.

Keywords

Mobile robots Simplex architecture Collision avoidance Blind spots 

Notes

Acknowledgements

We thank Denise Ratasich for her helpful comments on earlier drafts of the manuscript. We also thank our anonymous reviewers for their comments that help to improve the manuscript. This material is based upon work supported in part by AFOSR Grant FA9550-14-1-0261, NSF Grants IIS-1447549, CNS-1421893, CNS-1446832, CCF-1414078, ONR Grant N00014-15-1-2208, and Artemis EMC2 Grant 3887039. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of these organizations.

References

  1. 1.
    Alami R, Krishna KM (2007) Provably safe motions strategies for mobile robots in dynamic domains. In: Laugier C, Chatila R (eds) Autonomous navigation in dynamic environment: models and algorithms. Springer Tracts in Advanced RoboticsGoogle Scholar
  2. 2.
    Bak S (2013) Hycreate: a tool for overapproximating reachability of hybrid automata. http://stanleybak.com/projects/hycreate/hycreate.html
  3. 3.
    Bak S, Manamcheri K, Mitra S, Caccamo M (2011) Sandboxing controllers for cyber-physical systems. In: Proceedings of the 2011 IEEE/ACM international conference on cyber-physical systems ICCPS. IEEE Computer Society, pp 3–12Google Scholar
  4. 4.
    Bouraine S, Fraichard T, Salhi H (2012) Provably safe navigation for mobile robots with limited field-of-views in dynamic environments. Autonomous Robots 32(3):267–283. doi: 10.1007/s10514-011-9258-8
  5. 5.
    Chen Y, Smith TR (1994) Finitely representable spatial objects and efficient computation. In: Algorithms and computation. Springer, Berlin, pp 181–189Google Scholar
  6. 6.
    Eberly D (1999) Distance between point and line, ray, or line segment. Geometric Tools. http://www.geometrictools.com/Documentation/DistancePointLine.pdf
  7. 7.
    Fox D, Burgard W, Thrun S (1997) The dynamic window approach to collision avoidance. IEEE Robot Autom Mag 4(1):23–33. doi: 10.1109/100.580977 CrossRefGoogle Scholar
  8. 8.
    Hoy M, Matveev AS, Savkin AV (2015) Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey. Robotica 33(3):463–497. doi: 10.1017/S0263574714000289 CrossRefGoogle Scholar
  9. 9.
    Hughes JF, Van Dam A, Foley JD, Feiner SK (2013) Computer graphics: principles and practice. Pearson Education, Upper Saddle RiverGoogle Scholar
  10. 10.
    Macek K, Vasquez Govea DA, Fraichard T, Siegwart R (2009) Towards safe vehicle navigation in dynamic urban scenarios. Automatika. Jugoslovenski Savez Za Elektroniku i Telekomunikacije Automatizaciju i Nuklearnu Tehniku (Etan). https://hal.inria.fr/inria-00447452
  11. 11.
    Minguez J, Montano L, Santos-Victor J (2006) Abstracting vehicle shape and kinematic constraints from obstacle avoidance methods. Auton Robots 20(1):43–59. doi: 10.1007/s10514-006-5363-5 CrossRefGoogle Scholar
  12. 12.
    Mitsch S, Ghorbal K, Platzer A (2013) On provably safe obstacle avoidance for autonomous robotic ground vehicles. In: Newman P, Fox D, Hsu D (eds) Robotics: science and systems. BerlinGoogle Scholar
  13. 13.
    Pan J, Zhang L, Manocha D (2012) Collision-free and smooth trajectory computation in cluttered environments. Int J Rob Res 31(10):1155–1175. doi: 10.1177/0278364912453186 CrossRefGoogle Scholar
  14. 14.
    Phan D, Yang J, Ratasich D, Grosu R, Smolka S, Stoller SD (2015) Collision avoidance for mobile robots with limited sensing and limited information about the environment. In: Proceedings of the 15th international conference on runtime verification (RV 2015), Lecture Notes in Computer Science. Springer, BerlinGoogle Scholar
  15. 15.
    Preparatat F, Shamos M (1985) Computational geometry: an introduction. Springer, BerlinCrossRefGoogle Scholar
  16. 16.
  17. 17.
    Savkin AV, Wang C (2012) A reactive algorithm for safe navigation of a wheeled mobile robot among moving obstacles. In: Proceedings of the 2012 IEEE international conference on control applications (CCA), pp 1567–1571. IEEEGoogle Scholar
  18. 18.
    Seto D, Krogh B, Sha L, Chutinan A (1998) The Simplex architecture for safe online control system upgrades. In: Proceedings of the 1998 American control conference, vol 6, pp 3504–3508. doi: 10.1109/ACC.1998.703255
  19. 19.
    Sha L (2001) Using simplicity to control complexity. IEEE Softw 18(4):20–28. doi: 10.1109/MS.2001.936213 MathSciNetCrossRefGoogle Scholar
  20. 20.
    Takei R, Huang H, Ding J, Tomlin CJ (2012) Time-optimal multi-stage motion planning with guaranteed collision avoidance via an open-loop game formulation. In: IEEE international conference on robotics and automation (ICRA), 2012 , pp 323–329. doi: 10.1109/ICRA.2012.6225074

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceStony Brook UniversityStony BrookUSA
  2. 2.Department of Computer ScienceVienna University of TechnologyViennaAustria

Personalised recommendations