arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.09837cs.AIcs.LO
收藏

有限域上度量时间约束Golog规划的控制器综合

Controller Synthesis for Golog Programs over Finite Domains with Metric Temporal Constraints

RWTH Aachen University(亚琛工业大学)

Till Hofmann, Gerhard Lakemeyer

摘要:

在实际机器人上执行Golog程序通常需要额外的步骤来考虑机器人平台的硬件或软件细节,这些细节可以被公式化为对程序的约束。这些约束通常是时间性的,指的是度量时间,并且需要对抽象Golog程序进行修改。我们描述了如何制定这样的约束的基础上的模态变量的情况演算。这些约束连接抽象程序与平台模型,我们使用时间自动机描述。我们表明,在有限域和完全已知的初始状态的程序,合成的控制器,满足约束,同时保持原程序的效果的问题可以减少到MTL合成。我们这样做是通过构建一个时间自动机的抽象程序和合成MTL控制器从这个自动机,平台模型和约束。我们证明,合成的控制器的执行轨迹是相同的原始程序,可能交错与平台相关的行动,他们满足所有的约束条件,并且它们具有相同的效果作为原始程序的痕迹。通过这样做,我们得到一个可判定的过程来合成一个控制器,满足规格,同时保留原始程序。

英文摘要:

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, the platform models, and the constraints. We prove that the synthesized controller results in execution traces which are the same as those of the original program, possibly interleaved with platform-dependent actions, that they satisfy all constraints, and that they have the same effects as the traces of the original program. By doing so, we obtain a decidable procedure to synthesize a controller that satisfies the specification while preserving the original program.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑