On composition of bounded-recall plans
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".
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
1 December 2020
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Abstract
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".
Text
2020-ai3
- Accepted Manuscript
More information
Accepted/In Press date: 2 October 2020
e-pub ahead of print date: 7 October 2020
Published date: 1 December 2020
Identifiers
Local EPrints ID: 457232
URI: http://eprints.soton.ac.uk/id/eprint/457232
ISSN: 0004-3702
PURE UUID: 598c2c39-80f3-4453-994a-aa20b70a3204
Catalogue record
Date deposited: 26 May 2022 16:54
Last modified: 17 Mar 2024 04:10
Export record
Altmetrics
Contributors
Author:
Kaya Deuser
Author:
Pavel Naumov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics