首页 > 最新文献

IET Cybersystems and Robotics最新文献

英文 中文
A Visual Odometry Artificial Intelligence-Based Method for Trajectory Learning and Tracking Applied to Mobile Robots 基于视觉里程计人工智能的移动机器人轨迹学习与跟踪方法
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-09-13 DOI: 10.1049/csy2.70028
Bernardo Manuel Pirozzo, Mariano De Paula, Sebastián Aldo Villar, Carola de Benito, Gerardo Gabriel Acosta, Rodrigo Picos

Autonomous systems have demonstrated high performance in several applications. One of the most important is localisation systems, which are necessary for the safe navigation of autonomous cars or mobile robots. However, despite significant advances in this field, there are still areas open for research and improvement. Two of the most important challenges include the precise traversal of a bounded route and emergencies arising from the breakdown or failure of one or more sensors, which can lead to malfunction or system localisation failure. To address these issues, auxiliary assistance systems are necessary, enabling localisation for a safe return to the starting point, completing the trajectory, or facilitating an emergency stop in a designated area for such situations. Motivated by the exploration of applying artificial intelligence to pose estimation in a navigation system, this article introduces a monocular visual odometry method that, through teach and repeat, learns and autonomously replicates trajectories. Our proposal can serve as either a primary localisation system or an auxiliary assistance system. In the first case, our approach is applicable in scenarios where the traversing route remains unchanged. In the second case, the goal is to achieve a safe return to the starting point or to reach the end point of the trajectory. We initially utilised a publicly available dataset to showcase the learning capability and robustness under different visibility conditions to validate our proposal. Subsequently, we compared our approach with other well-known methods to assess performance metrics. Finally, we evaluated real-time trajectory replication on a ground robot, both simulated and real, across multiple trajectories of increasing complexity.

自主系统已经在多个应用中展示了高性能。其中最重要的是定位系统,这对于自动驾驶汽车或移动机器人的安全导航是必要的。然而,尽管这一领域取得了重大进展,但仍有有待研究和改进的领域。两个最重要的挑战包括精确穿越有界路线,以及由一个或多个传感器故障或故障引起的紧急情况,这可能导致故障或系统定位失败。为了解决这些问题,辅助辅助系统是必要的,它可以实现安全返回起点、完成轨迹的定位,或者在这种情况下方便在指定区域紧急停车。在探索将人工智能应用于导航系统的姿态估计的基础上,本文介绍了一种单目视觉里程计方法,该方法通过教学和重复,学习和自主复制轨迹。我们的建议既可以作为主要的定位系统,也可以作为辅助的辅助系统。在第一种情况下,我们的方法适用于遍历路径保持不变的场景。在第二种情况下,目标是实现安全返回到起点或到达轨迹的终点。我们最初使用一个公开可用的数据集来展示不同可见性条件下的学习能力和鲁棒性,以验证我们的建议。随后,我们将我们的方法与其他知名的评估绩效指标的方法进行了比较。最后,我们评估了地面机器人的实时轨迹复制,包括模拟和真实,跨越多个日益复杂的轨迹。
{"title":"A Visual Odometry Artificial Intelligence-Based Method for Trajectory Learning and Tracking Applied to Mobile Robots","authors":"Bernardo Manuel Pirozzo,&nbsp;Mariano De Paula,&nbsp;Sebastián Aldo Villar,&nbsp;Carola de Benito,&nbsp;Gerardo Gabriel Acosta,&nbsp;Rodrigo Picos","doi":"10.1049/csy2.70028","DOIUrl":"10.1049/csy2.70028","url":null,"abstract":"<p>Autonomous systems have demonstrated high performance in several applications. One of the most important is localisation systems, which are necessary for the safe navigation of autonomous cars or mobile robots. However, despite significant advances in this field, there are still areas open for research and improvement. Two of the most important challenges include the precise traversal of a bounded route and emergencies arising from the breakdown or failure of one or more sensors, which can lead to malfunction or system localisation failure. To address these issues, auxiliary assistance systems are necessary, enabling localisation for a safe return to the starting point, completing the trajectory, or facilitating an emergency stop in a designated area for such situations. Motivated by the exploration of applying artificial intelligence to pose estimation in a navigation system, this article introduces a monocular visual odometry method that, through teach and repeat, learns and autonomously replicates trajectories. Our proposal can serve as either a primary localisation system or an auxiliary assistance system. In the first case, our approach is applicable in scenarios where the traversing route remains unchanged. In the second case, the goal is to achieve a safe return to the starting point or to reach the end point of the trajectory. We initially utilised a publicly available dataset to showcase the learning capability and robustness under different visibility conditions to validate our proposal. Subsequently, we compared our approach with other well-known methods to assess performance metrics. Finally, we evaluated real-time trajectory replication on a ground robot, both simulated and real, across multiple trajectories of increasing complexity.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70028","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145038123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Clustering Path Optimisation-Based 2-Opt Rapid Wax-Drawing Trajectory Planning for Industrial 3D Wax-Drawing Robots 基于聚类路径优化的2-Opt工业3D拔蜡机器人快速轨迹规划
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-09-11 DOI: 10.1049/csy2.70025
Qiyuan Fu, Ping Liu, Qinglang Xie, Shidong Zhai, Mingjie Liu

The tool path trajectory serves as a cornerstone of three-dimensional (3D) printing robot technology, and path optimisation algorithms are instrumental in enabling faster, more precise and higher-quality prints. This work proposes a clustering path optimisation-based 2-opt rapid wax-drawing trajectory planning method for 3D drawing robots. Firstly, the input wax-drawing image is preprocessed to extract contour information, which is then simplified into polygons. Next, the spiral and filling trajectory algorithms are used to convert the polygons into corresponding spiral and filling paths, which are modelled as nodes in the travelling salesman problem (TSP). An improved k-means++ clustering algorithm is then designed to adaptively divide the nodes into multiple clusters. Each cluster is subsequently planned using the improved ant colony optimisation (ACO) algorithm to find the shortest path. Afterwards, the nearest-neighbour algorithm is employed to connect the shortest paths of each cluster, forming an initial tool path. Finally, the 2-opt optimisation algorithm is incorporated to optimise the preliminary path, resulting in the optimal motion trajectory for the wax-drawing tool. The verification tests show that the proposed method achieves an average reduction in path length of 30.75% compared with the parallel scanning method, traditional ant colony optimisation, Christofides with 2-opt algorithm. Meanwhile, the 3D robot wax-drawing experiments demonstrate a 17.9% reduction in drawing time, significantly improving the efficiency of large-scale production and highlighting the practical value of 3D drawing robots.

刀具轨迹轨迹是三维(3D)打印机器人技术的基石,路径优化算法有助于实现更快、更精确和更高质量的打印。提出了一种基于聚类路径优化的2-opt三维绘图机器人快速拔蜡轨迹规划方法。首先对输入的蜡像图像进行预处理,提取轮廓信息,然后将轮廓信息简化为多边形;其次,利用螺旋和填充轨迹算法将多边形转换成相应的螺旋和填充路径,并将其建模为旅行推销员问题(TSP)中的节点。然后设计了改进的k-means++聚类算法,自适应地将节点划分为多个聚类。随后使用改进的蚁群优化(ACO)算法对每个集群进行规划,以找到最短路径。然后,采用最近邻算法将每个簇的最短路径连接起来,形成初始刀具路径。最后,结合2-opt优化算法对初始路径进行优化,得到了拉蜡工具的最优运动轨迹。验证实验表明,该方法与并行扫描、传统蚁群优化、2-opt算法相比,路径长度平均缩短30.75%。同时,三维机器人拔蜡实验表明,其拔蜡时间缩短了17.9%,显著提高了大规模生产的效率,凸显了三维机器人的实用价值。
{"title":"Clustering Path Optimisation-Based 2-Opt Rapid Wax-Drawing Trajectory Planning for Industrial 3D Wax-Drawing Robots","authors":"Qiyuan Fu,&nbsp;Ping Liu,&nbsp;Qinglang Xie,&nbsp;Shidong Zhai,&nbsp;Mingjie Liu","doi":"10.1049/csy2.70025","DOIUrl":"10.1049/csy2.70025","url":null,"abstract":"<p>The tool path trajectory serves as a cornerstone of three-dimensional (3D) printing robot technology, and path optimisation algorithms are instrumental in enabling faster, more precise and higher-quality prints. This work proposes a clustering path optimisation-based 2-opt rapid wax-drawing trajectory planning method for 3D drawing robots. Firstly, the input wax-drawing image is preprocessed to extract contour information, which is then simplified into polygons. Next, the spiral and filling trajectory algorithms are used to convert the polygons into corresponding spiral and filling paths, which are modelled as nodes in the travelling salesman problem (TSP). An improved k-means++ clustering algorithm is then designed to adaptively divide the nodes into multiple clusters. Each cluster is subsequently planned using the improved ant colony optimisation (ACO) algorithm to find the shortest path. Afterwards, the nearest-neighbour algorithm is employed to connect the shortest paths of each cluster, forming an initial tool path. Finally, the 2-opt optimisation algorithm is incorporated to optimise the preliminary path, resulting in the optimal motion trajectory for the wax-drawing tool. The verification tests show that the proposed method achieves an average reduction in path length of 30.75% compared with the parallel scanning method, traditional ant colony optimisation, Christofides with 2-opt algorithm. Meanwhile, the 3D robot wax-drawing experiments demonstrate a 17.9% reduction in drawing time, significantly improving the efficiency of large-scale production and highlighting the practical value of 3D drawing robots.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70025","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RevFB-BEV: Memory-Efficient Network With Reversible Swin Transformer for 3D BEV Object Detection RevFB-BEV:具有可逆Swin变压器的内存高效网络,用于3D BEV目标检测
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-09-08 DOI: 10.1049/csy2.70021
Leilei Pan, Yingnan Guo, Yu Zhang

The perception of Bird's Eye View (BEV) has become a widely adopted approach in 3D object detection due to its spatial and dimensional consistency. However, the increasing complexity of neural network architectures has resulted in higher training memory, thereby limiting the scalability of model training. To address these challenges, we propose a novel model, RevFB-BEV, which is based on the Reversible Swin Transformer (RevSwin) with Forward-Backward View Transformation (FBVT) and LiDAR Guided Back Projection (LGBP). This approach includes the RevSwin backbone network, which employs a reversible architecture to minimise training memory by recomputing intermediate parameters. Moreover, we introduce the FBVT module that refines BEV features extracted from forward projection, yielding denser and more precise camera BEV representations. The LGBP module further utilises LiDAR BEV guidance for back projection to achieve more accurate camera BEV features. Extensive experiments on the nuScenes dataset demonstrate notable performance improvements, with our model achieving over a 4× $4times $ reduction in training memory and a more than 12× $12times $ decrease in single-backbone training memory. These efficiency gains become even more pronounced with deeper network architectures. Additionally, RevFB-BEV achieves 68.1 mAP (mean Average Precision) on the validation set and 68.9 mAP on the test set, which is nearly on par with the baseline BEVFusion, underscoring its effectiveness in resource-constrained scenarios.

鸟瞰图(BEV)因其空间和维度的一致性而成为三维目标检测中广泛采用的一种方法。然而,随着神经网络结构复杂度的不断提高,训练内存的要求越来越高,从而限制了模型训练的可扩展性。为了解决这些挑战,我们提出了一种新的模型,RevFB-BEV,它基于可逆Swin变压器(RevSwin),具有前向后视图变换(FBVT)和激光雷达制导反向投影(LGBP)。该方法包括RevSwin骨干网,该骨干网采用可逆结构,通过重新计算中间参数来最小化训练记忆。此外,我们还引入了FBVT模块,该模块对前向投影提取的BEV特征进行细化,从而获得更密集、更精确的相机BEV表示。LGBP模块进一步利用LiDAR BEV引导进行反向投影,以实现更精确的相机BEV功能。在nuScenes数据集上的大量实验证明了显着的性能改进,我们的模型在训练内存中实现了超过4 × 4times $的减少,在单骨干训练内存中实现了超过12 × 12times $的减少。随着网络架构的深入,这些效率的提升变得更加明显。此外,RevFB-BEV在验证集上达到68.1 mAP (mean Average Precision),在测试集上达到68.9 mAP,几乎与基线BEVFusion相当,强调了其在资源受限场景下的有效性。
{"title":"RevFB-BEV: Memory-Efficient Network With Reversible Swin Transformer for 3D BEV Object Detection","authors":"Leilei Pan,&nbsp;Yingnan Guo,&nbsp;Yu Zhang","doi":"10.1049/csy2.70021","DOIUrl":"10.1049/csy2.70021","url":null,"abstract":"<p>The perception of Bird's Eye View (BEV) has become a widely adopted approach in 3D object detection due to its spatial and dimensional consistency. However, the increasing complexity of neural network architectures has resulted in higher training memory, thereby limiting the scalability of model training. To address these challenges, we propose a novel model, RevFB-BEV, which is based on the Reversible Swin Transformer (RevSwin) with Forward-Backward View Transformation (FBVT) and LiDAR Guided Back Projection (LGBP). This approach includes the RevSwin backbone network, which employs a reversible architecture to minimise training memory by recomputing intermediate parameters. Moreover, we introduce the FBVT module that refines BEV features extracted from forward projection, yielding denser and more precise camera BEV representations. The LGBP module further utilises LiDAR BEV guidance for back projection to achieve more accurate camera BEV features. Extensive experiments on the nuScenes dataset demonstrate notable performance improvements, with our model achieving over a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 <mo>×</mo>\u0000 </mrow>\u0000 <annotation> $4times $</annotation>\u0000 </semantics></math> reduction in training memory and a more than <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>12</mn>\u0000 <mo>×</mo>\u0000 </mrow>\u0000 <annotation> $12times $</annotation>\u0000 </semantics></math> decrease in single-backbone training memory. These efficiency gains become even more pronounced with deeper network architectures. Additionally, RevFB-BEV achieves 68.1 mAP (mean Average Precision) on the validation set and 68.9 mAP on the test set, which is nearly on par with the baseline BEVFusion, underscoring its effectiveness in resource-constrained scenarios.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70021","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145012633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A General Optimisation-Based Framework for Global Pose Estimation With Multiple Sensors 基于通用优化的多传感器全局姿态估计框架
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-09-04 DOI: 10.1049/csy2.70023
Tong Qin, Shaozu Cao, Jie Pan, Shaojie Shen

Accurate state estimation is a fundamental problem for autonomous robots. To achieve locally accurate and globally drift-free state estimation, multiple sensors with complementary properties are usually fused together. Local sensors (camera, IMU (inertial measurement unit), LiDAR, etc.) provide precise poses within a small region, whereas global sensors (GPS (global positioning system), magnetometer, barometer, etc.) supply noisy but globally drift-free localisation in a large-scale environment. In this paper, we propose a sensor fusion framework to fuse local states with global sensors, which achieves locally accurate and globally drift-free pose estimation. Local estimations, produced by existing visual odometry/visual-inertial odometry (VO/VIO) approaches, are fused with global sensors in a pose graph optimisation. Within the graph optimisation, local estimations are aligned into a global coordinate. Meanwhile, the accumulated drifts are eliminated. We evaluated the performance of our system on public datasets and with real-world experiments. The results are compared with those of other state-of-the-art algorithms. We highlight that our system is a general framework which can easily fuse various global sensors in a unified pose graph optimisation.

准确的状态估计是自主机器人的一个基本问题。为了实现局部准确和全局无漂移的状态估计,通常需要将多个特性互补的传感器融合在一起。局部传感器(相机,IMU(惯性测量单元),激光雷达等)提供小区域内的精确姿态,而全球传感器(GPS(全球定位系统),磁力计,气压计等)在大范围环境中提供嘈杂但全球无漂移的定位。在本文中,我们提出了一种传感器融合框架,将局部状态与全局传感器融合,从而实现局部精确和全局无漂移的姿态估计。由现有视觉里程计/视觉惯性里程计(VO/VIO)方法产生的局部估计与姿态图优化中的全局传感器融合在一起。在图形优化中,局部估计被对齐到全局坐标中。同时,消除了堆积的漂移。我们在公共数据集和现实世界的实验中评估了我们的系统的性能。结果与其他最先进的算法进行了比较。我们强调,我们的系统是一个通用框架,可以很容易地融合各种全局传感器在一个统一的姿态图优化。
{"title":"A General Optimisation-Based Framework for Global Pose Estimation With Multiple Sensors","authors":"Tong Qin,&nbsp;Shaozu Cao,&nbsp;Jie Pan,&nbsp;Shaojie Shen","doi":"10.1049/csy2.70023","DOIUrl":"10.1049/csy2.70023","url":null,"abstract":"<p>Accurate state estimation is a fundamental problem for autonomous robots. To achieve locally accurate and globally drift-free state estimation, multiple sensors with complementary properties are usually fused together. Local sensors (camera, IMU (inertial measurement unit), LiDAR, etc.) provide precise poses within a small region, whereas global sensors (GPS (global positioning system), magnetometer, barometer, etc.) supply noisy but globally drift-free localisation in a large-scale environment. In this paper, we propose a sensor fusion framework to fuse local states with global sensors, which achieves locally accurate and globally drift-free pose estimation. Local estimations, produced by existing visual odometry/visual-inertial odometry (VO/VIO) approaches, are fused with global sensors in a pose graph optimisation. Within the graph optimisation, local estimations are aligned into a global coordinate. Meanwhile, the accumulated drifts are eliminated. We evaluated the performance of our system on public datasets and with real-world experiments. The results are compared with those of other state-of-the-art algorithms. We highlight that our system is a general framework which can easily fuse various global sensors in a unified pose graph optimisation.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144935142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conflict-Free Planning and Data-Driven Control of Large-Scale Nonlinear Multi-Robot Systems 大型非线性多机器人系统的无冲突规划与数据驱动控制
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-09-01 DOI: 10.1049/csy2.70027
You Wu, Yi Lei, Haoran Tan, Jin Guo, Yaonan Wang

This paper addresses a crucial challenge in the domain of smart factories and intelligent warehouse logistics, focusing on conflict-free planning and the smooth operation of large-scale nonlinear mobile robots. To tackle the challenges associated with scheduling large-scale mobile robots, an improved space–time multi-robot planning algorithm is proposed. The cloud servers are adopted in this algorithm for computation, which enables faster response to the planning requirements of large-scale mobile robots. Furthermore, enhancements to a model-free adaptive predictive control method are proposed to enhance the networked control effectiveness of the nonlinear robots. The algorithm's capability to accommodate conflict-free path planning for large-scale mobile robots is demonstrated through simulation results. Experimental findings further validate the effectiveness of the cloud-based large-scale mobile robot planning and control system in achieving both conflict-free path planning and accurate path tracking. This research holds substantial implications for enhancing logistics transportation efficiency and driving advancements in the field of smart factories and intelligent warehouse logistics.

本文解决了智能工厂和智能仓库物流领域的一个关键挑战,重点研究了大型非线性移动机器人的无冲突规划和平稳运行。针对大型移动机器人调度问题,提出了一种改进的时空多机器人规划算法。该算法采用云服务器进行计算,能够更快地响应大型移动机器人的规划需求。在此基础上,对无模型自适应预测控制方法进行了改进,提高了非线性机器人的网络化控制效果。仿真结果表明,该算法具有适应大型移动机器人无冲突路径规划的能力。实验结果进一步验证了基于云的大型移动机器人规划控制系统在实现无冲突路径规划和精确路径跟踪方面的有效性。本研究对提高物流运输效率,推动智能工厂和智能仓储物流领域的发展具有重要意义。
{"title":"Conflict-Free Planning and Data-Driven Control of Large-Scale Nonlinear Multi-Robot Systems","authors":"You Wu,&nbsp;Yi Lei,&nbsp;Haoran Tan,&nbsp;Jin Guo,&nbsp;Yaonan Wang","doi":"10.1049/csy2.70027","DOIUrl":"10.1049/csy2.70027","url":null,"abstract":"<p>This paper addresses a crucial challenge in the domain of smart factories and intelligent warehouse logistics, focusing on conflict-free planning and the smooth operation of large-scale nonlinear mobile robots. To tackle the challenges associated with scheduling large-scale mobile robots, an improved space–time multi-robot planning algorithm is proposed. The cloud servers are adopted in this algorithm for computation, which enables faster response to the planning requirements of large-scale mobile robots. Furthermore, enhancements to a model-free adaptive predictive control method are proposed to enhance the networked control effectiveness of the nonlinear robots. The algorithm's capability to accommodate conflict-free path planning for large-scale mobile robots is demonstrated through simulation results. Experimental findings further validate the effectiveness of the cloud-based large-scale mobile robot planning and control system in achieving both conflict-free path planning and accurate path tracking. This research holds substantial implications for enhancing logistics transportation efficiency and driving advancements in the field of smart factories and intelligent warehouse logistics.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144927354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robotic Arm C-Space Trajectory Planning Using Large-Scale Digital Twin Parallelism and Safety-Prioritisable Optimal Search Algorithm 基于大规模数字双并行和安全优先优化搜索算法的机械臂c空间轨迹规划
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-08-28 DOI: 10.1049/csy2.70026
Tengyue Wang, Zhefan Lin, Yunze Shi, Songjie Xiao, Liangjing Yang

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.

提出了一种基于大规模数字孪生生成的构型空间(c空间)的轨迹规划方法。利用基于gpu的并行性,通过对多个虚拟机械臂(即数字孪生臂)的运动和碰撞的广泛模拟,可以绘制出具有障碍物的复杂任务空间中的多自由度(multi-DoF)机械手的c空间。将最优搜索算法与c空间中生成的人工势场相结合,利用可变排斥势,根据障碍物所带来的不同风险对安全进行优先排序。为了将高阶路径扩展为光滑和连续的关节轨迹,应用了样条操作。最后,在充满障碍物的任务空间中部署一个七自由度物理机械手来执行规划的轨迹。结果表明,通过使用安全优先搜索算法,成功率提高了16.3%。通过c空间控制与规划问题的统一表述,可以真正从关节控制回路中解脱出大自由度机械臂在无障碍物任务空间中的运动复杂性。这种简化反过来又为c空间的动态重建开辟了前景。
{"title":"Robotic Arm C-Space Trajectory Planning Using Large-Scale Digital Twin Parallelism and Safety-Prioritisable Optimal Search Algorithm","authors":"Tengyue Wang,&nbsp;Zhefan Lin,&nbsp;Yunze Shi,&nbsp;Songjie Xiao,&nbsp;Liangjing Yang","doi":"10.1049/csy2.70026","DOIUrl":"10.1049/csy2.70026","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.2,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144915120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lightweight DETR for Small-Target Defect Detection in Stators and Rotors of Pumped Storage Generators 用于抽水蓄能发电机定子和转子小目标缺陷检测的轻量级DETR
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-08-24 DOI: 10.1049/csy2.70022
Yang You, Zhimeng Chen, Jian Qiao, Huan Liu, Jing Fang, Jie Luo, Jiaxin Wei, Jiarong Xu

Real-time detection of micro-defects in pumped storage generator stators and rotors remains challenging due to small-target obscurity and edge deployment constraints. This paper proposes EdgeFault-detection transformer (DETR), a lightweight transformer model that integrates three innovations: (1) dynamic geometric-photometric augmentation for robustness, (2) a FasterNet backbone with Partial Convolution (PConv) that reduces the number of parameters by 40% (from 20 × 106 to 12 × 106), and (3) cross-scale small-object head enhancing defect localisation. Experiments on 8763 industrial images demonstrate 75.38% [email protected] (+17.25% over RT-DETR) and 49.3% mAPsmall (+42.9% from baseline). The model achieves 22 FPS on NVIDIA RTX A4000 GPUs (640 × 640 resolution), validating real-time industrial applicability. Strategic computation allocation increases GFLOPs (giga floating-point operations) by 16.4% (from 58.6 to 68.2) to prioritise safety–critical precision, justifying the trade-off for detecting high-risk anomalies (e.g., insulation cracks).

由于小目标模糊和边缘部署的限制,实时检测抽水蓄能发电机定子和转子的微缺陷仍然具有挑战性。本文提出了边缘故障检测变压器(DETR),这是一种轻量级变压器模型,它集成了三个创新:(1)动态几何光度增强增强鲁棒性;(2)带有部分卷积(PConv)的FasterNet骨干,将参数数量减少了40%(从20 × 106减少到12 × 106);(3)跨尺度小目标头部增强缺陷定位。在8763张工业图像上的实验表明,75.38% [email protected](比RT-DETR +17.25%)和49.3% mAPsmall(比基线+42.9%)。该模型在NVIDIA RTX A4000 gpu (640 × 640分辨率)上实现了22 FPS,验证了实时工业适用性。战略计算分配将GFLOPs(千兆浮点运算)提高16.4%(从58.6提高到68.2),以优先考虑安全关键精度,证明检测高风险异常(例如绝缘裂缝)的权衡是合理的。
{"title":"Lightweight DETR for Small-Target Defect Detection in Stators and Rotors of Pumped Storage Generators","authors":"Yang You,&nbsp;Zhimeng Chen,&nbsp;Jian Qiao,&nbsp;Huan Liu,&nbsp;Jing Fang,&nbsp;Jie Luo,&nbsp;Jiaxin Wei,&nbsp;Jiarong Xu","doi":"10.1049/csy2.70022","DOIUrl":"10.1049/csy2.70022","url":null,"abstract":"<p>Real-time detection of micro-defects in pumped storage generator stators and rotors remains challenging due to small-target obscurity and edge deployment constraints. This paper proposes EdgeFault-detection transformer (DETR), a lightweight transformer model that integrates three innovations: (1) dynamic geometric-photometric augmentation for robustness, (2) a FasterNet backbone with Partial Convolution (PConv) that reduces the number of parameters by 40% (from 20 × 10<sup>6</sup> to 12 × 10<sup>6</sup>), and (3) cross-scale small-object head enhancing defect localisation. Experiments on 8763 industrial images demonstrate 75.38% [email protected] (+17.25% over RT-DETR) and 49.3% mAP<sub>small</sub> (+42.9% from baseline). The model achieves 22 FPS on NVIDIA RTX A4000 GPUs (640 × 640 resolution), validating real-time industrial applicability. Strategic computation allocation increases GFLOPs (giga floating-point operations) by 16.4% (from 58.6 to 68.2) to prioritise safety–critical precision, justifying the trade-off for detecting high-risk anomalies (e.g., insulation cracks).</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70022","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144894145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lightweight Hand Acupoint Recognition Based on Middle Finger Cun Measurement 基于中指寸测量的手部轻量级穴位识别
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-08-23 DOI: 10.1049/csy2.70024
Zili Meng, Minglang Lu, Guanci Yang, Tianyi Zhao, Donghua Zheng, Ling He, Zhi Shan

Acupoint therapy plays a crucial role in the prevention and treatment of various diseases. Accurate and efficient intelligent acupoint recognition methods are essential for enhancing the operational capabilities of embodied intelligent robots in acupoint massage and related applications. This paper proposes a lightweight hand acupoint recognition (LHAR) method based on middle finger cun measurement. First, to obtain a lightweight model for rapid positioning of the hand area, on the basis of the design of the partially convolutional gated regularisation unit and the efficient shared convolutional detection head, an improved YOLO11 algorithm based on a lightweight efficient shared convolutional detection head (YOLO11-SH) was proposed. Second, according to the theory of traditional Chinese medicine, a method of positional relationship determination between acupoints based on middle finger cun measurement is established. The MediaPipe algorithm is subsequently used to obtain 21 keypoints of the hand and serves as a reference point for obtaining features of middle finger cun via positional relationship determination. Then, the offset-based localisation approach is adopted to achieve accurate recognition of acupoints by using the obtained feature of middle finger cun. Comparative experiments with five representative lightweight models demonstrate that YOLO11-SH achieves an [email protected] of 97.3%, with 1.59 × 106 parameters, 3.9 × 109 FLOPs, a model weight of 3.4 MB and an inference speed of 325.8 FPS, outperforming the comparison methods in terms of both recognition accuracy and model efficiency. The experimental results of acupoint recognition indicate that the overall recognition accuracy of LHAR has reached 94.49%. The average normalised displacement error for different acupoints ranges from 0.036 to 0.105, all within the error threshold of ≤ 0.15. Finally, LHAR is integrated into the robotic platform, and a robotic massage experiment is conducted to verify the effectiveness of LHAR.

穴位疗法在预防和治疗各种疾病中起着至关重要的作用。准确、高效的智能穴位识别方法是提高嵌入式智能机器人在穴位按摩及相关应用中的操作能力的必要条件。提出了一种基于中指测量的轻量级手部穴位识别方法。首先,为了获得手部区域快速定位的轻量化模型,在设计部分卷积门控正则化单元和高效共享卷积检测头的基础上,提出了一种基于轻量化高效共享卷积检测头的改进YOLO11算法(YOLO11- sh)。其次,根据中医理论,建立了一种基于中指寸测量的穴位位置关系确定方法。随后使用MediaPipe算法获得手部的21个关键点,并作为参考点,通过位置关系确定获得中指孔的特征。然后,采用基于偏移量的定位方法,利用获取的中指孔特征实现穴位的准确识别。与5种代表性轻量化模型的对比实验表明,YOLO11-SH的[email protected]识别率为97.3%,参数为1.59 × 106, FLOPs为3.9 × 109,模型权值为3.4 MB,推理速度为325.8 FPS,在识别精度和模型效率方面均优于对比方法。穴位识别实验结果表明,LHAR的整体识别准确率达到了94.49%。不同穴位的平均归一化位移误差范围为0.036 ~ 0.105,均在误差阈值≤0.15以内。最后,将LHAR集成到机器人平台中,并进行机器人按摩实验,验证LHAR的有效性。
{"title":"Lightweight Hand Acupoint Recognition Based on Middle Finger Cun Measurement","authors":"Zili Meng,&nbsp;Minglang Lu,&nbsp;Guanci Yang,&nbsp;Tianyi Zhao,&nbsp;Donghua Zheng,&nbsp;Ling He,&nbsp;Zhi Shan","doi":"10.1049/csy2.70024","DOIUrl":"10.1049/csy2.70024","url":null,"abstract":"<p>Acupoint therapy plays a crucial role in the prevention and treatment of various diseases. Accurate and efficient intelligent acupoint recognition methods are essential for enhancing the operational capabilities of embodied intelligent robots in acupoint massage and related applications. This paper proposes a lightweight hand acupoint recognition (LHAR) method based on middle finger cun measurement. First, to obtain a lightweight model for rapid positioning of the hand area, on the basis of the design of the partially convolutional gated regularisation unit and the efficient shared convolutional detection head, an improved YOLO11 algorithm based on a lightweight efficient shared convolutional detection head (YOLO11-SH) was proposed. Second, according to the theory of traditional Chinese medicine, a method of positional relationship determination between acupoints based on middle finger cun measurement is established. The MediaPipe algorithm is subsequently used to obtain 21 keypoints of the hand and serves as a reference point for obtaining features of middle finger cun via positional relationship determination. Then, the offset-based localisation approach is adopted to achieve accurate recognition of acupoints by using the obtained feature of middle finger cun. Comparative experiments with five representative lightweight models demonstrate that YOLO11-SH achieves an [email protected] of 97.3%, with 1.59 × 10<sup>6</sup> parameters, 3.9 × 10<sup>9</sup> FLOPs, a model weight of 3.4 MB and an inference speed of 325.8 FPS, outperforming the comparison methods in terms of both recognition accuracy and model efficiency. The experimental results of acupoint recognition indicate that the overall recognition accuracy of LHAR has reached 94.49%. The average normalised displacement error for different acupoints ranges from 0.036 to 0.105, all within the error threshold of ≤ 0.15. Finally, LHAR is integrated into the robotic platform, and a robotic massage experiment is conducted to verify the effectiveness of LHAR.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70024","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144892497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hybrid Dynamic Point Removal and Ellipsoid Modelling of Object-Based Semantic SLAM 基于对象语义SLAM的混合动态点移除和椭球建模
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-08-21 DOI: 10.1049/csy2.70020
Qingyang Xu, Siwei Huang, Yong Song, Bao Pang, Chengjin Zhang

For the issue of low positioning accuracy in dynamic environments with traditional simultaneous localisation and mapping (SLAM), a dynamic point removal strategy combining object detection and optical flow tracking has been proposed. To fully utilise the semantic information, an ellipsoid model of the detected semantic objects was first constructed based on the plane and point cloud constraints, which assists in loop closure detection. Bilateral semantic map matching was achieved through the Kuhn–Munkres (KM) algorithm maximum weight assignment, and the pose transformation between local and global maps was determined by the random sample consensus (RANSAC) algorithm. Finally, a stable semantic SLAM system suitable for dynamic environments was constructed. The effectiveness of achieving the system's positioning accuracy under dynamic interference and large visual-inertial loop closure was verified by the experiment.

针对传统的同时定位与映射(SLAM)方法在动态环境下定位精度低的问题,提出了一种结合目标检测和光流跟踪的动态点移除策略。为了充分利用检测到的语义信息,首先基于平面和点云约束构造语义对象的椭球模型,辅助闭环检测。通过Kuhn-Munkres (KM)算法最大权值分配实现双边语义地图匹配,通过随机样本一致性(RANSAC)算法确定局部和全局地图之间的姿态转换。最后,构建了一个适用于动态环境的稳定语义SLAM系统。实验验证了该系统在动态干扰和大视惯性闭环条件下实现定位精度的有效性。
{"title":"Hybrid Dynamic Point Removal and Ellipsoid Modelling of Object-Based Semantic SLAM","authors":"Qingyang Xu,&nbsp;Siwei Huang,&nbsp;Yong Song,&nbsp;Bao Pang,&nbsp;Chengjin Zhang","doi":"10.1049/csy2.70020","DOIUrl":"10.1049/csy2.70020","url":null,"abstract":"<p>For the issue of low positioning accuracy in dynamic environments with traditional simultaneous localisation and mapping (SLAM), a dynamic point removal strategy combining object detection and optical flow tracking has been proposed. To fully utilise the semantic information, an ellipsoid model of the detected semantic objects was first constructed based on the plane and point cloud constraints, which assists in loop closure detection. Bilateral semantic map matching was achieved through the Kuhn–Munkres (KM) algorithm maximum weight assignment, and the pose transformation between local and global maps was determined by the random sample consensus (RANSAC) algorithm. Finally, a stable semantic SLAM system suitable for dynamic environments was constructed. The effectiveness of achieving the system's positioning accuracy under dynamic interference and large visual-inertial loop closure was verified by the experiment.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70020","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144881343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic Cooperative Optimisation With Differential Evolution for Trajectory Planning of Robotic Arms 基于差分进化的机械臂轨迹规划动态协同优化
IF 1.2 Q3 AUTOMATION & CONTROL SYSTEMS Pub Date : 2025-07-18 DOI: 10.1049/csy2.70016
Yongzhe Luo, Zhenfeng Xue, Xu Song, Zhongyuan Miao, Yong Hu

Trajectory planning of a robotic arm has a significant impact on its operational efficiency and success rate. However, due to the complexity of the environment and the vastness of the search space, it often ends up falling into local optima. In this paper, we propose a novel algorithm that combines particle swarm optimisation (PSO) with differential evolution (DE), namely the PSO-DE algorithm, to alleviate the problem. Firstly, the initial path of the robotic arm is represented by spline curves in the joint space. Then, the trajectory optimisation problem of the robotic arm is established, including constraints such as obstacle cost, acceleration cost, torque cost etc. Finally, the PSO-DE algorithm is proposed for optimisation, from which the PSO ensures the search space range through individual collaboration, whereas the DE generates new solutions through individual differentiation with local search. The combination of the two algorithms can fully leverage their respective advantages, ensuring the global optima within a large search space. Experiments are conducted in a simulation environment using the Python Robotics Toolbox and the PyBullet simulation platform. The results demonstrate that the proposed algorithm can effectively plan the trajectory of the robotic arm with significant improvements in success rates compared to the PSO algorithm.

机械臂的轨迹规划对机械臂的操作效率和成功率有着重要的影响。然而,由于环境的复杂性和搜索空间的广泛性,它往往会陷入局部最优。本文提出了一种结合粒子群优化(PSO)和差分进化(DE)的新算法,即PSO-DE算法来缓解这一问题。首先,用关节空间的样条曲线表示机械臂的初始路径;然后,建立了机器人手臂轨迹优化问题,包括障碍成本、加速度成本、扭矩成本等约束条件;最后,提出了PSO-DE算法进行优化,其中PSO算法通过个体协作确保搜索空间范围,DE算法通过个体分化和局部搜索生成新解。两种算法的结合可以充分发挥各自的优势,保证在大的搜索空间内实现全局最优。实验使用Python Robotics Toolbox和PyBullet仿真平台在仿真环境中进行。结果表明,与粒子群算法相比,该算法能够有效地规划机械臂的运动轨迹,成功率显著提高。
{"title":"Dynamic Cooperative Optimisation With Differential Evolution for Trajectory Planning of Robotic Arms","authors":"Yongzhe Luo,&nbsp;Zhenfeng Xue,&nbsp;Xu Song,&nbsp;Zhongyuan Miao,&nbsp;Yong Hu","doi":"10.1049/csy2.70016","DOIUrl":"10.1049/csy2.70016","url":null,"abstract":"<p>Trajectory planning of a robotic arm has a significant impact on its operational efficiency and success rate. However, due to the complexity of the environment and the vastness of the search space, it often ends up falling into local optima. In this paper, we propose a novel algorithm that combines particle swarm optimisation (PSO) with differential evolution (DE), namely the PSO-DE algorithm, to alleviate the problem. Firstly, the initial path of the robotic arm is represented by spline curves in the joint space. Then, the trajectory optimisation problem of the robotic arm is established, including constraints such as obstacle cost, acceleration cost, torque cost etc. Finally, the PSO-DE algorithm is proposed for optimisation, from which the PSO ensures the search space range through individual collaboration, whereas the DE generates new solutions through individual differentiation with local search. The combination of the two algorithms can fully leverage their respective advantages, ensuring the global optima within a large search space. Experiments are conducted in a simulation environment using the Python Robotics Toolbox and the PyBullet simulation platform. The results demonstrate that the proposed algorithm can effectively plan the trajectory of the robotic arm with significant improvements in success rates compared to the PSO algorithm.</p>","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"7 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/csy2.70016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144657612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
IET Cybersystems and Robotics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1