{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:21:17Z","timestamp":1760710877994,"version":"3.44.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I031650\/1"],"award-info":[{"award-number":["EP\/I031650\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tai.2022.3146797","type":"journal-article","created":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T17:36:22Z","timestamp":1643304982000},"page":"506-517","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Temporal Piecewise-Linear Numeric Planning With Lazy Consistency Checking"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8274-6177","authenticated-orcid":false,"given":"Josef","family":"Bajada","sequence":"first","affiliation":[{"name":"Department of Artificial Intelligence, University of Malta, Msida, Malta"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1213-9283","authenticated-orcid":false,"given":"Maria","family":"Fox","sequence":"additional","affiliation":[{"name":"British Antarctic Survey, Cambridge, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5720-9265","authenticated-orcid":false,"given":"Derek","family":"Long","sequence":"additional","affiliation":[{"name":"Schlumberger Cambridge Research, Cambridge, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"655","article-title":"Interval-based relaxation for general numeric planning","author":"scala","year":"0","journal-title":"Proc 22nd Eur Conf Artif Intell"},{"key":"ref38","first-page":"3213","article-title":"Heuristic planning for PDDL+ domains","author":"piotrowski","year":"0","journal-title":"Proc 25th Int Joint Conf Artif Intell"},{"key":"ref33","first-page":"1565","article-title":"Mixed discrete-continuous heuristic generative planning based on flow tubes","author":"fern","year":"0","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref32","first-page":"65","article-title":"POPF2: A forward-chaining partial order planner","author":"coles","year":"0","journal-title":"Proc Int Plan Competition"},{"key":"ref31","first-page":"42","article-title":"Forward-chaining partial-order planning","author":"coles","year":"0","journal-title":"Proc 20th Int Conf Automat Plan Scheduling"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3608"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0306-z"},{"key":"ref36","first-page":"106","article-title":"UPMurphi: A tool for universal planning on PDDL+ problems","author":"penna","year":"0","journal-title":"Proc 19th Int Conf Automat Plan Scheduling"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1613\/jair.855"},{"key":"ref34","first-page":"206","article-title":"Generative planning for hybrid systems based on flow tubes","author":"li","year":"0","journal-title":"Proc 18th Int Conf Automat Plan Scheduling"},{"key":"ref28","first-page":"52","article-title":"Exploiting a graphplan framework in temporal planning","author":"long","year":"0","journal-title":"Proc 13th Int Conf Automat Plan Scheduling"},{"key":"ref27","first-page":"828","article-title":"On redundancy in simple temporal networks","author":"lee","year":"0","journal-title":"Proc 22nd Eur Conf Artif Intell"},{"key":"ref29","first-page":"52","article-title":"A hybrid relaxed planning graph-LP heuristic for numeric planning domains","author":"coles","year":"0","journal-title":"Proc 18th Int Conf Automat Plan Scheduling"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"ref1","first-page":"1852","article-title":"When is temporal planning really temporal?","author":"cushing","year":"0","journal-title":"Proc 20th Int Joint Conf Artif Intell"},{"key":"ref20","first-page":"47","article-title":"A temporal relaxed planning graph heuristic for planning with envelopes","author":"coles","year":"0","journal-title":"Proc 27th Int Conf Automat Plan Scheduling"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90006-6"},{"key":"ref21","first-page":"1712","article-title":"Temporal planning with constants in context","author":"bajada","year":"0","journal-title":"Proc 22nd Eur Conf Artif Intell"},{"key":"ref24","first-page":"444","article-title":"Reformulating temporal plans for efficient execution","author":"muscettola","year":"0","journal-title":"Proc Princ Knowl Representation Reasoning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.08.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3509"},{"key":"ref25","first-page":"129","article-title":"Incrementally solving STNs by enforcing partial path consistency","author":"planken","year":"0","journal-title":"Proc 20th Int Conf Automat Plan Scheduling"},{"article-title":"Temporal planning for rich numeric contexts","year":"2016","author":"bajada","key":"ref50"},{"key":"ref10","first-page":"74","article-title":"PDDL+ planning with events and linear processes","author":"coles","year":"0","journal-title":"Proc 24th Int Conf Automat Plan Scheduling"},{"key":"ref11","first-page":"97","article-title":"Have I been here before? State memoization in temporal planning","author":"coles","year":"0","journal-title":"Proc 26th Int Conf Automat Plan Scheduling"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9646"},{"key":"ref12","first-page":"892","article-title":"Planning with problems requiring temporal coordination","author":"coles","year":"0","journal-title":"Proc 23rd AAAI Conf Artif Intell"},{"key":"ref13","first-page":"226","article-title":"Temporal planning with problems requiring concurrency through action graphs and local search","author":"gerevini","year":"0","journal-title":"Proc 20th Int Conf Automat Plan Scheduling"},{"key":"ref14","first-page":"1523","article-title":"Temporal planning with semantic attachment of non-linear monotonic continuous behaviours","author":"bajada","year":"0","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref15","first-page":"39","article-title":"Temporal planning while the clock ticks","author":"cashmore","year":"0","journal-title":"Proc 28th Int Conf Automat Plan Scheduling"},{"key":"ref16","first-page":"9859","article-title":"Decidability and complexity of action-based temporal planning over dense time","author":"gigante","year":"0","journal-title":"Proc 34th AAAI Conf Artif Intell"},{"key":"ref17","first-page":"328","article-title":"An investigation into the expressive power of PDDL2.1","author":"fox","year":"0","journal-title":"Proc 16th Eur Conf Artif Intell"},{"article-title":"PDDL2.2: The language for the classical part of the 4th international planning competition","year":"2004","author":"edelkamp","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.04.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1144"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25116-0_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.01.002"},{"key":"ref8","first-page":"106","article-title":"Evaluating the cost of employing LPs and STPs in planning: Lessons learned from large real-life domains","author":"denenberg","year":"0","journal-title":"Proc 12th Int Scheduling Plan Appl Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2044"},{"key":"ref49","first-page":"8","article-title":"Insights from the 2018 IPC benchmarks","author":"cenamor","year":"0","journal-title":"Proc Workshop IPC"},{"key":"ref9","first-page":"2","article-title":"Temporal planning with preferences and time-dependent continuous costs","author":"benton","year":"0","journal-title":"Proc 22nd Int Conf Automat Plan Scheduling"},{"article-title":"How does presolve work?","year":"2020","author":"achterberg","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/103"},{"journal-title":"IPC","article-title":"International planning competition 2018 temporal tracks","year":"2018","key":"ref48"},{"journal-title":"lpsolve","article-title":"Presolve","year":"0","key":"ref47"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4697"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_14"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9644"},{"key":"ref43","first-page":"79","article-title":"A compilation of the full PDDL+ language into SMT","author":"cashmore","year":"0","journal-title":"Proc 26th Int Conf Automat Plan Scheduling"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9078688\/9834985\/09695289.pdf?arnumber=9695289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:10:06Z","timestamp":1755911406000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9695289\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":50,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tai.2022.3146797","relation":{},"ISSN":["2691-4581"],"issn-type":[{"type":"electronic","value":"2691-4581"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}