{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:44:43Z","timestamp":1766061883634,"version":"3.48.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iros60139.2025.11246427","type":"proceedings-article","created":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:54:45Z","timestamp":1764269685000},"page":"13258-13265","source":"Crossref","is-referenced-by-count":0,"title":["Benchmarking Shortcutting Techniques for Multi-Robot-Arm Motion Planning"],"prefix":"10.1109","author":[{"given":"Philip","family":"Huang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213"}]},{"given":"Yorai","family":"Shaoul","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213"}]},{"given":"Jiaoyang","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Research Report 9811","author":"LaValle","year":"1998"},{"article-title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems","year":"2023","author":"Hartmann","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09438-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v34i1.31513"},{"article-title":"Cooperative task and motion planning for multi-arm assembly systems","year":"2022","author":"Chen","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.adf7843"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2009.5354415"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/70.143360"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3266889"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3068910"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6906965"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981715"},{"article-title":"Toward holistic planning and control optimization for dual-arm rearrangement","year":"2024","author":"Gao","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66723-8_15"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3198020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2025.xxi.098"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636119"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"article-title":"Newton methods for k-order markov constrained motion problems","year":"2014","author":"Toussaint","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2819195"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364907079280"},{"volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","year":"2005","author":"Choset","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/29"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v26i1.13796"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/027836499801700803"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISATP.1999.782972"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/70.678449"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(97)00033-X"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21256"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2011.144"},{"key":"ref34","first-page":"784","article-title":"Efficient search with an ensemble of heuristics","volume-title":"Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Phillips"},{"article-title":"Reducing the barrier to entry of complex robotic software: A MoveIt! case study","year":"2014","author":"Coleman","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"}],"event":{"name":"2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2025,10,19]]},"location":"Hangzhou, China","end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11245651\/11245652\/11246427.pdf?arnumber=11246427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:39:54Z","timestamp":1766061594000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11246427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/iros60139.2025.11246427","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}