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.
Doc2Spec: Synthesizing Formal Programming Specifications from Natural Language via Grammar Induction
The Pennsylvania State University(宾夕法尼亚州立大学);University of the Chinese Academy of Sciences(中国科学院大学);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)
Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning
Nanyang Technological University, Singapore(新加坡南洋理工大学);Tata Institute of Fundamental Research, Mumbai, India(印度孟买印度理工学院基础研究所以);Université Libre de Bruxelles, Brussels, Belgium(比利时布鲁塞尔自由大学);IITB Trust Lab, Department of CSE, IIT Bombay, Mumbai, India(印度孟买印度理工学院 Bombay 电子与计算机科学系信托实验室)
SimWorld-Robotics: Synthesizing Photorealistic and Dynamic Urban Environments for Multimodal Robot Navigation and Collaboration
University of Virginia(弗吉尼亚大学);UC San Diego(加州大学圣地亚哥分校);Johns Hopkins University(约翰霍普金斯大学);Carnegie Mellon University(卡内基梅隆大学);University of Michigan(密歇根大学)