Tengyue Wang, Zhefan Lin, Yunze Shi, Songjie Xiao, Liangjing Yang
{"title":"基于大规模数字双并行和安全优先优化搜索算法的机械臂c空间轨迹规划","authors":"Tengyue Wang, Zhefan Lin, Yunze Shi, Songjie Xiao, Liangjing Yang","doi":"10.1049/csy2.70026","DOIUrl":null,"url":null,"abstract":"<p>This paper proposes a trajectory planning approach based on the configuration space (C-space) generated from large-scale digital twinning. Leveraging GPU-based parallelism, the C-space of a multi-degree-of-freedom (multi-DoF) manipulator in a complex task space with obstacles can be mapped out through extensive simulation of motion and collision of multiple virtual robot arms known as digital twins. An optimal search algorithm is incorporated with artificial potential field generated in the C-space to allow the prioritising of safety in accordance with the varying risks associated with the obstacles by means of variable repulsive potential. To extend the high-degree path to smooth and continuous joint trajectories, a spline operation is applied. Finally, a 7-DOF physical manipulator is deployed for the execution of the planned trajectory in a task space filled with obstacles. Results demonstrated a 16.3% improvement in success rate achieved by utilising the safety-prioritisable search algorithm. With this unified formulation of the control and planning problem in the C-space, the kinematics complexity of a large DOF manipulator in obstacle-present task space could be truly relieved from the joint control loop. This simplification, in turn, opens up prospective work in dynamic reconstruction of the C-space.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70026","citationCount":"0","resultStr":"{\"title\":\"Robotic Arm C-Space Trajectory Planning Using Large-Scale Digital Twin Parallelism and Safety-Prioritisable Optimal Search Algorithm\",\"authors\":\"Tengyue Wang, Zhefan Lin, Yunze Shi, Songjie Xiao, Liangjing Yang\",\"doi\":\"10.1049/csy2.70026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper proposes a trajectory planning approach based on the configuration space (C-space) generated from large-scale digital twinning. Leveraging GPU-based parallelism, the C-space of a multi-degree-of-freedom (multi-DoF) manipulator in a complex task space with obstacles can be mapped out through extensive simulation of motion and collision of multiple virtual robot arms known as digital twins. An optimal search algorithm is incorporated with artificial potential field generated in the C-space to allow the prioritising of safety in accordance with the varying risks associated with the obstacles by means of variable repulsive potential. To extend the high-degree path to smooth and continuous joint trajectories, a spline operation is applied. Finally, a 7-DOF physical manipulator is deployed for the execution of the planned trajectory in a task space filled with obstacles. Results demonstrated a 16.3% improvement in success rate achieved by utilising the safety-prioritisable search algorithm. With this unified formulation of the control and planning problem in the C-space, the kinematics complexity of a large DOF manipulator in obstacle-present task space could be truly relieved from the joint control loop. This simplification, in turn, opens up prospective work in dynamic reconstruction of the C-space.</p>\",\"PeriodicalId\":34110,\"journal\":{\"name\":\"IET Cybersystems and Robotics\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70026\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Cybersystems and Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/csy2.70026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Cybersystems and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/csy2.70026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Robotic Arm C-Space Trajectory Planning Using Large-Scale Digital Twin Parallelism and Safety-Prioritisable Optimal Search Algorithm
This paper proposes a trajectory planning approach based on the configuration space (C-space) generated from large-scale digital twinning. Leveraging GPU-based parallelism, the C-space of a multi-degree-of-freedom (multi-DoF) manipulator in a complex task space with obstacles can be mapped out through extensive simulation of motion and collision of multiple virtual robot arms known as digital twins. An optimal search algorithm is incorporated with artificial potential field generated in the C-space to allow the prioritising of safety in accordance with the varying risks associated with the obstacles by means of variable repulsive potential. To extend the high-degree path to smooth and continuous joint trajectories, a spline operation is applied. Finally, a 7-DOF physical manipulator is deployed for the execution of the planned trajectory in a task space filled with obstacles. Results demonstrated a 16.3% improvement in success rate achieved by utilising the safety-prioritisable search algorithm. With this unified formulation of the control and planning problem in the C-space, the kinematics complexity of a large DOF manipulator in obstacle-present task space could be truly relieved from the joint control loop. This simplification, in turn, opens up prospective work in dynamic reconstruction of the C-space.