{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:30:09Z","timestamp":1723015809588},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>We study the characterization and computation of general policies for families of problems that share a  structure characterized by a common reduction into a single abstract problem. Policies mu that solve the abstract problem P have been shown to solve all problems Q that reduce to P provided that mu terminates in Q. In this work, we shed light on  why this termination condition is needed  and how it can be removed. The key observation is that the abstract problem P captures the common  structure among the concrete problems Q that is local (Markovian) but misses common structure that is global. We show how such global structure can be captured by means of trajectory constraints that in many cases can be expressed  as LTL formulas, thus reducing  generalized planning to LTL synthesis.  Moreover, for a broad class of problems that involve integer variables that can be increased or decreased, trajectory constraints can be compiled away, reducing generalized planning to fully observable non-deterministic planning.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/121","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T09:14:07Z","timestamp":1501233247000},"page":"873-879","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints"],"prefix":"10.24963","author":[{"given":"Blai","family":"Bonet","sequence":"first","affiliation":[{"name":"Universidad Simon Bolivar"}]},{"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[{"name":"Sapienza Universit\u00e0 di Roma"},{"name":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale"}]},{"given":"Hector","family":"Geffner","sequence":"additional","affiliation":[{"name":"ICREA"},{"name":"Universitat Pompeu Fabra"}]},{"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[{"name":"University of Naples, Federico II"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:52:21Z","timestamp":1501242741000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/121"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/121","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}