On the Synthesis of Guaranteed-Quality Plans for Robot Fleets in Logistics Scenarios via Optimization Modulo Theories

In manufacturing, the increasing involvement of autonomous robots in production processes poses new challenges on the production management. In this paper we report on the usage of Optimization Modulo Theories (OMT) to solve certain multi-robot scheduling problems in this area. Whereas currently existing methods are heuristic, our approach guarantees optimality for the computed solution. We do not only present our final method but also its chronological development, and draw some general observations for the development of OMT-based approaches.

[1]  T. Niemueller,et al.  Planning Competition for Logistics Robots in Simulation , 2016 .

[2]  Gerhard Lakemeyer,et al.  Towards CLIPS-based Task Execution and Monitoring with SMT-based Decision Optimization , 2017 .

[3]  Roberto Sebastiani,et al.  OptiMathSAT: A Tool for Optimization Modulo Theories , 2015, Journal of Automated Reasoning.

[4]  Vijay Kumar,et al.  Automated composition of motion primitives for multi-robot systems from safe LTL specifications , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Swarat Chaudhuri,et al.  Incremental Task and Motion Planning: A Constraint-Based Approach , 2016, Robotics: Science and Systems.

[6]  Swarat Chaudhuri,et al.  SMT-based synthesis of integrated task and motion plans from plan outlines , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Roberto Sebastiani,et al.  Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions , 2014, TACAS.

[8]  Roberto Sebastiani,et al.  Optimization in SMT with LA(Q) Cost Functions , 2012 .

[9]  Nikolaj Bjørner,et al.  νZ - An Optimizing SMT Solver , 2015, TACAS.

[10]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[11]  G. Lakemeyer,et al.  The RoboCup Logistics League as a Benchmark for Planning in Robotics , 2015 .

[12]  Gerhard Lakemeyer,et al.  Continual Planning in Golog , 2016, AAAI.

[13]  Swarat Chaudhuri,et al.  Task and Motion Policy Synthesis as Liveness Games , 2016, ICAPS.

[14]  Silvia Tomasi,et al.  Optimization Modulo Theories with Linear Rational Costs , 2014, ACM Trans. Comput. Log..

[15]  Erika Ábrahám,et al.  Satisfiability Checking: Theory and Applications , 2016, SEFM.

[16]  Andrew Coles,et al.  Forward-Chaining Partial-Order Planning , 2010, ICAPS.

[17]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[18]  Sebastian Junges,et al.  SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving , 2015, SAT.

[19]  Albert Oliveras,et al.  On SAT Modulo Theories and Optimization Problems , 2006, SAT.

[20]  Alexander Ferrein,et al.  Incremental Task-Level Reasoning in a Competitive Factory Automation Scenario , 2013, AAAI Spring Symposium: Designing Intelligent Robots.