arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.08159cs.AI
收藏

目标不确定的随机环境中的规划问题

Planning in Stochastic Environments with Goal Uncertainty

College of Information and Computer Sciences, University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校信息与计算机科学学院);Alliance Innovation Lab Silicon Valley(联盟硅谷创新实验室)

Sandhya Saisubramanian, Kyle Hollins Wray, Luis Pineda, Shlomo Zilberstein

摘要:

我们提出了目标不确定的随机最短路径(GUSSP)问题-一个通用的框架模型的路径规划和决策在随机环境中的目标不确定性。该框架扩展了随机最短路径(SSP)模型的动态环境中,它是不可能的,以确定确切的目标状态提前执行计划。GUSSP通过允许对可能的目标配置的信念来引入目标规范的灵活性。潜在目标的独特观察有助于智能体在计划执行期间识别真正的目标。部分可观测性被限制到目标,便于减少到一个SSP与修改的状态空间。我们正式定义了一个GUSSP,并讨论其理论性质。然后,我们提出了一个可接受的启发式,减少规划时间使用FLARES -一个开始的最先进的概率规划。我们还提出了一个确定性的方法来解决这类问题。最后,我们提出了实证研究结果的搜索和救援移动机器人和其他三个问题域的模拟。

英文摘要:

We present the Goal Uncertain Stochastic Shortest Path (GUSSP) problem -- a general framework to model path planning and decision making in stochastic environments with goal uncertainty. The framework extends the stochastic shortest path (SSP) model to dynamic environments in which it is impossible to determine the exact goal states ahead of plan execution. GUSSPs introduce flexibility in goal specification by allowing a belief over possible goal configurations. The unique observations at potential goals helps the agent identify the true goal during plan execution. The partial observability is restricted to goals, facilitating the reduction to an SSP with a modified state space. We formally define a GUSSP and discuss its theoretical properties. We then propose an admissible heuristic that reduces the planning time using FLARES -- a start-of-the-art probabilistic planner. We also propose a determinization approach for solving this class of problems. Finally, we present empirical results on a search and rescue mobile robot and three other problem domains in simulation.

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

↑