{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:39:57Z","timestamp":1778495997688,"version":"3.51.4"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Automat. Mag."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/mra.2018.2815081","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T18:53:52Z","timestamp":1526583232000},"page":"61-70","source":"Crossref","is-referenced-by-count":32,"title":["The Task-Motion Kit: An Open Source, General-Purpose Task and Motion-Planning Framework"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-2241","authenticated-orcid":false,"given":"Neil T.","family":"Dantam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0699-8038","authenticated-orcid":false,"given":"Lydia E.","family":"Kavraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915619022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913484072"},{"key":"ref12","first-page":"6360","article-title":"Combining symbolic and geometric planning to synthesize human-aware plans: Toward more efficient combined search","author":"gharbi","year":"0","journal-title":"Proc IEEE Int Conf Intelligent Robots and Systems"},{"key":"ref13","first-page":"639","article-title":"Combined task and motion planning through an extensible planner-independent interface layer","author":"srivastava","year":"0","journal-title":"Proc IEEE Int Conf Robotics and Automation"},{"key":"ref14","first-page":"3684","article-title":"A constraint-based method for solving sequential manipulation planning problems","author":"lozano-p\u00e9rez","year":"0","journal-title":"Proc IEEE Int Conf Intelligent Robots and Systems"},{"key":"ref15","first-page":"655","article-title":"SMT-based synthesis of integrated task and motion plans from plan outlines","author":"nedunuri","year":"0","journal-title":"Proc IEEE Int Conf Robotics and Automation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_11"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908097884"},{"key":"ref18","first-page":"3859","article-title":"FCL: A general purpose library for collision and proximity queries","author":"pan","year":"0","journal-title":"Proc IEEE Int Conf Robotics and Automation"},{"key":"ref19","author":"ghallab","year":"1998","journal-title":"Pddl the planning domain definition language"},{"key":"ref4","first-page":"536","article-title":"Task and motion policy synthesis as liveness games","author":"wang","year":"0","journal-title":"AAAI Int Conf Automated Planning and Scheduling (ICAPS)"},{"key":"ref3","first-page":"346","article-title":"Towards manipulation planning with temporal logic specifications","author":"he","year":"0","journal-title":"Proc IEEE Int Conf Robotics and Automation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.855"},{"key":"ref5","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_7"},{"key":"ref7","first-page":"318","article-title":"Unifying SAT-based and graph-based planning","volume":"99","author":"kautz","year":"0","journal-title":"Proc Int Joint Conf Artificial Intelligence"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1177\/0278364918761570","article-title":"An incremental constraint-based framework for task and motion planning","author":"dantam","year":"2018","journal-title":"Int J Robotics Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.002"},{"key":"ref9","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":"ref20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-319-16595-0_14","article-title":"Kinodynamic RRTs with fixed time step and best-input extension are not probabilistically complete","author":"kunz","year":"2015","journal-title":"Algorithmic Foundations of Robotics XI"},{"key":"ref22","year":"2018"},{"key":"ref21","year":"0","journal-title":"TMKit A task-motion planning framework"},{"key":"ref24","year":"2017"},{"key":"ref23","year":"0"}],"container-title":["IEEE Robotics & Automation Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/100\/8464729\/08360542.pdf?arnumber=8360542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:48:44Z","timestamp":1643190524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8360542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/mra.2018.2815081","relation":{},"ISSN":["1070-9932","1558-223X"],"issn-type":[{"value":"1070-9932","type":"print"},{"value":"1558-223X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}