返回
Knowledge-Based Hierarchical POMDPs for Task Planning
DOI:10.1007/s10846-021-01348-8.png)
摘要
En 中文
The main goal in task planning is to build a sequence of actions that takes an agent from an initial state to a goal state. In robotics, this is particularly difficult because actions usually have several possible results, and sensors are prone to produce measurements with error. Partially observable Markov decision processes (POMDPs) are commonly employed, thanks to their ability to model the uncertainty of actions that modify and monitor the state of a system. However, since solving a POMDP is computationally expensive, their usage becomes prohibitive for most robotic applications. In this article, we propose a task planning architecture for service robotics. In the context of service robot design, we present a scheme to encode knowledge about the robot and its environment, that promotes the modularity and reuse of information. Also, we introduce a new recursive definition of a POMDP that enables our architecture to autonomously build a hierarchy of POMDPs, so that it can be used to generate and execute plans that solve the task at hand. Experimental results show that, in comparison to baseline methods, by following a recursive hierarchical approach the architecture is able to significantly reduce the planning time, while maintaining (or even improving) the robustness under several scenarios that vary in uncertainty and size.
Keyword:
Task planning
Hierarchical POMDP
Service robotics
Decision making
Knowledge-based systems
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
2.8
论文数:
3.9K
被引数:
6.9K
机构
引用论文
Functional Site Discovery From Incomplete Training Data: A Case Study With Nucleic Acid–Binding Proteins从非完整训练数据中发现功能位点:以核酸结合蛋白为例

