Goal selection for embedded systems with oversubscribed resources

Rabideau, Gregg; Chien, Steve; McLaren, David

dc.contributor.author	Rabideau, Gregg
dc.contributor.author	Chien, Steve
dc.contributor.author	McLaren, David
dc.date.accessioned	2014-09-16T23:11:50Z
dc.date.available	2014-09-16T23:11:50Z
dc.date.issued	2010-08-29
dc.identifier.citation	10th International Symposium on Artificial Intelligence, Robotics and Automation in Space, Sapparo, Japan, August 29 - September 1, 2010	en_US
dc.identifier.clearanceno	10-2118
dc.identifier.uri	http://hdl.handle.net/2014/44705
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, 2010	en_US
dc.title	Goal selection for embedded systems with oversubscribed resources	en_US
dc.type	Preprint	en_US