Controller Synthesis for Golog Programs over Finite Domains with Metric Temporal Constraints
Till Hofmann, Gerhard Lakemeyer

TL;DR
This paper presents a method for synthesizing controllers for Golog programs over finite domains with metric temporal constraints by reducing the problem to MTL synthesis, ensuring the execution respects platform-specific constraints.
Contribution
It introduces a novel approach to formulate and synthesize controllers for Golog programs with temporal constraints using timed automata and MTL, ensuring correctness and platform compatibility.
Findings
Controller synthesis reduces to MTL synthesis for finite domain Golog programs.
Constructed timed automata accurately represent program and platform constraints.
Synthesized controllers guarantee execution traces match original program effects.
Abstract
Executing a Golog program on an actual robot typically requires additional steps to account for hardware or software details of the robot platform, which can be formulated as constraints on the program. Such constraints are often temporal, refer to metric time, and require modifications to the abstract Golog program. We describe how to formulate such constraints based on a modal variant of the Situation Calculus. These constraints connect the abstract program with the platform models, which we describe using timed automata. We show that for programs over finite domains and with fully known initial state, the problem of synthesizing a controller that satisfies the constraints while preserving the effects of the original program can be reduced to MTL synthesis. We do this by constructing a timed automaton from the abstract program and synthesizing an MTL controller from this automaton,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
