The University of Southampton
University of Southampton Institutional Repository

Navigability with Intermediate Constraints

Navigability with Intermediate Constraints
Navigability with Intermediate Constraints
The article studies navigability of an autonomous agent in a maze where some rooms may be indistinguishable. In a previous work the au- thors have shown that the properties of navigability in such a setting depend on whether an agent has perfect recall. Navigability by strategies with perfect recall is a transitive relation and navigability by memoryless strategies is not. Independently, Li and Wang proposed a notion of navigability with intermediate constraints for linear navigation strategies. Linear strategies are different from both perfect recall and memoryless strategies. This article shows that a certain form of transitivity, expressible in the language with intermediate constraints, holds for memoryless strate- gies. The main technical result is a sound and complete logical system describing the properties of memoryless strategies in the language with intermediate constraints.
1647-1670
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Deuser, Kaya
23a1de64-9965-4ce3-9cf5-33546306002b
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0

Deuser, Kaya and Naumov, Pavel (2018) Navigability with Intermediate Constraints. Journal of Logic and Computation, 28 (7), 1647-1670. (doi:10.1093/logcom/exy021).

Record type: Article

Abstract

The article studies navigability of an autonomous agent in a maze where some rooms may be indistinguishable. In a previous work the au- thors have shown that the properties of navigability in such a setting depend on whether an agent has perfect recall. Navigability by strategies with perfect recall is a transitive relation and navigability by memoryless strategies is not. Independently, Li and Wang proposed a notion of navigability with intermediate constraints for linear navigation strategies. Linear strategies are different from both perfect recall and memoryless strategies. This article shows that a certain form of transitivity, expressible in the language with intermediate constraints, holds for memoryless strate- gies. The main technical result is a sound and complete logical system describing the properties of memoryless strategies in the language with intermediate constraints.

Text
2018-jlc - Accepted Manuscript
Download (345kB)

More information

Accepted/In Press date: 2 July 2018
Published date: 15 August 2018

Identifiers

Local EPrints ID: 478941
URI: http://eprints.soton.ac.uk/id/eprint/478941
PURE UUID: 3dce5f0f-a929-45b8-8d48-ac5b6094afa3
ORCID for Pavel Naumov: ORCID iD orcid.org/0000-0003-1687-045X

Catalogue record

Date deposited: 14 Jul 2023 16:59
Last modified: 17 Mar 2024 04:10

Export record

Altmetrics

Contributors

Author: Kaya Deuser
Author: Pavel Naumov ORCID iD

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×