{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:30:43Z","timestamp":1784136643646,"version":"3.55.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NASA Space Technology Research Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lra.2019.2894861","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:28:10Z","timestamp":1548289690000},"page":"1255-1262","source":"Crossref","is-referenced-by-count":58,"title":["Learning Feasibility for Task and Motion Planning in Tabletop Environments"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-2122","authenticated-orcid":false,"given":"Andrew M.","family":"Wells","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-2241","authenticated-orcid":false,"given":"Neil T.","family":"Dantam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5042-2856","authenticated-orcid":false,"given":"Anshumali","family":"Shrivastava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-8038","authenticated-orcid":false,"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487165"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917739114"},{"key":"ref31","first-page":"261","author":"schaal","year":"2006","journal-title":"Dynamic movement primitives - a framework for motor control in humans and humanoid robotics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353738"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139284"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2012.VIII.043"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460730"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989327"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528132"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913488805"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref13","first-page":"293","article-title":"Rapidly-exploring random trees: Progress and prospects","author":"lavalle","year":"2001","journal-title":"Algorithmic and Computational Robotics New Directions"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The open motion planning library","volume":"19","author":"?ucan","year":"2012","journal-title":"Robot Autom Mag"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507983"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385972"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915619022"},{"key":"ref19","article-title":"Combined task and motion planning as classical AI planning","volume":"abs 1706 6927","author":"ferrer-mestres","year":"2017","journal-title":"CoRR"},{"key":"ref28","first-page":"162","article-title":"Learning heuristic functions from relaxed plans","author":"yoon","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","volume":"2","author":"fikes","year":"1972","journal-title":"Artif Intell"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2018.2815081"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906922"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.855"},{"key":"ref29","first-page":"2041","article-title":"Discriminative learning of beam-search heuristics for planning","author":"xu","year":"0","journal-title":"Proc Int Joint Artif Intell Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1705"},{"key":"ref8","first-page":"318","article-title":"Unifying SAT-based and graph-based planning","volume":"99","author":"kautz","year":"0","journal-title":"Proc Int Joint Artif Intell Conf"},{"key":"ref7","first-page":"64","article-title":"YAHSP3 and YAHSP3-MT","author":"vidal","year":"0","journal-title":"Proceedings of the International Planning Competition"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980391"},{"key":"ref9","first-page":"66","article-title":"Madagascar: Scalable planning with sat","author":"rintanen","year":"0","journal-title":"Proceedings of the International Planning Competition"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918761570"},{"key":"ref20","article-title":"Asymptotically optimal planning under piecewise-analytic constraints","author":"vega-brown","year":"0","journal-title":"Proc Workshop Algorithmic Found Robot"},{"key":"ref22","first-page":"100","article-title":"aSyMov: A planner that deals with intricate symbolic and geometric problems","author":"gravot","year":"0","journal-title":"Proc Int Symp Robot Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908097884"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139022"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.942115"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570410"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2047820"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8581687\/08624442.pdf?arnumber=8624442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:55:40Z","timestamp":1657745740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8624442\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":38,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2894861","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}