Synthesizing Efficient Agents from Partial Programs.
Journal
Methodologies for Intelligent Systems, 6th International Symposium, ISMIS '91, Charlotte, N.C., USA, October 16-19, 1991, Proceedings
Pages
142-151
Date Issued
1991
Author(s)
Abstract
Partial programs are useful for incremental specifications of an agent's behavior in dynamic environments. Unfortunately, executing arbitrary partial programs involves theorem proving, which can be computationally intractable. This paper presents an algorithm for generating efficient implementations of agent behavior from a subclass of partial programs. The algorithm employs a completion strategy that systematically reduces the number of previous percepts being considered. As a result, the compiled structure corresponds to a finite agent with minimal perceptual histories so that its actions can be decided within a bounded time during execution.
SDGs
Type
conference paper