{"type":"ScholarlyArticle","title":"Variable-Delay Controllability","authors":[{"name":"Nikhil Bhargava","slug":"nikhil-bhargava","given":"Nikhil","family":"Bhargava","affiliation":"Massachusetts Institute of Technology"},{"name":"Christian Muise","slug":"christian-muise","given":"Christian","family":"Muise","affiliation":"Massachusetts Institute of Technology"},{"name":"Brian Williams","slug":"brian-williams","given":"Brian","family":"Williams","affiliation":"Massachusetts Institute of Technology"}],"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(n^3) 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.","doi":"10.24963/ijcai.2018/648","url":"https://ijcai.org/proceedings/2018/648","pdf":"https://ijcai.org/proceedings/2018/0648.pdf","markdown":"https://ijcai.org/proceedings/2018/648.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/648","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":648,"pages":{"first":4660,"last":4666},"keywords":["Planning and Scheduling: Planning and Scheduling","Planning and Scheduling: Planning under Uncertainty"],"videos":[],"references":[{"position":1,"raw":"[Bhargava et al., 2017] Nikhil Bhargava, Tiago Vaquero, and Brian Williams. Faster conflict generation for dynamic controllability. In Proceedings of the Twenty-Sixth Inter- national Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-26, 2017, pages 4280-4286, 2017.","title":"Faster conflict generation for dynamic controllability","authors":"Nikhil Bhargava, Tiago Vaquero, Brian Williams","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/598"},{"position":2,"raw":"[Bhargava et al., 2018] Nikhil Bhargava, Christian Muise, Tiago Vaquero, and Brian Williams. Delay controllabil- ity: Multi-agent coordination under communication delay. In DSpace@MIT, 2018.","title":"Delay controllability: Multi-agent coordination under communication delay","authors":"Nikhil Bhargava, Christian Muise, Tiago Vaquero, Brian Williams","year":"2018","venue":"DSpace@MIT","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bit-Monnot et al., 2016] Arthur Bit-Monnot, Malik Ghal- lab, and Félix Ingrand. Which contingent events to ob- serve for the dynamic controllability of a plan. In Interna- tional Joint Conference on Artificial Intelligence (IJCAI- 16), 2016.","title":"Arthur Bit-Monnot, Malik Ghallab, and Félix Ingrand. Which contingent events to observe for the dynamic controllability of a plan","authors":"Bit-Monnot","year":"2016","venue":"International Joint Conference on Artificial Intelligence (IJCAI-16)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Casanova et al., 2016] Guillaume Casanova, Cédric Pralet, Charles Lesire, and Thierry Vidal. Solving dynamic con- trollability problem of multi-agent plans with uncertainty using mixed integer linear programming. In ECAI, pages 930-938, 2016.","title":"Solving dynamic controllability problem of multi-agent plans with uncertainty using mixed integer linear programming","authors":"Casanova","year":"2016","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Combi et al., 2013] Carlo Combi, Luke Hunsberger, and Roberto Posenato. An algorithm for checking the dynamic controllability of a conditional simple temporal network with uncertainty. Evaluation, 1:1, 2013.","title":"An algorithm for checking the dynamic controllability of a conditional simple temporal network with uncertainty","authors":"Carlo Combi, Luke Hunsberger, Roberto Posenato","year":"2013","venue":"Evaluation","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dechter et al., 1991] Rina Dechter, Itay Meiri, and Judea Pearl. Temporal constraint networks. Artificial intelli- gence, 49(1-3):61-95, 1991.","title":"Temporal constraint networks","authors":"Rina Dechter, Itay Meiri, Judea Pearl","year":"1991","venue":"Artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fang et al., 2014] Cheng Fang, Peng Yu, and Brian C Williams. Chance-constrained probabilistic simple tem- poral problems. 2014.","title":"Chance-constrained probabilistic simple temporal problems","authors":"Cheng Fang, Peng Yu, Brian C Williams","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Moffitt and Pollack, 2007] Michael D Moffitt and Martha E Pollack. Generalizing temporal controllability. In IJCAI, pages 1985-1990, 2007.","title":"Generalizing temporal controllability","authors":"D Michael, Martha E Moffitt, Pollack","year":"2007","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/320"},{"position":9,"raw":"[Moffitt, 2007] Michael D Moffitt. On the partial observabil- ity of temporal uncertainty. In Proceedings of the Na- tional Conference on Artificial Intelligence, volume 22, page 1031. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2007.","title":"On the partial observability of temporal uncertainty","authors":"D Michael, Moffitt","year":"1031","venue":"Proceedings of the National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nilsson et al., 2013] Mikael Nilsson, Jonas Kvarnström, and Patrick Doherty. Incremental dynamic controllability revisited. In ICAPS, 2013.","title":"Incremental dynamic controllability revisited","authors":"Nilsson","year":"2013","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Nilsson et al., 2014] Mikael Nilsson, Jonas Kvarnström, and Patrick Doherty. Incremental dynamic controllabil- ity in cubic worst-case time. In Temporal Representation and Reasoning (TIME), 2014 21st International Sympo- sium on, pages 17-26. IEEE, 2014.","title":"Incremental dynamic controllability in cubic worst-case time","authors":"Nilsson","year":"2014","venue":"Temporal Representation and Reasoning (TIME)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Shah et al., 2007] Julie A Shah, John Stedl, Brian C Williams, and Paul Robertson. A fast incremental algo- rithm for maintaining dispatchability of partially control- lable plans. In ICAPS, pages 296-303, 2007.","title":"A fast incremental algorithm for maintaining dispatchability of partially controllable plans","authors":"Julie A Shah, John Stedl, Brian C Williams, Paul Robertson","year":"2007","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Stedl and Williams, 2005] John Stedl and Brian C Williams. A fast incremental dynamic controllabil- ity algorithm. In Proceedings of the ICAPS Workshop on Plan Execution: A Reality Check, pages 69-75, 2005.","title":"A fast incremental dynamic controllability algorithm","authors":"John Stedl, Brian C Williams","year":"2005","venue":"Proceedings of the ICAPS Workshop on Plan Execution: A Reality Check","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Vidal and Fargier, 1999] Thierry Vidal and Helene Fargier. Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experi- mental & Theoretical Artificial Intelligence, 11(1):23-45, 1999.","title":"Handling contingency in temporal constraint networks: from consistency to controllabilities","authors":"Thierry Vidal, Helene Fargier","year":"1999","venue":"Journal of Experimental & Theoretical Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}