Skip to main content
Kent Academic Repository

Isomorph-Free Branch and Bound Search for Finite State Controllers

Grzes, Marek, Poupart, Pascal, Hoey, Jesse (2013) Isomorph-Free Branch and Bound Search for Finite State Controllers. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). . (KAR id:48657)

Abstract

The recent proliferation of smart-phones and other wearable devices has lead

to a surge of new mobile applications. Partially observable Markov decision

processes provide a natural framework to design applications that

continuously make decisions based on noisy sensor measurements. However,

given the limited battery life, there is a need to minimize the amount of

online computation. This can be achieved by compiling a policy into a

finite state controller since there is no need for belief monitoring or

online search. In this paper, we propose a new branch and bound technique

to search for a good controller. In contrast to many existing algorithms

for controllers, our search technique is not subject to local optima. We

also show how to reduce the amount of search by avoiding the enumeration of

isomorphic controllers and by taking advantage of suitable upper and lower

bounds. The approach is demonstrated on several benchmark problems as well

as a smart-phone application to assist persons with Alzheimer's to wayfind.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > Q Science (General)
Q Science > Q Science (General) > Q335 Artificial intelligence
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Marek Grzes
Date Deposited: 26 May 2015 20:43 UTC
Last Modified: 10 Dec 2022 02:18 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/48657 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.