{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T10:51:37Z","timestamp":1766055097443,"version":"3.48.0"},"reference-count":31,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iros60139.2025.11246371","type":"proceedings-article","created":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:54:45Z","timestamp":1764269685000},"page":"11389-11396","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Sets Trees (MST*): Accelerated Asymptotically Optimal Motion Planning Optimization Informed by Multiple Domain Subsets"],"prefix":"10.1109","author":[{"given":"Liding","family":"Zhang","sequence":"first","affiliation":[{"name":"Technical University of Munich,Department of Informatics,Germany"}]},{"given":"Sicheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Department of Informatics,Germany"}]},{"given":"Kuanqi","family":"Cai","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Department of Informatics,Germany"}]},{"given":"Zhenshan","family":"Bing","sequence":"additional","affiliation":[{"name":"Nanjing University (Suzhou Campus),State Key Laboratory for Novel Software Technology and the School of Science and Technology,China"}]},{"given":"Alois","family":"Knoll","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Department of Informatics,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061920-093753"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.birob.2024.100207"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3181947"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-061623-094742"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3590084"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref8","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Research Report 9811","author":"LaValle","year":"1998"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3562369"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43089-4_40"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802280"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196580"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211069572"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197338"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802466"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA55743.2025.11127785"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3147408"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161028"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.birob.2025.100237"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2015.2448276"},{"article-title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners","volume-title":"Proceedings of the Workshop on Evaluating Motion Planning Performance (EMPP), IEEE\/RSJ IROS","author":"Gammell","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793898"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"}],"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\/11246371.pdf?arnumber=11246371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T10:48:27Z","timestamp":1766054907000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11246371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/iros60139.2025.11246371","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}