Scheduling with Complex Consumptive Resources for a Planetary Rover

Wayne Chi, Steve Chien, Jagriti Agrawal

PosterID: 68
picture_as_pdf PDF
library_books Slides
library_books Poster
menu_book BibTeX
Generating and scheduling activities is particularly challenging when considering both consumptive resources and complex resource interactions such as time-dependent resource usage. We present three methods of determining valid temporal placement intervals for an activity in a temporally grounded plan in the presence of such constraints. We introduce the Max Duration and Probe algorithms which are sound, but incomplete, and the Linear algorithm which is sound and complete for linear rate resource consumption. We apply these techniques to the problem of scheduling awake and asleep episodes for a planetary rover where the awake durations are affected by scheduled activities. We demonstrate how the Probe algorithm performs competitively with the Linear algorithm given an advantageous problem space and well-defined heuristics. We show that the Probe and Linear algorithms outperform the Max Duration algorithm empirically. We then present the runtime differences between the three algorithms. The Probe algorithm is currently base-lined for use in the onboard scheduler for NASA’s next planetary rover, the Mars 2020 rover.

Session Am2: Scheduling & Traffic Control
Canb 10/29/2020, 03:00 – 04:00
10/31/2020, 10:00 – 11:00
Paris 10/28/2020, 17:00 – 18:00
10/31/2020, 00:00 – 01:00
NYC 10/28/2020, 12:00 – 13:00
10/30/2020, 19:00 – 20:00
LA 10/28/2020, 09:00 – 10:00
10/30/2020, 16:00 – 17:00