On composition of bounded-recall plans
作者:
摘要
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”.
论文关键词:Working memory,Plan,Navigability,Bounded-recall,Mealy machine,Composition,Logic,Axiomatization
论文评审过程:Received 9 May 2019, Revised 29 July 2020, Accepted 2 October 2020, Available online 7 October 2020, Version of Record 13 October 2020.
论文官网地址:https://doi.org/10.1016/j.artint.2020.103399