{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:33:22Z","timestamp":1730255602888,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","license":[{"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.9561502","type":"proceedings-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T20:28:35Z","timestamp":1634675315000},"page":"7533-7539","source":"Crossref","is-referenced-by-count":1,"title":["LTO: Lazy Trajectory Optimization with Graph-Search Planning for High DOF Robots in Cluttered Environments"],"prefix":"10.1109","author":[{"given":"Yuki","family":"Shirai","sequence":"first","affiliation":[{"name":"University of California,Department of Mechanical and Aerospace Engineering,Los Angeles,CA,USA,90095"}]},{"given":"Xuan","family":"Lin","sequence":"additional","affiliation":[{"name":"University of California,Department of Mechanical and Aerospace Engineering,Los Angeles,CA,USA,90095"}]},{"given":"Ankur","family":"Mehta","sequence":"additional","affiliation":[{"name":"University of California,Department of Electrical and Computer Engineering,Los Angeles,CA,USA,90095"}]},{"given":"Dennis","family":"Hong","sequence":"additional","affiliation":[{"name":"University of California,Department of Mechanical and Aerospace Engineering,Los Angeles,CA,USA,90095"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2016.7803371"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3007688"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494268455"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225368"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2020.2991951"},{"key":"ref36","article-title":"Optimization-Based Collision Avoidance","author":"zhang","year":"2019","journal-title":"IEEE Trans Cont Sys Tech"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2655145"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794352"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9340810"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3056064"},{"key":"ref12","article-title":"Mixed-integer convex optimization for planning aggressive motions of legged robots over rough terrain","author":"valenzuela","year":"2016","journal-title":"PhD thesis"},{"key":"ref13","article-title":"Gait analysis of a free-climbing robot on sloped terrain for lunar and planetary exploration","author":"shirai","year":"2018","journal-title":"Proc Int Symp Artif Intell Robot Autom"},{"key":"ref14","first-page":"1918","article-title":"Optimization based motion planning for multi-limbed vertical climbing robots","author":"lin","year":"2018","journal-title":"Proc 2019 IEEE\/RSJ Conf Intell Robots Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SII.2019.8700455"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/16M1062569"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594448"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2555853"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041373"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2972820"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2010.2045501"},{"key":"ref27","first-page":"476","article-title":"Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges","author":"mandalika","year":"2018","journal-title":"Proc 2018 Int Conf Autom Plan Sched"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2798285"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341438"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21993"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3067298"},{"key":"ref7","first-page":"2531","article-title":"Simultaneous contact, gait, and motion planning for robust multilegged locomotion via mixed-integer convex optimization","volume":"3","author":"aceituno-cabezas","year":"2018","journal-title":"IEEE Robot Autom Lett"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3001503"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759199"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105226"},{"key":"ref46","first-page":"674","article-title":"Bounded suboptimal search: a direct approach using inadmissible estimates","volume":"1","author":"thayer","year":"2011","journal-title":"Proc 2011 Int Joint Conf Artif Intell"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.047"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0025-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2707322"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594029"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2017.8246930"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910388315"},{"key":"ref24","first-page":"459","article-title":"A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors","author":"dellin","year":"2016","journal-title":"Proc 2016 Int Conf Autom Plan Sched"},{"key":"ref41","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"Tech Rep"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.033"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2001.7076321"},{"key":"ref26","first-page":"4266","article-title":"Posterior sampling for anytime motion planning on graphs with expensive-to-evaluate edges","author":"hou","year":"2020","journal-title":"Proc 2020 Int Conf Robot Automat"},{"journal-title":"Gurobi Optimizer Reference Manual","year":"2020","key":"ref43"},{"key":"ref25","first-page":"745","article-title":"Generalized lazy search for robot motion planning: interleaving search and edge evaluation via event-based toggles","author":"mandalika","year":"2019","journal-title":"Proc 2019 Int Conf Autom Plan Sched"}],"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\/09561502.pdf?arnumber=9561502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T19:22:17Z","timestamp":1659468137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9561502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9561502","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}