Sciweavers

Share
AIPS
2008

Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation

9 years 12 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the effect of uncertainty and disturbance is to dynamically schedule the plan online, through dispatchable execution. Dispatchable execution increases the efficiency of plan execution by introducing (1) a compiler that reduces a plan to a dispatchable form that enables real-time scheduling, and (2) a temporal plan dispatcher that schedules start times of activities (or controllable events) dynamically in response to disturbances. Previous work addresses efficient dispatchable execution of plans described as Simple Temporal Problems (STPs). While STPs have proven useful for many applications, Temporal Constraint Satisfaction Problems (TCSPs) provide a more rich language by introducing disjunctive constraints. However, previous approaches to dispatchable execution of disjunctive temporal plans are intractable for mo...
Julie A. Shah, Brian C. Williams
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AIPS
Authors Julie A. Shah, Brian C. Williams
Comments (0)
books