Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Controller Synthesis for Timeline-based Games (2307.12289v4)

Published 23 Jul 2023 in cs.AI

Abstract: In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-based planning systems excel at the integration of planning with execution by handling temporal uncertainty. In order to handle general nondeterminism as well, the concept of timeline-based games has been recently introduced. It has been proved that finding whether a winning strategy exists for such games is 2EXPTIME-complete. However, a concrete approach to synthesize controllers implementing such strategies is missing. This paper fills this gap, by providing an effective and computationally optimal approach to controller synthesis for timeline-based games.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Controller synthesis for timeline-based games. Electronic Proceedings in Theoretical Computer Science, 370:131–146, sep 2022. URL: https://doi.org/10.42042Feptcs.370.9, T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.4204/eptcs.370.9.
  2. Alternating-time temporal logic. J. ACM, 49(5):672–713, 2002. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1145/585265.585270.
  3. Solving sequential conditions by finite-state strategies. In The Collected Works of J. Richard Büchi, pages 525–541. Springer, 1990.
  4. Timeline-based planning over dense temporal domains. Theor. Comput. Sci., 813:305–326, 2020. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1016/j.tcs.2019.12.030.
  5. Developing domain-independent search control for Europa2. In Proceedings of the ICAPS 2007 Workshop on Heuristics for Domain-Independent Planning, 2007.
  6. Europa2: User and contributor guide. Technical report, NASA Ames Research Center, 2005.
  7. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165–204, 1994. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1016/0004-3702(94)90081-7.
  8. MEXAR2: AI solves mission planner problems. IEEE Intelligent Systems, 22(4):12–19, 2007. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1109/MIS.2007.75.
  9. Software companion: The MEXAR2 support to space mission planners. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, volume 141 of Frontiers in Artificial Intelligence and Applications, pages 622–626. IOS Press, 2006.
  10. Alonzo Church. Logic, arithmetic, and automata. In Proceedings of the international congress of mathematicians, volume 1962, pages 23–35, 1962.
  11. Ddl.1: A formal description of a constraint representation language for physical domains. In Malik Ghallab and Alfredo Milani, editors, New directions in AI planning. IOS Press, 1996.
  12. Planning and execution with flexible timelines: a formal account. Acta Informatica, 53(6-8):649–680, 2016. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1007/s00236-015-0252-z.
  13. Aspen - automating space mission operations using automated planning and scheduling. In Proceedings of the International Conference on Space Operations, 2000.
  14. Activity-based scheduling of science campaigns for the rosetta orbiter. In Qiang Yang and Michael Wooldridge, editors, Proceedings of the 24th International Joint Conference on Artificial Intelligence, pages 4416–4422. AAAI Press, 2015. URL: http://ijcai.org/Abstract/15/655.
  15. Bounded timed propositional temporal logic with past captures timeline-based planning with bounded constraints. In Carles Sierra, editor, Proceedings of the 26th International Joint Conference on Artificial Intelligence, pages 1008–1014, 2017. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.24963/ijcai.2017/140.
  16. A novel automata-theoretic approach to timeline-based planning. In Michael Thielscher, Francesca Toni, and Frank Wolter, editors, Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning, pages 541–550. AAAI Press, 2018. URL: https://aaai.org/ocs/index.php/KR/KR18/paper/view/18024.
  17. Complexity of qualitative timeline-based planning. In Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, volume 178 of LIPIcs, pages 16:1–16:13, 2020. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.4230/LIPIcs.TIME.2020.16.
  18. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Joseph Sifakis, editor, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 197–212. Springer, 1989. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1007/3-540-52148-8_17.
  19. Science operations pre-planning & optimization using ai constraint-resolution - the apsi case study 1. In Proceedings of the 8th International Conference on Space Operations, 2008. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.2514/6.2008-3268.
  20. Apsi-based deliberation in goal oriented autonomous controllers. In ASTRA 2011, volume 11. ESA, 2011.
  21. Constraint-based attribute and interval planning. Constraints, 8(4):339–364, 2003. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1023/A:1025842019552.
  22. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20:61–124, 2003.
  23. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3/4):189–208, 1971. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1016/0004-3702(71)90010-5.
  24. Nicola Gigante. Timeline-based Planning: Expressiveness and Complexity. PhD thesis, University of Udine, Italy, 2019. Available on arXiv at: https://arxiv.org/abs/1902.06123.
  25. Timelines are expressive enough to capture action-based temporal planning. In Curtis E. Dyreson, Michael R. Hansen, and Luke Hunsberger, editors, Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, pages 100–109. IEEE Computer Society, 2016. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1109/TIME.2016.18.
  26. Complexity of timeline-based planning. In Laura Barbulescu, Jeremy Frank, Mausam, and Stephen F. Smith, editors, Proceedings of the 27th International Conference on Automated Planning and Scheduling, pages 116–124. AAAI Press, 2017. URL: https://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15758.
  27. On timeline-based games and their complexity. Theor. Comput. Sci., 815:247–269, 2020. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1016/j.tcs.2020.02.011.
  28. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press, 1969.
  29. Nicola Muscettola. HSTS: Integrating Planning and Scheduling. In Monte Zweben and Mark S. Fox, editors, Intelligent Scheduling, chapter 6, pages 169–212. Morgan Kaufmann, 1994.
  30. Tga-based controllers for flexible plan execution. In Joscha Bach and Stefan Edelkamp, editors, Proceedings of the 34th Annual German Conference on Artificial Intelligence, volume 7006 of Lecture Notes in Computer Science, pages 233–245. Springer, 2011. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1007/978-3-642-24455-1_22.
  31. An abstract domain extending difference-bound matrices with disequality constraints. In International Workshop on Verification, Model Checking, and Abstract Interpretation, pages 268–282. Springer, 2007. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1007/978-3-540-69738-1_20.
  32. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’89, page 179–190, New York, NY, USA, 1989. Association for Computing Machinery. T¯¯𝑇{\overline{T}}over¯ start_ARG italic_T end_ARGdoi:10.1145/75277.75293.
  33. On the synthesis of an asynchronous reactive module. In International Colloquium on Automata, Languages, and Programming, pages 652–671. Springer, 1989.
  34. Roni Rosner. Modular synthesis of reactive systems. PhD thesis, Weizmann Institute of Science, 1992.
  35. The ANML language. In Proceedinsgs of the ICAPS 2008 Workshop on Knowledge Engineering for Planning and Scheduling, 2008.
  36. Wolfgang Thomas. Solution of Church’s problem: A tutorial. New Perspectives on Games and Interaction. Texts on Logic and Games, 5, 2008.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now