{"type":"ScholarlyArticle","title":"Managing Communication Costs under Temporal Uncertainty","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":"Tiago Vaquero","slug":"tiago-vaquero","given":"Tiago","family":"Vaquero","affiliation":"Massachusetts Institute of Technology"},{"name":"Brian Williams","slug":"brian-williams","given":"Brian","family":"Williams","affiliation":"Massachusetts Institute of Technology"}],"abstract":"In multi-agent temporal planning, individual agents cannot know a priori when other agents will execute their actions and so treat those actions as uncertain. Only when others communicate the results of their actions is that uncertainty resolved. If a full communication protocol is specified ahead of time, then delay controllability can be used to assess the feasibility of the temporal plan. However, agents often have flexibility in choosing when to communicate the results of their action. In this paper, we address the question of how to choose communication protocols that guarantee the feasibility of the original temporal plan subject to some cost associated with that communication. To do so, we introduce a means of extracting delay controllability conflicts and show how we can use these conflicts to more efficiently guide our search. We then present three conflict-directed search algorithms and explore the theoretical and empirical trade-offs between the different approaches.","doi":"10.24963/ijcai.2018/12","url":"https://ijcai.org/proceedings/2018/12","pdf":"https://ijcai.org/proceedings/2018/0012.pdf","markdown":"https://ijcai.org/proceedings/2018/12.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/12","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":"Agent-based and Multi-agent Systems","track":"Main track","number":12,"pages":{"first":84,"last":90},"keywords":["Agent-based and Multi-agent Systems: Multi-agent Planning","Planning and Scheduling: Planning and Scheduling","Planning and Scheduling: Search in Planning and Scheduling"],"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":"[Cui et al., 2015] Jing Cui, Peng Yu, Cheng Fang, Patrik Haslum, and Brian Charles Williams. Optimising bounds in simple temporal networks with uncertainty under dy- namic controllability constraints. In ICAPS, pages 52-60, 2015.","title":"Optimising bounds in simple temporal networks with uncertainty under dynamic controllability constraints","authors":"Jing Cui, Peng Yu, Cheng Fang, Patrik Haslum, Brian Charles Williams","year":"2015","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":4,"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":5,"raw":"[Morris, 2006] Paul Morris. A structural characterization of temporal dynamic controllability. In International Confer- ence on Principles and Practice of Constraint Program- ming, pages 375-389. Springer, 2006.","title":"A structural characterization of temporal dynamic controllability","authors":"Paul Morris","year":"2006","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Morris, 2014] Paul Morris. Dynamic controllability and dis- patchability relationships. In International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pages 464-479. Springer, 2014.","title":"Dynamic controllability and dispatchability relationships","authors":"Paul Morris","year":"2014","venue":"International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems","doi":null,"url":null,"internal_url":null},{"position":7,"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},{"position":8,"raw":"[Wang and Williams, 2015] Andrew J. Wang and Brian C. Williams. Chance-constrained scheduling via conflict- directed risk allocation. In Proceedings of the Twenty- Ninth AAAI Conference on Artificial Intelligence, January 2015.","title":"Chance-constrained scheduling via conflictdirected risk allocation","authors":"Andrew J Wang, Brian C Williams","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Williams and Ragno, 2007] Brian C Williams and Robert J Ragno. Conflict-directed a* and its role in model- based embedded systems. Discrete Applied Mathematics, 155(12):1562-1595, 2007.","title":"Conflict-directed a* and its role in modelbased embedded systems","authors":"C Brian, Robert J Williams, Ragno","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Yu et al., 2014] Peng Yu, Cheng Fang, and Brian C Williams. Resolving uncontrollable conditional temporal problems using continuous relaxations. In ICAPS, 2014.","title":"Resolving uncontrollable conditional temporal problems using continuous relaxations","authors":"Peng Yu, Cheng Fang, Brian C Williams","year":"2014","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Yu et al., 2015] Peng Yu, Cheng Fang, and Brian C. Williams. Resolving over-constrained probabilistic tem- poral problems through chance constraint relaxation. In Proceedings of the Twenty-Ninth AAAI Conference on Ar- tificial Intelligence, Austin, TX, July 2015.","title":"Resolving over-constrained probabilistic temporal problems through chance constraint relaxation","authors":"Peng Yu, Cheng Fang, Brian C Williams","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}