skip to main content
10.1145/3193992.3193999acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

Formal verification of an autonomous wheel loader by model checking

Published:02 June 2018Publication History

ABSTRACT

In an attempt to increase productivity and the workers' safety, the construction industry is moving towards autonomous construction sites, where various construction machines operate without human intervention. In order to perform their tasks autonomously, the machines are equipped with different features, such as position localization, human and obstacle detection, collision avoidance, etc. Such systems are safety critical, and should operate autonomously with very high dependability (e.g., by meeting task deadlines, avoiding (fatal) accidents at all costs, etc.).

An Autonomous Wheel Loader is a machine that transports materials within the construction site without a human in the cab. To check the dependability of the loader, in this paper we provide a timed automata description of the vehicle's control system, including the abstracted path planning and collision avoidance algorithms used to navigate the loader, and we model check the encoding in UPPAAL, against various functional, timing and safety requirements. The complex nature of the navigation algorithms makes the loader's abstract modeling and the verification very challenging. Our work shows that exhaustive verification techniques can be applied early in the development of autonomous systems, to enable finding potential design errors that would incur increased costs if discovered later.

References

  1. Rajeev Alur and David Dill. 1991. The theory of timed automata. In Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems). Springer, 45--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Michael S Andersen, Rune S Jensen, Thomas Bak, and Michael M Quottrup. 2004. Motion planning in multi-robot systems using timed automata. IFAC Proceedings Volumes 37, 8 (2004), 597--602.Google ScholarGoogle ScholarCross RefCross Ref
  3. Adina Aniculaesei, Daniel Arnsberger, Falk Howar, and Andreas Rausch. 2016. Towards the Verification of Safety-critical Autonomous Systems in Dynamic Environments. arXiv preprint arXiv:1612.04977 (2016).Google ScholarGoogle Scholar
  4. Gerd Behrmann, Alexandre David, and Kim G. Larsen. 2006. A Tutorial on Uppaal 4.0. (2006).Google ScholarGoogle Scholar
  5. Calin Belta and LCGJM Habets. 2004. Constructing decidable hybrid systems with velocity bounds. In Decision and Control, 2004. CDC. 43rd IEEE Conference on, Vol. 1. IEEE, 467--472.Google ScholarGoogle ScholarCross RefCross Ref
  6. Johan Bengtsson and Wang Yi. 2004. Timed automata: Semantics, algorithms and tools. Lecture Notes in Computer Science 3098 (2004), 87--124.Google ScholarGoogle ScholarCross RefCross Ref
  7. Samir Chouali, Azzedine Boukerche, and Ahmed Mostefaoui. 2017. Ensuring the Reliability of an Autonomous Vehicle: A Formal Approach based on Component Interaction Protocols. In Proceedings of the 20th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems. ACM, 317--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Alexandre David, Kim G Larsen, Axel Legay, Marius Mikučionis, and Danny Bøgsted Poulsen. 2015. Uppaal SMC tutorial. International Journal on Software Tools for Technology Transfer 17, 4 (2015), 397--415. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Georgios E Fainekos, Hadas Kress-Gazit, and George J Pappas. 2005. Temporal logic motion planning for mobile robots. In Robotics and Automation, 2005. ICRA 2005. Proceedings of the 2005 IEEE International Conference on. IEEE, 2020--2025.Google ScholarGoogle ScholarCross RefCross Ref
  10. Hans-Michael Hanisch, Andrei Lobov, Jose L Martinez Lastra, Reijo Tuokko, and Valeriy Vyatkin. 2006. Formal validation of intelligent-automated production systems: towards industrial applications. International Journal of Manufacturing Technology and Management 8, 1-3 (2006), 75--106.Google ScholarGoogle ScholarCross RefCross Ref
  11. Peter E Hart, Nils J Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4, 2 (1968), 100--107.Google ScholarGoogle Scholar
  12. Suresh Jeyaraman, Antonios Tsourdos, Ratal Zbikowski, and Brian White. 2005. Formal techniques for the modelling and validation of a co-operating UAV team that uses Dubins set for path planning. In American Control Conference, 2005. Proceedings of the 2005. IEEE, 4690--4695.Google ScholarGoogle ScholarCross RefCross Ref
  13. T.J. Koo, R.Q. Li, M.M. Quottrup, C.A. Clifton, R. Izadi-Zamanabadi, and T. Bak. 2012. A framework for multi-robot motion planning from temporal logic specifications. Science China Information Sciences 55, 7 (2012), 1675--1692. cited By 4.Google ScholarGoogle ScholarCross RefCross Ref
  14. T John Koo, Rongqing Li, Michael M Quottrup, Charles A Clifton, Roozbeh Izadi-Zamanabadi, and Thomas Bak. 2012. A framework for multi-robot motion planning from temporal logic specifications. Science China Information Sciences (2012), 1--18.Google ScholarGoogle Scholar
  15. Kim G Larsen, Paul Pettersson, and Wang Yi. 1997. UPPAAL in a nutshell. International journal on software tools for technology transfer 1, 1-2 (1997), 134--152. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Alex Nash and Sven Koenig. 2013. Any-angle path planning. AI Magazine 34, 4 (2013), 85--107.Google ScholarGoogle ScholarCross RefCross Ref
  17. Michael Melholt Quottrup, Thomas Bak, and RI Zamanabadi. 2004. Multi-robot planning: A timed automata approach. In Robotics and Automation, 2004. Proceedings. ICRA'04. 2004 IEEE International Conference on, Vol. 5. IEEE, 4417--4422.Google ScholarGoogle ScholarCross RefCross Ref
  18. Eman Rabiah and Boumediene Belkhouche. 2016. Formal specification, refinement, and implementation of path planning. In Innovations in Information Technology (IIT), 2016 12th International Conference on. IEEE, 1--6.Google ScholarGoogle ScholarCross RefCross Ref
  19. Steve Rabin. 2000. Game Programming Gems, chapter A* Aesthetic Optimizations. Charles River Media (2000).Google ScholarGoogle Scholar
  20. Arash Khabbaz Saberi, Jan Friso Groote, and Sarmen Keshishzadeh. 2013. Analysis of Path Planning Algorithms: a Formal Verification-based Approach.. In ECAL. 232--239.Google ScholarGoogle Scholar
  21. Rim Saddem, Olivier Naud, Karen Godary Dejean, and Didier Crestani. 2017. Decomposing the model-checking of mobile robotics actions on a grid. IFAC-PapersOnLine 50, 1 (2017), 11156--11162.Google ScholarGoogle ScholarCross RefCross Ref
  22. S. L. Smith, J. Tumova, C. Belta, and D. Rus. 2010. Optimal path planning under temporal logic constraints. In 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems. 3288--3293.Google ScholarGoogle Scholar
  23. LanAnh Trinh, Mikael Ekström, and Baran Çürüklü. 2017. Dipole Flow Field for Dependable Path Planning of Multiple Agents. In IEEE/RSJ International Conference on Intelligent Robots and Systems. http://www.es.mdh.se/publications/4883-Google ScholarGoogle Scholar
  24. Valeriy Vyatkin and Hans-Michael Hanisch. 2003. Verification of distributed control systems in intelligent manufacturing. Journal of Intelligent Manufacturing 14, 1 (2003), 123--136.Google ScholarGoogle ScholarCross RefCross Ref
  1. Formal verification of an autonomous wheel loader by model checking

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        FormaliSE '18: Proceedings of the 6th Conference on Formal Methods in Software Engineering
        June 2018
        101 pages
        ISBN:9781450357180
        DOI:10.1145/3193992

        Copyright © 2018 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 2 June 2018

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Upcoming Conference

        ICSE 2025

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader