{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:19:23Z","timestamp":1765610363655,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,29]]},"DOI":"10.1109\/icra48891.2023.10161109","type":"proceedings-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:20:56Z","timestamp":1688491256000},"page":"3743-3749","source":"Crossref","is-referenced-by-count":2,"title":["Policy-Guided Lazy Search with Feedback for Task and Motion Planning"],"prefix":"10.1109","author":[{"given":"Mohamed","family":"Khodeir","sequence":"first","affiliation":[{"name":"Robot Vision and Learning Lab, University of Toronto Robotics Institute"}]},{"given":"Atharv","family":"Sonwane","sequence":"additional","affiliation":[{"name":"University of BITS Pilani,Dept. of Computer Science"}]},{"given":"Ruthrash","family":"Hari","sequence":"additional","affiliation":[{"name":"University of Toronto,Dept. of Mathematical and Computational Sciences"}]},{"given":"Florian","family":"Shkurti","sequence":"additional","affiliation":[{"name":"Robot Vision and Learning Lab, University of Toronto Robotics Institute"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196681"},{"journal-title":"Extended tree search for robot task and motion planning","year":"2021","author":"ren","key":"ref12"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908097884"},{"key":"ref31","article-title":"Accelerating integrated task and motion planning with neural feasibility checking","author":"xu","year":"2022","journal-title":"ArXiv Preprint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197291"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-091420-084139"},{"key":"ref10","article-title":"How attentive are graph attention networks?","author":"brody","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918761570"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6739"},{"key":"ref17","first-page":"1930","article-title":"Logic-geometric programming: An optimization-based approach to combined task and motion planning","author":"toussaint","year":"0","journal-title":"Proceedings of the 24th International Conference on Artificial Intelligence"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980391"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918761570"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.044"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9635941"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211004615"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636781"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341535"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906922"},{"key":"ref22","article-title":"Integrating task and prm motion planning: Dealing with many infeasible motion planning queries","author":"hauser","year":"0","journal-title":"ICAPS Workshop on Bridging the Gap between Task and Motion Planning"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915619022"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561548"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196597"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2020.XVI.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3242201"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17421"},{"key":"ref9","article-title":"Graph Attention Networks","author":"veli?kovi?","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref4","article-title":"Single-agent policy tree search with guarantees","volume":"31","author":"orseau","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00108-4"},{"journal-title":"Relational inductive biases deep learning and graph networks","year":"2018","author":"battaglia","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/855"}],"event":{"name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2023,5,29]]},"location":"London, United Kingdom","end":{"date-parts":[[2023,6,2]]}},"container-title":["2023 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10160211\/10160212\/10161109.pdf?arnumber=10161109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:31:32Z","timestamp":1690219892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10161109\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icra48891.2023.10161109","relation":{},"subject":[],"published":{"date-parts":[[2023,5,29]]}}}