{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:02:15Z","timestamp":1781103735506,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>In this paper, the authors consider the planning problem for a system represented as a set of interacting agents evolving along time according to explicit timing constraints. Given a goal, the planning problem is to find the sequence of actions such that the system reaches the goal state in a limited time and in an optimal manner, assuming actions have a cost. In their approach, the planning problem is based on model-checking and controller synthesis techniques while the goal is defined using temporal logic. Each agent of the system is represented using the formalism of Priced Timed Game Automata (PTGA). PTGA is an extension of Timed Automata that allows the representation of cost on actions and the definition of uncontrollable actions. The authors define a planning algorithm that computes the best strategy to achieve a goal. To experiment their approach, they extend the classical Transport Domain with timing constraints, cost on actions and uncontrollable actions. The planning algorithm is finally presented on a marine ecosystem management problem.<\/jats:p>","DOI":"10.4018\/ijmstr.2017010102","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T13:50:08Z","timestamp":1496238608000},"page":"30-48","source":"Crossref","is-referenced-by-count":0,"title":["Extended Automata for Temporal Planning of Interacting Agents"],"prefix":"10.4018","volume":"5","author":[{"given":"Christine","family":"Largou\u00ebt","sequence":"first","affiliation":[{"name":"Agrocampus Ouest, Rennes, France & Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires (IRISA), Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omar","family":"Krichen","sequence":"additional","affiliation":[{"name":"Research Institute of Computer Science and Random Systems (IRISA), Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yulong","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Rennes 1, Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJMSTR.2017010102-0","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1024"},{"key":"IJMSTR.2017010102-1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2001.919196"},{"key":"IJMSTR.2017010102-2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"IJMSTR.2017010102-3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45351-2_8"},{"key":"IJMSTR.2017010102-4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60472-3_1"},{"key":"IJMSTR.2017010102-5","doi-asserted-by":"crossref","unstructured":"Asarin, E., Maler, O., Pnueli, A., & Sifakis, J. (1998). Controller synthesis for timed automata. Proceedings of theIFAC Symposium on System Structure and Control (pp. 469\u2013474). Elsevier Science.","DOI":"10.1016\/S1474-6670(17)42032-5"},{"key":"IJMSTR.2017010102-6","author":"G.Aucher","year":"2013","journal-title":"Undecidability in epistemic planning"},{"key":"IJMSTR.2017010102-7","doi-asserted-by":"crossref","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K., & Lime, D. (2007). Uppaal-tiga: Time for playing games! In CAV-2007, pages 121\u2013125.","DOI":"10.1007\/978-3-540-73368-3_14"},{"key":"IJMSTR.2017010102-8","doi-asserted-by":"crossref","unstructured":"Behrmann, G., Larsen, K., & Rasmussen, J. (2004). Priced timed automata: Algorithms and applications. Proceedings of FMCO \u201804 (pp. 162\u2013182). Springer-Verlag.","DOI":"10.1007\/11561163_8"},{"key":"IJMSTR.2017010102-9","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-013-0294-x"},{"key":"IJMSTR.2017010102-10","doi-asserted-by":"publisher","DOI":"10.7146\/brics.v11i4.21829"},{"key":"IJMSTR.2017010102-11","doi-asserted-by":"crossref","unstructured":"Cesta, A., Finzi, A., Fratini, S., Orlandini, A., & Tronci, E. (2009). Flexible Timeline-Based Plan Verification. Proceedings ofGerman Conference on Artificial IntelligenceKI \u201809 (pp. 49\u201356).","DOI":"10.1007\/978-3-642-04617-9_7"},{"key":"IJMSTR.2017010102-12","first-page":"471","author":"A.Cesta","year":"2010","journal-title":"Analyzing flexible timeline-based plans"},{"key":"IJMSTR.2017010102-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00374-0"},{"key":"IJMSTR.2017010102-14","first-page":"195","article-title":"Model-Checking. MIT Press. Edelkamp, S. (2003). Taming numbers and durations in the model checking integrated planning system.","volume":"20","author":"E.Clarke","year":"2002","journal-title":"Journal of Artificial Intelligence Research"},{"key":"IJMSTR.2017010102-15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","article-title":"PDDL2.1: An extension to PDDL for expressing temporal planning domains.","volume":"20","author":"M.Fox","year":"2003","journal-title":"Journal of Artificial Intelligence Research"},{"key":"IJMSTR.2017010102-16","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_33"},{"key":"IJMSTR.2017010102-17","doi-asserted-by":"crossref","unstructured":"Giunchiglia, F., & Traverso, P. (1999). Planning as model checking. Proceedings of ECP\u201999 (pp. 1\u201320).","DOI":"10.1007\/10720246_1"},{"key":"IJMSTR.2017010102-18","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1045"},{"key":"IJMSTR.2017010102-19","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.03512"},{"key":"IJMSTR.2017010102-20","first-page":"114","author":"L.Khatib","year":"2000","journal-title":"Verification of plan models using UPPAAL"},{"key":"IJMSTR.2017010102-21","doi-asserted-by":"crossref","unstructured":"Kvarnstro \u0308m, J. (2011, June 11-16). Planning for loosely coupled agents using partial order forward-chaining. Proceedings of the 21st International Conference on Automated Planning and Scheduling ICAPS \u201811, Freiburg, Germany.","DOI":"10.1609\/icaps.v21i1.13462"},{"key":"IJMSTR.2017010102-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.envsoft.2011.08.005"},{"key":"IJMSTR.2017010102-23","doi-asserted-by":"crossref","unstructured":"Largou\u00ebt, C., Krichen, O., & Zhao, Y. (2016). Temporal Planning with Extended Timed Automata. Proceedings of theIEEE International Conference on Tools with Artificial Intelligence, San Jose, CA, USA (pp. 522-529).","DOI":"10.1109\/ICTAI.2016.0086"},{"key":"IJMSTR.2017010102-24","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050010"},{"key":"IJMSTR.2017010102-25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_55"},{"key":"IJMSTR.2017010102-26","author":"R.Milner","year":"1989","journal-title":"Communication and Concurrency"},{"key":"IJMSTR.2017010102-27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24455-1_22"},{"key":"IJMSTR.2017010102-28","doi-asserted-by":"crossref","unstructured":"Ramadge, P., & Wonham, W. (1994). The control of discrete event systems. Proceedings of the IEEE, 77(1), 81\u201398.","DOI":"10.1109\/5.21072"},{"key":"IJMSTR.2017010102-29","first-page":"1111","author":"J.Tozicka","year":"2014","journal-title":"Generating multi-agent plans by distributed intersection of finite state machines"}],"container-title":["International Journal of Monitoring and Surveillance Technologies Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=182505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T16:57:46Z","timestamp":1692809866000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJMSTR.2017010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.4018\/ijmstr.2017010102","relation":{},"ISSN":["2166-7241","2166-725X"],"issn-type":[{"value":"2166-7241","type":"print"},{"value":"2166-725X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}