The role of preprocessing in problem solving systems: "An ounce of reflection is worth a pound of backtracking"

Authors:
Clive Dawson;Laurent Siklossy
Affiliations:
Dept. of Computer Sciences, University of Texas, Austin, Texas;Dept. of Computer Sciences, University of Texas, Austin, Texas
Venue:
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Year:
1977

Citing 2
Cited 4

A Computational Model of Skill Acquisition

A Computational Model of Skill Acquisition
Simulation of executing robots in imperfectly known environments

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition

Review:

The Knowledge Engineering Review
STATIC: a problem-space compiler for PRODIGY

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Learning from goal interactions in planning: goal stack analysis and generalization

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Controlling narrative time in interactive storytelling

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe REFLECT, a problem solver in simulated robot worlds. REFLECT has successfully solved a variety of non-linear problems described as a conjunction of subtasks, including most of those found in the literature. First, during a preprocessing phase, the system explores its capabilities in the environment it is presented with. Various intrinsic properties of the given operators are inferred, such as the unattainability of certain conjunctive tasks. Macro operators are built, again considering only the given operators. REFLECT is then ready to accept problems, and proceeds by conducting backward heuristic search on a variation of a regular state-space graph termed a Goal-Kernel graph. Attention is not focused on any one sub task in particular, so that a global view of the problem is always maintained.