Drake: An Efficient Executive for Temporal Plans with Choice

01/18/2014
by   Patrick Raymond Conrad, et al.
0

This work presents Drake, a dynamic executive for temporal plans with choice. Dynamic plan execution strategies allow an autonomous agent to react quickly to unfolding events, improving the robustness of the agent. Prior work developed methods for dynamically dispatching Simple Temporal Networks, and further research enriched the expressiveness of the plans executives could handle, including discrete choices, which are the focus of this work. However, in some approaches to date, these additional choices induce significant storage or latency requirements to make flexible execution possible. Drake is designed to leverage the low latency made possible by a preprocessing step called compilation, while avoiding high memory costs through a compact representation. We leverage the concepts of labels and environments, taken from prior work in Assumption-based Truth Maintenance Systems (ATMS), to concisely record the implications of the discrete choices, exploiting the structure of the plan to avoid redundant reasoning or storage. Our labeling and maintenance scheme, called the Labeled Value Set Maintenance System, is distinguished by its focus on properties fundamental to temporal problems, and, more generally, weighted graph algorithms. In particular, the maintenance system focuses on maintaining a minimal representation of non-dominated constraints. We benchmark Drakes performance on random structured problems, and find that Drake reduces the size of the compiled representation by a factor of over 500 for large problems, while incurring only a modest increase in run-time latency, compared to prior work in compiled executives for temporal plans with discrete choices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2013

Quasi-Bayesian Strategies for Efficient Plan Generation: Application to the Planning to Observe Problem

Quasi-Bayesian theory uses convex sets of probability distributions and ...
research
12/15/2016

Multi-Agent Path Finding with Delay Probabilities

Several recently developed Multi-Agent Path Finding (MAPF) solvers scale...
research
09/01/2023

Implementing BDI Continual Temporal Planning for Robotic Agents

Making autonomous agents effective in real-life applications requires th...
research
09/09/2011

An Expressive Language and Efficient Execution System for Software Agents

Software agents can be used to automate many of the tedious, time-consum...
research
07/12/2018

A game-theoretic approach to timeline-based planning with uncertainty

In timeline-based planning, domains are described as sets of independent...
research
07/28/2023

DISCO: Achieving Low Latency and High Reliability in Scheduling of Graph-Structured Tasks over Mobile Vehicular Cloud

To effectively process data across a fleet of dynamic and distributed ve...
research
02/28/2023

Decoding the Divide: Analyzing Disparities in Broadband Plans Offered by Major US ISPs

Digital equity in Internet access is often measured along three axes: av...

Please sign up or login with your details

Forgot password? Click here to reset