期刊
ARTIFICIAL INTELLIGENCE
卷 289, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.artint.2020.103399
关键词
Working memory; Plan; Navigability; Bounded-recall; Mealy machine; Composition; Logic; Axiomatization
The article studies the ability of agents with bounded memory to execute consecutive composition of plans. It gives an upper limit on the amount of memory required to execute the composed plans and shows that the limit cannot be improved. Furthermore, the article shows that there are, essentially, no other universal properties of plans for bounded-recall agents expressible through the relation there is a plan for an agent with a given memory size to navigate from one given set of states to another. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据