Anticipatory On-Line Planning
Burns, Ethan (University of New Hampshire) | Benton, J. (Graduate Student, Arizona State University) | Ruml, Wheeler (University of New Hampshire) | Yoon, Sungwook (Palo Alto Research Center) | Do, Minh B. (NASA Ames Research Center)
We consider the problem of on-line continual planning, in whichadditional goals may arrive while plans for previous goals are stillexecuting and plan quality depends on how quickly goals are achieved.This is a challenging problem even in domains with deterministicactions. One common and straightforward approach is reactive planning,in which plans are synthesized when a new goal arrives. In this paper,we adapt the technique of hindsight optimization from on-line schedulingand probabilistic planning to create an anticipatory on-line planningalgorithm. Using an estimate of the goal arrival distribution, wesample possible futures and use a deterministic planner to estimate thevalue of taking possible actions at each time step. Results in twobenchmark domains based on unmanned aerial vehicle planning andmanufacturing suggest that an anticipatory approach yields a superiorplanner that is sensitive not only to which action should be executed,but when.
Jun-8-2012
- Country:
- North America > United States
- Arizona > Maricopa County
- Tempe (0.04)
- California > Santa Clara County
- Palo Alto (0.04)
- New Hampshire (0.04)
- Arizona > Maricopa County
- North America > United States
- Industry:
- Technology: