Using abstraction in multi-rover scheduling

Clement, B.; Barrett, A.

dc.contributor.author	Clement, B.	en_US
dc.contributor.author	Barrett, A.	en_US
dc.date.accessioned	2004-09-22T23:37:40Z
dc.date.available	2004-09-22T23:37:40Z
dc.date.issued	2001-06-18	en_US
dc.identifier.citation	I-SAIRAS 2001: A New Space Odyssey	en_US
dc.identifier.citation	Montreal, Canada	en_US
dc.identifier.clearanceno	01-1013	en_US
dc.identifier.uri	http://hdl.handle.net/2014/12752
dc.description.abstract	This paper describes how an iterative repair planner/scheduler can reason about the activities of multiple spacecraft at abstract levels in order to greatly improve the scheduling of their use of shared resources.	en_US
dc.format.extent	1259733 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.subject.other	abstraction planning rovers multiple agents	en_US
dc.title	Using abstraction in multi-rover scheduling	en_US