arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.07028cs.AIcs.ROcs.SC
收藏

随机域上带环规划综合的一个正确性结果

A Correctness Result for Synthesizing Plans With Loops in Stochastic Domains

University of Edinburgh(爱丁堡大学);Alan Turing Institute(艾伦·图灵研究所)

Laszlo Treszkai, Vaishak Belle

摘要:

随机状态控制器(FSC),如带有循环的计划,是广泛用于机器人,视频游戏和物流的动作选择的强大而紧凑的表示。在确定性环境中合成FSC已经取得了稳步进展,但将这种技术提升到随机环境所需的算法机制尚未完全理解。虽然FSC的推导在贴现预期奖励措施的背景下得到了一些关注,但它们通常近似求解和/或没有正确性保证。从本质上讲,这使得分析基本问题变得困难,例如:所有路径是否终止,大多数路径是否到达目标状态?在本文中,我们提出了新的理论成果的通用技术合成FSC在随机环境中,允许高粒度规格的终止和目标满意度。

英文摘要:

Finite-state controllers (FSCs), such as plans with loops, are powerful and compact representations of action selection widely used in robotics, video games and logistics. There has been steady progress on synthesizing FSCs in deterministic environments, but the algorithmic machinery needed for lifting such techniques to stochastic environments is not yet fully understood. While the derivation of FSCs has received some attention in the context of discounted expected reward measures, they are often solved approximately and/or without correctness guarantees. In essence, that makes it difficult to analyze fundamental concerns such as: do all paths terminate, and do the majority of paths reach a goal state? In this paper, we present new theoretical results on a generic technique for synthesizing FSCs in stochastic environments, allowing for highly granular specifications on termination and goal satisfaction.

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

↑