Problem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systems
Loading...
Files
Permanent Link
Author/Creator
Author/Creator ORCID
Date
2010-05-19
Type of Work
Department
Program
Citation of Original Publication
Robert Holder, Problem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systems, Proceedings of The 23rd International FLAIRS Conference ,2010, https://www.google.com/url?q=https://www.aaai.org/ocs/index.php/FLAIRS/2010/paper/download/1408/1725&sa=U&ved=0ahUKEwjlmrbIxr3eAhXOneAKHU2xD_kQFggEMAA&client=internal-uds-cse&cx=016314354884912110518:gwmynp16xuu&usg=AOvVaw2GLeF2PsWLDpKGp4Hkm4kx
Rights
This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Abstract
Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include. Strategic selections will ensure that the library contains an appropriate plan for encountered situations. This work discusses preliminary investigations into a scheme in which problem space analysis drives the creation of an efficient plan library. For complex problems, an exact analysis of the problem space is not feasible, and an efficient means of creating an approximate analysis is required. Thus, this work proposes the development of algorithms to efficiently generate and leverage the problem space analysis of complex planning problems.