Designing autonomous robot missions with performance guarantees

This paper describes the need and methods required to construct an integrated software verification and mission specification system for use in robotic missions intended for counter-weapons of mass destruction (c-WMD) operations, as part of a 3-year effort for the Defense Threat Reduction Agency. The overall system architecture is described. The principal tool for verification is a process algebra, PARS, based on port automata theory. PARS is introduced, emphasizing its ability to represent probabilistic programs and uncertain and dynamic environments, followed by the analysis of mission properties for an example robotic mission.

[1]  Alastair F. Donaldson,et al.  Software Model Checking , 2014, Computing Handbook, 3rd ed..

[2]  D. Richard Blidberg,et al.  A COMMON CONTROL LANGUAGE TO SUPPORT MULTIPLE COOPERATING AUVS , 2005 .

[3]  Morgan Quigley,et al.  ROS: an open-source Robot Operating System , 2009, ICRA 2009.

[4]  Holly A. Yanco,et al.  Pyro: A python-based versatile programming environment for teaching robotics , 2004, JERC.

[5]  Richard T. Vaughan,et al.  The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .

[6]  Michael A. Arbib,et al.  Port Automata and the Algebra of Concurrent Processes , 1983, J. Comput. Syst. Sci..

[7]  Stephan Merz,et al.  Model Checking , 2000 .

[8]  Damian M. Lyons,et al.  Towards performance guarantees for emergent behavior , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[9]  Ronald C. Arkin,et al.  Getting it right the first time: predicted performance guarantees from the analysis of emergent behavior in autonomous and semi-autonomous systems , 2012, Defense, Security, and Sensing.

[10]  Ufuk Topcu,et al.  Correct, Reactive, High-Level Robot Control , 2011, IEEE Robotics & Automation Magazine.

[11]  Eugene Eberbach,et al.  $-Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems , 2005, Fundam. Informaticae.

[12]  Jean-Christophe Baillie,et al.  URBI: towards a universal robotic low-level programming language , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Yushan Chen,et al.  Automatic Deployment of Robotic Teams , 2011, IEEE Robotics & Automation Magazine.

[14]  Ronald C. Arkin,et al.  Line-of-sight constrained exploration for reactive multiagent robotic teams , 2002, 7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623).

[15]  Ronald C. Arkin,et al.  Evaluating the Usability of Robot Programming Toolsets , 1998, Int. J. Robotics Res..

[16]  M. Fitzgerald Getting it right the first time. , 1999, Advance for nurse practitioners.

[17]  Ronald C. Arkin,et al.  Motor Schema — Based Mobile Robot Navigation , 1989, Int. J. Robotics Res..

[18]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[19]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[20]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[21]  Jared Jackson Microsoft robotics studio: A technical introduction , 2007, IEEE Robotics & Automation Magazine.

[22]  Saralees Nadarajah,et al.  Drought modeling and products of random variables with exponential kernel , 2006 .

[23]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[24]  Ronald C. Arkin,et al.  Usability evaluation of high-level user assistance for robot mission specification , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[25]  Ronald C. Arkin,et al.  Multiagent Mission Specification and Execution , 1997, Auton. Robots.

[26]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[27]  P. Buchholz Equivalence Relations for Stochastic Automata Networks , 1995 .

[28]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .