{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:05:18Z","timestamp":1772078718899,"version":"3.50.1"},"reference-count":39,"publisher":"Cambridge University Press (CUP)","issue":"12","license":[{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Multiple mobile manipulators (\n                    <jats:italic>MMs<\/jats:italic>\n                    ) show superiority in the tasks requiring mobility and dexterity compared with a single robot, especially when manipulating\/transporting bulky objects. However, closed-chain of the system, redundancy of each\n                    <jats:italic>MM<\/jats:italic>\n                    , and obstacles in the environment bring challenges to the motion planning problem. In this paper, we propose a novel semi-coupled hierarchical framework (\n                    <jats:italic>SCHF<\/jats:italic>\n                    ), which decomposes the problem into two semi-coupled sub-problems. To be specific, the centralized layer plans the object\u2019s motion first, and then the decentralized layer independently explores the redundancy of each robot in real-time. A notable feature is that the lower bound of the redundancy constraint metric is ensured, besides the closed-chain and obstacle-avoidance constraints in the centralized layer, which ensures the object\u2019s motion can be executed by each robot in the decentralized layer. Simulated results show that the success rate and time cost of\n                    <jats:italic>SCHF<\/jats:italic>\n                    outperform the fully centralized planner and fully decoupled hierarchical planner significantly. In addition, cluttered real-world experiments also show the feasibility of the\n                    <jats:italic>SCHF<\/jats:italic>\n                    in the transportation tasks. A video clip in various scenarios can be found at\n                    <jats:uri xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/youtu.be\/Y8ZrnspIuBg\">https:\/\/youtu.be\/Y8ZrnspIuBg<\/jats:uri>\n                    .\n                  <\/jats:p>","DOI":"10.1017\/s0263574725102865","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T08:23:42Z","timestamp":1763972622000},"page":"4302-4324","source":"Crossref","is-referenced-by-count":3,"title":["A novel semi-coupled hierarchical motion planning framework for cooperative transportation of multiple mobile manipulators"],"prefix":"10.1017","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5712-6136","authenticated-orcid":false,"given":"Heng","family":"Zhang","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]},{"given":"Haoyi","family":"Song","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]},{"given":"Wenhang","family":"Liu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]},{"given":"Xinjun","family":"Sheng","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]},{"given":"Zhenhua","family":"Xiong","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]},{"given":"Xiangyang","family":"Zhu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0220qvk04","id-type":"ROR","asserted-by":"publisher"}],"name":"Shanghai Jiao Tong University"}]}],"member":"56","published-online":{"date-parts":[[2025,11,24]]},"reference":[{"key":"S0263574725102865_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574723001790"},{"key":"S0263574725102865_ref38","doi-asserted-by":"publisher","DOI":"10.1177\/02783649231209337"},{"key":"S0263574725102865_ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630908"},{"key":"S0263574725102865_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_39"},{"key":"S0263574725102865_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00312-7_28"},{"key":"S0263574725102865_ref31","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"S0263574725102865_ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IISR.2018.8535773"},{"key":"S0263574725102865_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRoM.2014.6990952"},{"key":"S0263574725102865_ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2022.3155601"},{"key":"S0263574725102865_ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.3020050"},{"key":"S0263574725102865_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/70.976030"},{"key":"S0263574725102865_ref29","first-page":"2719","article-title":"Path planning in expansive configuration spaces","volume":"3","author":"Hsu","year":"1997","journal-title":"IEEE Int. Conf. Robot. Autom. (ICRA)"},{"key":"S0263574725102865_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29363-9_20"},{"key":"S0263574725102865_ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910396389"},{"key":"S0263574725102865_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"S0263574725102865_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2014.10.022"},{"key":"S0263574725102865_ref6","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105226"},{"key":"S0263574725102865_ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487258"},{"key":"S0263574725102865_ref4","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.aau8479"},{"key":"S0263574725102865_ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917719333"},{"key":"S0263574725102865_ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"S0263574725102865_ref30","first-page":"995","article-title":"RRT-connect: An efficient approach to single-query path planning","volume":"2","author":"Kuffner","year":"2000","journal-title":"IEEE Int. Conf. Robot. Autom. (ICRA)"},{"key":"S0263574725102865_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103554"},{"key":"S0263574725102865_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574724001899"},{"key":"S0263574725102865_ref39","unstructured":"[39] Li, X. , Wang, S. and Cai, Y. , \u201cTutorial: Complexity analysis of singular value decomposition and its variants\u201d (2019). ArXiv Preprint arXiv:\u00a01906.12085."},{"key":"S0263574725102865_ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2025.3552348"},{"key":"S0263574725102865_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574714001234"},{"key":"S0263574725102865_ref11","unstructured":"[11] Qi, Z. , Zhang, Z. , Yu, Y. , Wang, J. and Zhao, H. , \u201cVLN-R1: Vision-language navigation via reinforcement fine-tuning\u201d (2025). ArXiv Preprint arXiv:\u00a02506.17221."},{"key":"S0263574725102865_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2015.2416215"},{"key":"S0263574725102865_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989463"},{"key":"S0263574725102865_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2025.3544103"},{"key":"S0263574725102865_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/AIM.2019.8868347"},{"key":"S0263574725102865_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechmachtheory.2025.106020"},{"key":"S0263574725102865_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2023.104612"},{"key":"S0263574725102865_ref26","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"S0263574725102865_ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560902"},{"key":"S0263574725102865_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574725101884"},{"key":"S0263574725102865_ref33","unstructured":"[33] LaValle, S. , \u201cRapidly-exploring random trees: A new tool for path planning,\u201d (1998). Research Report 9811."},{"key":"S0263574725102865_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574724002200"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574725102865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T12:25:16Z","timestamp":1771590316000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574725102865\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,24]]},"references-count":39,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["S0263574725102865"],"URL":"https:\/\/doi.org\/10.1017\/s0263574725102865","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,24]]}}}