JPL Technical Report Server

Tractable goal selection with oversubscribed resources

Show simple item record Rabideau, Gregg Chien, Steve McLaren, David 2015-05-14T23:15:10Z 2015-05-14T23:15:10Z 2009-07-19
dc.identifier.citation 6th International Workshop on Planning and Scheduling for Space, Pasadena, California, July 19-21, 2009 en_US
dc.identifier.clearanceno 09-2369
dc.description.abstract We describe an efficient, online goal selection algorithm and its use for selecting goals at runtime. Our focus is on the re-planning that must be performed in a timely manner on the embedded system where computational resources are limited. In particular, our algorithm generates near optimal solutions to problems with fully specified goal requests that oversubscribe available resources but have no temporal flexibility. By using a fast, incremental algorithm, goal selection can be postponed in a “just-in-time” fashion allowing requests to be changed or added at the last minute. This enables shorter response cycles and greater autonomy for the system under control. en_US
dc.description.sponsorship NASA/JPL en_US
dc.language.iso en_US en_US
dc.publisher Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2009 en_US
dc.title Tractable goal selection with oversubscribed resources en_US
dc.type Preprint en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record



My Account