LIPIcs.TIME.2024.13.pdf
- Filesize: 0.79 MB
- 14 pages
Document
Introducing Interdependent Simple Temporal Networks with Uncertainty for Multi-Agent Temporal Planning
Authors
Thierry Vidal 
,
Andrea Micheli ,
Alessandro Cimatti
-
Part of:
Volume:
31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Temporal Representation and Reasoning (TIME) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-22
File
Document Identifiers
Author Details
Cite As Get BibTex
Ajdin Sumic, Thierry Vidal, Andrea Micheli, and Alessandro Cimatti. Introducing Interdependent Simple Temporal Networks with Uncertainty for Multi-Agent Temporal Planning. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.TIME.2024.13
Abstract
Simple Temporal Networks with Uncertainty are a powerful and widely used formalism for representing and reasoning over convex temporal constraints in the presence of uncertainty called contingent constraints. Since their introduction, they have been used in planning and scheduling applications to model situations where the scheduling agent does not control some activity durations or event timings. What needs to be checked is then the controllability of the network, i.e., that there is a valid execution strategy whatever the values of the contingents. This paper considers a new type of multi-agent extension, where, as opposed to previous works, each agent manages its own separate STNU, and the control over activity durations is shared among the agents: what is called here a contract is a mutual constraint controllable for some agent and contingent for others. We will propose a semantically enriched version of STNUs that will be composed into a global Multi-agent Interdependent STNUs model. Then, controllability issues will be revisited, and we will focus on the repair problem, i.e., how to regain failed controllability by shrinking some of the shared contract durations, here in a centralized manner.
Subject Classification
ACM Subject Classification
- Computing methodologies
Keywords
- Temporal constraints satisfaction
- uncertainty
- STNU
- Controllability checking
- Explainable inconsistency
- Multi-agent planning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Arthur Bit-Monnot, Malik Ghallab, Félix Ingrand, and David E. Smith. FAPE: a constraint-based planner for generative and hierarchical temporal planning. CoRR, abs/2010.13121, 2020. URL: https://arxiv.org/abs/2010.13121.
- James C. Boerkoel and Edmund H. Durfee. Distributed reasoning for multiagent simple temporal problems. J. Artif. Intell. Res., 47:95-156, 2013. URL: https://doi.org/10.1613/JAIR.3840.
- Guillaume Casanova, Cédric Pralet, Charles Lesire, and Thierry Vidal. Solving dynamic controllability problem of multi-agent plans with uncertainty using mixed integer linear programming. In Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, and Frank van Harmelen, editors, ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 930-938. IOS Press, 2016. URL: https://doi.org/10.3233/978-1-61499-672-9-930.
- Amedeo Cesta, Angelo Oddi, and Stephen F. Smith. A constraint-based method for project scheduling with time windows. J. Heuristics, 8(1):109-136, 2002. URL: https://doi.org/10.1023/A:1013617802515.
- Rina Dechter, Itay Meiri, and Judea Pearl. Temporal constraint networks. Artificial intelligence, 49(1-3):61-95, 1991. URL: https://doi.org/10.1016/0004-3702(91)90006-6.
-
Marco Gario and Andrea Micheli. pysmt: a solver-agnostic library for fast prototyping of smt-based algorithms. In SMT Workshop, 2015.
- Luke Hunsberger. Algorithms for a temporal decoupling problem in multi-agent planning. In Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada, pages 468-475, 2002. URL: http://www.aaai.org/Library/AAAI/2002/aaai02-071.php.
- Luke Hunsberger. Distributing the control of a temporal network among multiple agents. In The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pages 899-906, 2003. URL: https://doi.org/10.1145/860575.860720.
- Luke Hunsberger and Roberto Posenato. Speeding up the rulasciimacron dynamic-controllability-checking algorithm for simple temporal networks with uncertainty. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 9776-9785. AAAI Press, 2022. URL: https://doi.org/10.1609/AAAI.V36I9.21213.
-
Josef Lubas, Marco Franceschetti, and Johann Eder. Resolving conflicts in process models with temporal constraints. In Proceedings of the ER Forum and PhD Symposium, 2022.
- Paul H Morris and Nicola Muscettola. Temporal dynamic controllability revisited. In Aaai, pages 1193-1198, 2005. URL: http://www.aaai.org/Library/AAAI/2005/aaai05-189.php.
- Roberto Posenato and Carlo Combi. Adding flexibility to uncertainty: Flexible simple temporal networks with uncertainty (ftnu). Information Sciences, 584:784-807, 2022. URL: https://doi.org/10.1016/J.INS.2021.10.008.
- Roberto Sebastiani and Silvia Tomasi. Optimization modulo theories with linear rational costs. ACM Trans. Comput. Log., 16(2):12:1-12:43, 2015. URL: https://doi.org/10.1145/2699915.
-
Ajdin Sumic, Alessandro Cimatti, Andrea Micheli, and Thierry Vidal. SMT-based repair of disjunctive temporal networks with uncertainty: Strong and weak controllability. In Proceedings of the The 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024), 2024.
- Alessandro Valentini, Andrea Micheli, and Alessandro Cimatti. Temporal planning with intermediate conditions and effects. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020,, pages 9975-9982, 2020. URL: https://doi.org/10.1609/AAAI.V34I06.6553.
- Gérard Verfaillie, Cédric Pralet, and Michel Lemaître. How to model planning and scheduling problems using constraint networks on timelines. Knowl. Eng. Rev., 25(3):319-336, 2010. URL: https://doi.org/10.1017/S0269888910000172.
- Thierry Vidal and Hélène Fargier. Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental & Theoretical Artificial Intelligence, 11(1):23-45, 1999. URL: https://doi.org/10.1080/095281399146607.
- Yuening Zhang and Brian C. Williams. Privacy-preserving algorithm for decoupling of multi-agent plans with uncertainty. In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, China (virtual), August 2-13, 2021, pages 426-434. AAAI Press, 2021. URL: https://ojs.aaai.org/index.php/ICAPS/article/view/15988.