{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:02:57Z","timestamp":1770336177792,"version":"3.49.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/lra.2018.2853642","type":"journal-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T18:33:20Z","timestamp":1530902000000},"page":"3473-3480","source":"Crossref","is-referenced-by-count":17,"title":["Integrating Temporal Reasoning and Sampling-Based Motion Planning for Multigoal Problems With Dynamics and Time Windows"],"prefix":"10.1109","volume":"3","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7549-4365","authenticated-orcid":false,"given":"Morteza","family":"Lahijanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1934-3447","authenticated-orcid":false,"given":"Daniele","family":"Magazzeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5605-4575","authenticated-orcid":false,"given":"Erion","family":"Plaku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"655","article-title":"Interval-based\n relaxation for general numeric planning","author":"scala","year":"0","journal-title":"Proc Eur Conf Artif Intell"},{"key":"ref11","first-page":"79","article-title":"A compilation of the full PDDL+\n language into SMT","author":"cashmore","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2544339"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6943085"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696435"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2016.1146348"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30206-3_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039363"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963399"},{"key":"ref19","first-page":"73","article-title":"On the\n traveling salesman problem with simple temporal constraints","author":"kumar","year":"0","journal-title":"Proc Symp Abstraction Reformulation Approximation"},{"key":"ref4","first-page":"421","article-title":"Solving realistic unit commitment problems using temporal\n planning: Challenges and solutions","author":"piacentini","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3643"},{"key":"ref6","author":"keller","year":"1992","journal-title":"Numerical Methods for Two-Point Boundary-Value Problems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907823"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cav.1688"},{"key":"ref7","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementation"},{"key":"ref2","first-page":"2","article-title":"Temporal\n planning with preferences and time-dependent continuous costs","volume":"77","author":"benton","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25116-0_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"ref23","first-page":"649","article-title":"Nested rollout policy adaptation for Monte Carlo tree search","author":"rosin","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8386768\/08405360.pdf?arnumber=8405360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:42Z","timestamp":1642004562000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8405360\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":24,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2018.2853642","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}