Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Flexible Execution of Plans with Choice

Flexible Execution of Plans with Choice

Thumbnail Image
Download
Name

Williams_FlexibleExecution.pdf

Size

181.95 KB

Format

Adobe PDF

Checksum (MD5)

17f88d72f2108380b9a540bcb1233594

Author(s)
Williams, Brian Charles
•
Conrad, Patrick Raymond
•
Shah, Julie A.
Date Issued
September 2009
Journal
19th International Conference on Automated Planning and Scheduling
Publisher
Association for the Advancement of Artificial Intelligence
Citation
Conrad, Patrick R., Julie A. Shah, and Brian C. Williams. "Flexible Execution of Plans with Choice." Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, Thessaloniki, Greece September 19, 2009–September 23, 2009.
Version
Author's final manuscript
Abstract
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executives have improved this robustness by expanding the types of choices made dynamically, such as selecting alternate methods. However, in methods to date, these additional choices introduce substantial run-time latency. This paper presents a novel system called Drake that makes steps towards executing an expanded set of choices dynamically without significant latency. Drake frames a plan as a Disjunctive Temporal Problem and executes it with a fast dynamic scheduling algorithm. Prior work demonstrated an efficient technique for dynamic execution of one special type of DTPs by using an off-line compilation step to find the possible consistent choices and compactly record the differences between them. Drake extends this work to handle a more general set of choices by recording the minimal differences between the solutions which are required at run-time. On randomly generated structured plans with choice, we show a reduction in the size of the solution set of over two orders of magnitude, compared to prior art.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/59432
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.