Arrow Research search
Back to AAAI

AAAI 2008

Improving a Plan Library for Real-time Systems Using Nearly Orthogonal Latin Hypercube Sampling

Short Paper Student Abstracts Artificial Intelligence

Abstract

Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this challenge includes off-line computation, such as precomputing a plan library. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include in the library. Strategic selections will reduce the probability that a system encounters a situation for which it does not have an appropriate plan in the library to either apply directly or adapt. Choosing variable values using Latin hypercubes is a technique used to reduce the number of test cases required in order to validate complex systems. Here we discuss the application of a variation of this technique, nearly orthogonal Latin hypercubes, to planning spaces in order reduce the number of plans a system must cache in its library.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
AAAI Conference on Artificial Intelligence
Archive span
1980-2026
Indexed papers
28718
Paper id
366932086295943886
v2026.09.13