Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Variable-Delay Controllability

Variable-Delay Controllability

Thumbnail Image
Download
Name

variable-delay-controllability.pdf

Description
Accepted version
Size

1003.96 KB

Format

Adobe PDF

Checksum (MD5)

16d2a595d5cf071ece4ba668463ae5f7

sword-2019-11-04T13:53:13.original.xml (130 B)
Original SWORD entry document
Author(s)
Bhargava, Nikhil
•
Muise, Christian
•
Williams, Brian
Date Issued
July 2018
Journal
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
Publisher
International Joint Conferences on Artificial Intelligence
Citation
Bhargava, Nikhil, Christian Muise and Brian Williams. “Variable-Delay Controllability.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, July 13-19, 2018, International Joint Conferences on Artificial Intelligence, pp. 4660-4666 © 2019 The Author(s)
Version
Author's final manuscript
Abstract
In temporal planning, agents must schedule a set of events satisfying a set of predetermined constraints. These scheduling problems become more difficult when the duration of certain actions are outside the agent's control. Delay controllability is the generalized notion of whether a schedule can be constructed in the face of uncertainty if the agent eventually learns when events occur. Our work introduces the substantially more complex setting of determining variable-delay controllability, where an agent learns about events after some unknown but bounded amount of time has passed. We provide an efficient O(n3) variable-delay controllability checker and show how to create an execution strategy for variable-delay controllability problems. To our knowledge, these essential capabilities are absent from existing controllability checking algorithms. We conclude by providing empirical evaluations of the quality of variable-delay controllability results as compared to approximations that use fixed delays to model the same problems.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/125711
DOI of Published Version
https://doi.org/10.24963/IJCAI.2018/648
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.