arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.1159math.OCcs.ROcs.SYeess.SY
收藏

不确定环境下具有概率满足保证的LTL控制

LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees

Boston University(波士顿大学);University of Waterloo(滑铁卢大学)

Xu Chu Ding, Stephen L. Smith, Calin Belta, Daniela Rus

AI总结:

提出一种最大化任务完成概率的机器人控制策略生成方法,任务由线性时序逻辑公式描述,通过将问题转化为马尔可夫决策过程的最优策略求解,并利用概率模型检验技术给出完整解决方案。

摘要:

我们提出一种生成机器人控制策略的方法,该策略最大化完成任务的概率。任务由一组属性的线性时序逻辑(LTL)公式给出,这些属性可以在划分环境的区域中满足。我们假设属性在区域中满足的概率已知,并且机器人只能在当前区域确定命题的真值。受分区抽象相关结果的启发,我们假设运动在图上进行。为了考虑噪声传感器和执行器,我们假设一个控制动作会启用多个具有已知概率的转移。我们证明该问题可以简化为为马尔可夫决策过程(MDP)生成控制策略的问题,使得在其状态上满足LTL公式的概率最大化。我们基于概率模型检验的现有结果,为后一个问题提供了完整解决方案。我们包含一个说明性案例研究。

英文摘要:

We present a method to generate a robot control strategy that maximizes the probability to accomplish a task. The task is given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied at the regions of a partitioned environment. We assume that the probabilities with which the properties are satisfied at the regions are known, and the robot can determine the truth value of a proposition only at the current region. Motivated by several results on partitioned-based abstractions, we assume that the motion is performed on a graph. To account for noisy sensors and actuators, we assume that a control action enables several transitions with known probabilities. We show that this problem can be reduced to the problem of generating a control policy for a Markov Decision Process (MDP) such that the probability of satisfying an LTL formula over its states is maximized. We provide a complete solution for the latter problem that builds on existing results from probabilistic model checking. We include an illustrative case study.

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

↑