{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T00:21:04Z","timestamp":1762042864461,"version":"build-2065373602"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"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":[[2021,5,30]]},"DOI":"10.1109\/icra48506.2021.9560978","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:28:35Z","timestamp":1634689715000},"page":"4606-4612","source":"Crossref","is-referenced-by-count":9,"title":["Learning Efficient Constraint Graph Sampling for Robotic Sequential Manipulation"],"prefix":"10.1109","author":[{"given":"Joaquim","family":"Ortiz-Haro","sequence":"first","affiliation":[]},{"given":"Valentin N.","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Ozgur S.","family":"Oguz","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105226"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910396389"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2020.XVI.003"},{"article-title":"Integrated task and motion planning","year":"2020","author":"garrett","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914545811"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.002"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197545"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909352098"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918802962"},{"key":"ref34","article-title":"Learning geometric reasoning and control for long-horizon tasks from visual input","author":"driess","year":"2021","journal-title":"Proc of the IEEE International Conference on Robotics and Automation (ICRA)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2819658"},{"key":"ref40","article-title":"Robust task and motion planning for long-horizon architectural construction planning","author":"hartmann","year":"2020","journal-title":"Proc of the Int Conf on Intelligent Robots and Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593554"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001640"},{"journal-title":"Handbook of Constraint Programming","year":"2006","author":"rossi","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11889205_56"},{"key":"ref15","first-page":"255","article-title":"Uniform solution sampling using a constraint solver as an oracle","author":"ermon","year":"2012","journal-title":"Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_22"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90015-C"},{"key":"ref18","article-title":"Metareasoning in real-time heuristic search","author":"o\u2019ceallaigh","year":"2015","journal-title":"Eighth Annual Symposium on Combinatorial Search"},{"key":"ref19","first-page":"2870","article-title":"Algorithm selection by rational metareasoning as a model of human strategy selection","author":"lieder","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref28","first-page":"282","article-title":"Bandit based monte-carlo planning","author":"kocsis","year":"2006","journal-title":"European Conference on Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.1.101"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.044"},{"journal-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","year":"2011","author":"boyd","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094595"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386316"},{"key":"ref8","article-title":"Hierarchical task and motion planning using logic-geometric programming (hlgp)","author":"driess","year":"2019","journal-title":"RSS Workshop on Robust Task and Motion Planning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00937167"},{"key":"ref2","first-page":"15","article-title":"Generating random solutions for constraint satisfaction problems","author":"dechter","year":"2002","journal-title":"AAAI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989464"},{"key":"ref1","article-title":"Spike: Intelligent scheduling of hubble space telescope observations","author":"johnston","year":"1994","journal-title":"Intelligent Scheduling"},{"key":"ref20","article-title":"Metareasoning and bounded rationality","author":"zilberstein","year":"2008","journal-title":"AAAI Workshop - Technical Report"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1988.tb00284.x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.11.001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"article-title":"Learning model-based planning from scratch","year":"2017","author":"pascanu","key":"ref24"},{"key":"ref41","first-page":"666","article-title":"Factor graphs and algorithms","volume":"35","author":"frey","year":"1997","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"journal-title":"Solving time dependent planning problems","year":"1989","author":"boddy","key":"ref23"},{"article-title":"KOMO: Newton methods for k-order Markov constrained motion problems","year":"2014","author":"toussaint","key":"ref44"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1609\/icaps.v29i1.3543","article-title":"Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles","volume":"29","author":"mandalika","year":"2019","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v28i1.13878","article-title":"Temporal planning while the clock ticks","author":"cashmore","year":"2018","journal-title":"ICAPS"}],"event":{"name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2021,5,30]]},"location":"Xi'an, China","end":{"date-parts":[[2021,6,5]]}},"container-title":["2021 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9560720\/9560666\/09560978.pdf?arnumber=9560978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T22:50:19Z","timestamp":1673563819000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9560978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9560978","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}