Problem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systems

Simple item page
dc.contributor.authorHolder, Robert
dc.date.accessioned2018-11-13T19:38:20Z
dc.date.available2018-11-13T19:38:20Z
dc.date.issued2010-05-19
dc.descriptionProceedings of The 23rd International FLAIRS Conferenceen_US
dc.description.abstractComputing 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.en_US
dc.description.urihttps://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=AOvVaw2GLeF2PsWLDpKGp4Hkm4kxen_US
dc.format.extent2 pagesen_US
dc.genreconference papers and proceedings preprintsen_US
dc.identifierdoi:10.13016/M2930NZ97
dc.identifier.citationRobert 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=AOvVaw2GLeF2PsWLDpKGp4Hkm4kxen_US
dc.identifier.urihttp://hdl.handle.net/11603/11972
dc.language.isoen_USen_US
dc.publisherAAAIen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Student Collection
dc.rightsThis 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.
dc.subjectplanningen_US
dc.subjectProblem Space Analysisen_US
dc.subjectPlan Library Generationen_US
dc.subjectAlgorithm Selectionen_US
dc.subjectReal-time Systemsen_US
dc.subjectUMBC Ebiquity Research Groupen_US
dc.titleProblem Space Analysis for Plan Library Generation and Algorithm Selection in Real-time Systemsen_US
dc.typeTexten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
476.pdf
Size:
70.15 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.68 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

UMBC Computer Science and Electrical Engineering Department
UMBC Student Collection