DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling

  • Jordan R. Abrahams Harvey Mudd College
  • David A. Chu Harvey Mudd College
  • Grace Diehl Harvey Mudd College
  • Marina Knittel Harvey Mudd College
  • Judy Lin Harvey Mudd College
  • William Lloyd Harvey Mudd College
  • James C. Boerkoel Jr Harvey Mudd College
  • Frank Jeremy NASA Ames Research Center

Abstract

Generating and executing temporal plans is difficult in uncertain environments. The current state-of-the-art algorithm for probabilistic temporal networks maintains a high success rate by rescheduling frequently as uncertain events are resolved, but this approach involves substantial resource overhead due to computing and communicating new schedules between agents. Aggressive rescheduling could thus reduce overall mission duration or success in situations where agents have limited energy or computing power, and may not be feasible when communication is limited. In this paper, we propose new approaches for heuristically deciding when rescheduling is most efficacious. We propose two compatible approaches, Allowable Risk and Sufficient Change, that can be employed in combination to compromise between the computation rate, the communication rate, and success rate for new schedules. We show empirically that both approaches allow us to gracefully trade success rate for lower computation and/or communication as compared to the state-of-the-art dynamic scheduling algorithm.

Published
2019-07-06