首页 > 最新文献

Robotics and Autonomous Systems最新文献

英文 中文
Adaptive fuzzy-genetic algorithm operators for solving mobile robot scheduling problem in job-shop FMS environment 自适应模糊遗传算法运算器用于解决作业车间 FMS 环境中的移动机器人调度问题
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-14 DOI: 10.1016/j.robot.2024.104683
Erlianasha Samsuria , Mohd Saiful Azimi Mahmud , Norhaliza Abdul Wahab , Muhammad Zakiyullah Romdlony , Mohamad Shukri Zainal Abidin , Salinda Buyamin

Flexible Manufacturing Systems (FMS) is known as one of the recurring themes that possess these promising characteristics with a synergistic combination of productivity-efficiency transport and flexibility through a number of machine tools alongside other material handling devices. In FMS, mobile robots are commonly deployed in material handling system for the purpose of increasing the efficiency and productivity of the manufacturing process. A reliable, efficient, and optimal scheduling is the most important in manufacturing system. The scheduling problems can become highly complex, especially in large-scale systems with numerous tasks and constraints. Thus, schedule optimization becomes crucial to enhance target performance by determining the best allocations and sequences of resources under specified constraints. Recently, Genetic Algorithm (GA) is a remarkably applicable search algorithm to solve scheduling problems to the way that near optimal could be found. While the performance of GA much depends on the selection of the main parameters, a standard GA may suffer from the issue of premature convergence due to the lack of control on its parameters especially crossover and mutation operators. As there is no specific method or way to tune these parameters, the algorithm is prone to converge on the local optimum, thereby leading to performance degradation. To overcome such flaw, this paper proposed an improved Genetic Algorithm using an adaptive Fuzzy Logic to control crossover and mutation operators (FGAOC) for the solution to the NP-hard problem of scheduling mobile robot within Job-Shop FMS environment. The proposed algorithm has been evaluated in several case studies such as small and large-scale problem, various numbers of mobile robots and the 40-test benchmark problem. The results have demonstrated that the proposed FGAOC has delivered a good performance in exploration-exploitation activities with better solution quality.

众所周知,柔性制造系统(FMS)是一个经常出现的主题,它通过一些机床和其他材料处理设备,将生产率-效率运输和灵活性协同结合起来,从而具备了这些充满希望的特性。在 FMS 系统中,移动机器人通常被部署在材料处理系统中,以提高生产过程的效率和生产率。在制造系统中,可靠、高效和优化的调度是最重要的。调度问题可能会变得非常复杂,尤其是在具有众多任务和约束条件的大型系统中。因此,在特定的约束条件下,通过确定资源的最佳分配和排序来提高目标绩效,调度优化变得至关重要。最近,遗传算法(GA)是一种非常适用于解决调度问题的搜索算法,可以找到接近最优的方法。虽然遗传算法的性能在很大程度上取决于主要参数的选择,但由于缺乏对其参数的控制,特别是交叉和突变算子,标准遗传算法可能会出现过早收敛的问题。由于没有调整这些参数的具体方法或途径,该算法很容易收敛于局部最优,从而导致性能下降。为了克服这种缺陷,本文提出了一种改进的遗传算法,使用自适应模糊逻辑来控制交叉和变异算子(FGAOC),用于解决在作业车间 FMS 环境中调度移动机器人的 NP 难问题。已在多个案例研究中对所提出的算法进行了评估,如小型和大型问题、各种数量的移动机器人以及 40 个测试基准问题。结果表明,所提出的 FGAOC 在探索-开发活动中表现出色,解决方案质量更高。
{"title":"Adaptive fuzzy-genetic algorithm operators for solving mobile robot scheduling problem in job-shop FMS environment","authors":"Erlianasha Samsuria ,&nbsp;Mohd Saiful Azimi Mahmud ,&nbsp;Norhaliza Abdul Wahab ,&nbsp;Muhammad Zakiyullah Romdlony ,&nbsp;Mohamad Shukri Zainal Abidin ,&nbsp;Salinda Buyamin","doi":"10.1016/j.robot.2024.104683","DOIUrl":"10.1016/j.robot.2024.104683","url":null,"abstract":"<div><p>Flexible Manufacturing Systems (FMS) is known as one of the recurring themes that possess these promising characteristics with a synergistic combination of productivity-efficiency transport and flexibility through a number of machine tools alongside other material handling devices. In FMS, mobile robots are commonly deployed in material handling system for the purpose of increasing the efficiency and productivity of the manufacturing process. A reliable, efficient, and optimal scheduling is the most important in manufacturing system. The scheduling problems can become highly complex, especially in large-scale systems with numerous tasks and constraints. Thus, schedule optimization becomes crucial to enhance target performance by determining the best allocations and sequences of resources under specified constraints. Recently, Genetic Algorithm (GA) is a remarkably applicable search algorithm to solve scheduling problems to the way that near optimal could be found. While the performance of GA much depends on the selection of the main parameters, a standard GA may suffer from the issue of premature convergence due to the lack of control on its parameters especially crossover and mutation operators. As there is no specific method or way to tune these parameters, the algorithm is prone to converge on the local optimum, thereby leading to performance degradation. To overcome such flaw, this paper proposed an improved Genetic Algorithm using an adaptive Fuzzy Logic to control crossover and mutation operators (FGAOC) for the solution to the NP-hard problem of scheduling mobile robot within Job-Shop FMS environment. The proposed algorithm has been evaluated in several case studies such as small and large-scale problem, various numbers of mobile robots and the 40-test benchmark problem. The results have demonstrated that the proposed FGAOC has delivered a good performance in exploration-exploitation activities with better solution quality.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sequential control barrier functions for mobile robots with dynamic temporal logic specifications 具有动态时序逻辑规范的移动机器人顺序控制障碍函数
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-11 DOI: 10.1016/j.robot.2024.104681
Ali Tevfik Buyukkocak , Derya Aksaray , Yasin Yazıcıoğlu

We address a motion planning and control problem for mobile robots to satisfy rich, time-varying tasks expressed as Signal Temporal Logic (STL) specifications. The specifications may include tasks with nested temporal operators or time-conflicting requirements (e.g., achieving periodic tasks or tasks defined within the same time interval). Moreover, the tasks can be defined in locations changing with time (i.e., dynamic targets), and their future motions are not known a priori. This unpredictability requires an online control approach which motivates us to investigate the use of control barrier functions (CBFs). The proposed CBFs take into account the actuation limits of the robots and a feasible sequence of STL tasks. They define time-varying feasible sets of states the system must always stay inside. We show the feasible sequence generation process that even includes the decomposition of periodic tasks and alternative scenarios due to disjunction operators. The sequence is used to define CBFs, ensuring STL satisfaction. We also show some theoretical results on the correctness of the proposed method. We illustrate the benefits of the proposed method and analyze its performance via simulations and experiments with aerial robots.

我们要解决移动机器人的运动规划和控制问题,以满足以信号时态逻辑(STL)规范表示的丰富的时变任务。这些规范可能包括具有嵌套时间运算符或时间冲突要求的任务(例如,实现周期性任务或在同一时间间隔内定义的任务)。此外,任务可能被定义在随时间变化的位置(即动态目标)上,而其未来的运动是事先不知道的。这种不可预测性要求采用在线控制方法,这促使我们研究控制障碍函数(CBF)的使用。所提出的 CBF 考虑到了机器人的执行极限和 STL 任务的可行序列。它们定义了系统必须始终处于其中的时变可行状态集。我们展示了可行序列的生成过程,其中甚至包括周期性任务的分解和由于析取算子而产生的替代方案。该序列用于定义 CBF,确保满足 STL 要求。我们还展示了关于所提方法正确性的一些理论结果。我们说明了所提方法的优点,并通过模拟和空中机器人实验分析了该方法的性能。
{"title":"Sequential control barrier functions for mobile robots with dynamic temporal logic specifications","authors":"Ali Tevfik Buyukkocak ,&nbsp;Derya Aksaray ,&nbsp;Yasin Yazıcıoğlu","doi":"10.1016/j.robot.2024.104681","DOIUrl":"10.1016/j.robot.2024.104681","url":null,"abstract":"<div><p>We address a motion planning and control problem for mobile robots to satisfy rich, time-varying tasks expressed as Signal Temporal Logic (STL) specifications. The specifications may include tasks with nested temporal operators or time-conflicting requirements (e.g., achieving periodic tasks or tasks defined within the same time interval). Moreover, the tasks can be defined in locations changing with time (i.e., dynamic targets), and their future motions are not known a priori. This unpredictability requires an online control approach which motivates us to investigate the use of control barrier functions (CBFs). The proposed CBFs take into account the actuation limits of the robots and a feasible sequence of STL tasks. They define time-varying feasible sets of states the system must always stay inside. We show the feasible sequence generation process that even includes the decomposition of periodic tasks and alternative scenarios due to disjunction operators. The sequence is used to define CBFs, ensuring STL satisfaction. We also show some theoretical results on the correctness of the proposed method. We illustrate the benefits of the proposed method and analyze its performance via simulations and experiments with aerial robots.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards field deployment of MAVs in adaptive exploration of GPS-denied subterranean environments 在对全球定位系统失效的地下环境进行自适应探索时实地部署无人飞行器
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-06 DOI: 10.1016/j.robot.2024.104663
Akash Patel , Samuel Karlsson , Björn Lindqvist , Jakub Haluska , Christoforos Kanellakis , Ali Agha-mohammadi , George Nikolakopoulos

Exploration and safe navigation in previously unknown GPS-denied obstructed areas are major challenges for autonomous robots when deployed in subterranean environments. In response, this work establishes an Exploration-Planning framework developed for the real-world deployment of Micro Aerial Vehicles (MAVs) in subterranean exploration missions. The fundamental task for an autonomous MAV to navigate in an unknown area, is to decide where to look while navigating such that the MAV will acquire more information about the surrounding. The work presented in this article focuses around 3D exploration of large-scale caves or multi-branched tunnel like structures, while still prioritizing the Look-Ahead and Move-Forward approach for fast navigation in previously unknown areas. In order to achieve such exploration behaviour, the proposed work utilizes a two-layer navigation approach. The first layer deals with computing traversable frontiers to generate the look ahead poses in the constrained field of view, aligned with the MAV’s heading vector that leads to rapid continuous exploration. The proposed frontier distribution based switching goal selection approach allows the MAV to explore various terrains, while still regulating the MAV’s heading vector. The second layer of the proposed scheme deals with global cost based navigation of the MAV to the potential junction in a multi-branched tunnel system leading to a continuous exploration of partially seen areas. The proposed framework is a combination of a novel frontier goal selection approach, risk-aware expandable grid based path planning, nonlinear model predictive control and artificial potential fields based on local reactive navigation, obstacle avoidance, and control for the autonomous deployment of MAVs in extreme environments.

自主机器人在地下环境中部署时,在之前未知的 GPS 信号屏蔽的障碍区域进行探索和安全导航是一项重大挑战。为此,这项工作建立了一个探索规划框架,用于在地下探索任务中实际部署微型飞行器(MAV)。自主微型飞行器在未知区域导航的基本任务是决定在导航过程中向何处观察,从而使微型飞行器获得更多关于周围环境的信息。本文介绍的工作主要围绕大型洞穴或多分支隧道结构的三维探索,同时仍然优先采用 "向前看 "和 "向前走 "的方法,以便在先前未知区域快速导航。为了实现这种探索行为,提议的工作采用了双层导航方法。第一层涉及计算可穿越的前沿,以生成受限视场中的前瞻姿势,并与 MAV 的航向矢量保持一致,从而实现快速连续的探索。所提出的基于前沿分布的切换目标选择方法允许 MAV 探索各种地形,同时仍能控制 MAV 的航向矢量。拟议方案的第二层涉及基于全局成本的导航,将飞行器导航到多分支隧道系统中的潜在路口,从而对部分区域进行持续探索。所提出的框架结合了新颖的前沿目标选择方法、基于风险意识的可扩展网格路径规划和非线性模型预测控制,以及基于局部反应导航、避障和控制的人工势场,可用于 MAV 在 Sub-T 环境等极端环境中的自主部署。
{"title":"Towards field deployment of MAVs in adaptive exploration of GPS-denied subterranean environments","authors":"Akash Patel ,&nbsp;Samuel Karlsson ,&nbsp;Björn Lindqvist ,&nbsp;Jakub Haluska ,&nbsp;Christoforos Kanellakis ,&nbsp;Ali Agha-mohammadi ,&nbsp;George Nikolakopoulos","doi":"10.1016/j.robot.2024.104663","DOIUrl":"10.1016/j.robot.2024.104663","url":null,"abstract":"<div><p>Exploration and safe navigation in previously unknown GPS-denied obstructed areas are major challenges for autonomous robots when deployed in subterranean environments. In response, this work establishes an Exploration-Planning framework developed for the real-world deployment of Micro Aerial Vehicles (MAVs) in subterranean exploration missions. The fundamental task for an autonomous MAV to navigate in an unknown area, is to decide where to look while navigating such that the MAV will acquire more information about the surrounding. The work presented in this article focuses around 3D exploration of large-scale caves or multi-branched tunnel like structures, while still prioritizing the Look-Ahead and Move-Forward approach for fast navigation in previously unknown areas. In order to achieve such exploration behaviour, the proposed work utilizes a two-layer navigation approach. The first layer deals with computing traversable frontiers to generate the look ahead poses in the constrained field of view, aligned with the MAV’s heading vector that leads to rapid continuous exploration. The proposed frontier distribution based switching goal selection approach allows the MAV to explore various terrains, while still regulating the MAV’s heading vector. The second layer of the proposed scheme deals with global cost based navigation of the MAV to the potential junction in a multi-branched tunnel system leading to a continuous exploration of partially seen areas. The proposed framework is a combination of a novel frontier goal selection approach, risk-aware expandable grid based path planning, nonlinear model predictive control and artificial potential fields based on local reactive navigation, obstacle avoidance, and control for the autonomous deployment of MAVs in extreme environments.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0921889024000460/pdfft?md5=21d3ed547c71c69ba62addea9a6cf70c&pid=1-s2.0-S0921889024000460-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140055872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing lane detection with a lightweight collaborative late fusion model 利用轻量级协作式后期融合模型加强车道检测
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-05 DOI: 10.1016/j.robot.2024.104680
Lennart Lorenz Freimuth Jahn , Seongjeong Park , Yongseob Lim , Jinung An , Gyeungho Choi

Research in autonomous systems is gaining popularity both in academia and industry. These systems offer comfort, new business opportunities such as self-driving taxis, more efficient resource utilization through car-sharing, and most importantly, enhanced road safety. Different forms of Vehicle-to-Everything (V2X) communication have been under development for many years to enhance safety. Advances in wireless technologies have enabled more data transmission with lower latency, creating more possibilities for safer driving. Collaborative perception is a critical technique to address occlusion and sensor failure issues in autonomous driving. To enhance safety and efficiency, recent works have focused on sharing extracted features instead of raw data or final outputs, leading to reduced message sizes compared to raw sensor data. Reducing message size is important to enable collaborative perception to coexist with other V2X applications on bandwidth-limited communication devices.

To address this issue and significantly reduce the size of messages sent while maintaining high accuracy, we propose our model: LaCPF (Late Collaborative Perception Fusion), which uses deep learning for late fusion. We demonstrate that we can achieve better results while using only half the message size over other methods. Our late fusion framework is also independent of the local perception model, which is essential, as not all vehicles on the road will employ the same methods. Therefore LaCPF can be scaled more quickly as it is model and sensor-agnostic.

自主系统的研究在学术界和工业界都越来越受欢迎。这些系统提供了舒适性,带来了新的商机(如自动驾驶出租车),通过汽车共享提高了资源利用效率,最重要的是提高了道路安全性。为了提高安全性,多年来一直在开发不同形式的车对物(V2X)通信。无线技术的进步使更多的数据传输能够以更低的延迟进行,为更安全的驾驶创造了更多的可能性。协作感知是解决自动驾驶中闭塞和传感器故障问题的关键技术。为了提高安全性和效率,最近的工作重点是共享提取的特征,而不是原始数据或最终输出,从而缩小了与原始传感器数据相比的信息量。要使协作感知与其他 V2X 应用在带宽受限的通信设备上共存,减少信息大小非常重要。
{"title":"Enhancing lane detection with a lightweight collaborative late fusion model","authors":"Lennart Lorenz Freimuth Jahn ,&nbsp;Seongjeong Park ,&nbsp;Yongseob Lim ,&nbsp;Jinung An ,&nbsp;Gyeungho Choi","doi":"10.1016/j.robot.2024.104680","DOIUrl":"10.1016/j.robot.2024.104680","url":null,"abstract":"<div><p>Research in autonomous systems is gaining popularity both in academia and industry. These systems offer comfort, new business opportunities such as self-driving taxis, more efficient resource utilization through car-sharing, and most importantly, enhanced road safety. Different forms of Vehicle-to-Everything (V2X) communication have been under development for many years to enhance safety. Advances in wireless technologies have enabled more data transmission with lower latency, creating more possibilities for safer driving. Collaborative perception is a critical technique to address occlusion and sensor failure issues in autonomous driving. To enhance safety and efficiency, recent works have focused on sharing extracted features instead of raw data or final outputs, leading to reduced message sizes compared to raw sensor data. Reducing message size is important to enable collaborative perception to coexist with other V2X applications on bandwidth-limited communication devices.</p><p>To address this issue and significantly reduce the size of messages sent while maintaining high accuracy, we propose our model: LaCPF (<strong>La</strong>te <strong>C</strong>ollaborative <strong>P</strong>erception <strong>F</strong>usion), which uses deep learning for late fusion. We demonstrate that we can achieve better results while using only half the message size over other methods. Our late fusion framework is also independent of the local perception model, which is essential, as not all vehicles on the road will employ the same methods. Therefore LaCPF can be scaled more quickly as it is model and sensor-agnostic.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0921889024000630/pdfft?md5=4b34c6d1c46cbc9a3e260a3f133a7a4a&pid=1-s2.0-S0921889024000630-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140055767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Wiring connector-terminated cables based on manipulation planning with collision-free EMD net 基于无碰撞 EMD 网操纵规划的连接器端接电缆布线
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-02 DOI: 10.1016/j.robot.2024.104673
Kimitoshi Yamazaki , Kyoto Nozaki , Yuichiro Matsuura , Solvi Arnold

In this paper, we propose a manipulation planning method for cable wiring in the assembly of electric appliances etc. We address a scenario where a robot grasps a connector attached to the end of a cable and has to bring the connector to a socket. To accomplish this automatically, we propose a novel manipulation planning method. The method extends the Encode-Manipulate-Decode network (EMD net), which can predict shape changes of deformable objects and generate robot motion sequences for producing desired shape transitions. This enables us to find connector trajectories that avoid collision between the cable and the surrounding environment. We conducted experiments with several different cable lengths. We also introduce some functions required for real-world wiring, such as online cable shape modification. Experimental results show that the proposed method can achieve stable manipulation of real cables.

在本文中,我们提出了一种在组装电器等过程中进行电缆布线的操纵规划方法。在这种情况下,机器人需要抓取连接到电缆末端的连接器,并将连接器带到插座上。为了自动完成这一任务,我们提出了一种新颖的操纵规划方法。该方法扩展了编码-操纵-解码网络(EMD 网络),可预测可变形物体的形状变化,并生成机器人运动序列,以实现所需的形状转换。这样,我们就能找到避免电缆与周围环境发生碰撞的连接器轨迹。我们用几种不同长度的电缆进行了实验。我们还引入了现实世界布线所需的一些功能,如在线电缆形状修改。实验结果表明,所提出的方法可以实现对真实电缆的稳定操控。
{"title":"Wiring connector-terminated cables based on manipulation planning with collision-free EMD net","authors":"Kimitoshi Yamazaki ,&nbsp;Kyoto Nozaki ,&nbsp;Yuichiro Matsuura ,&nbsp;Solvi Arnold","doi":"10.1016/j.robot.2024.104673","DOIUrl":"10.1016/j.robot.2024.104673","url":null,"abstract":"<div><p>In this paper, we propose a manipulation planning method for cable wiring in the assembly of electric appliances etc. We address a scenario where a robot grasps a connector attached to the end of a cable and has to bring the connector to a socket. To accomplish this automatically, we propose a novel manipulation planning method. The method extends the Encode-Manipulate-Decode network (EMD net), which can predict shape changes of deformable objects and generate robot motion sequences for producing desired shape transitions. This enables us to find connector trajectories that avoid collision between the cable and the surrounding environment. We conducted experiments with several different cable lengths. We also introduce some functions required for real-world wiring, such as online cable shape modification. Experimental results show that the proposed method can achieve stable manipulation of real cables.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0921889024000563/pdfft?md5=87f3f8d75c29171bfeaea078bddb94da&pid=1-s2.0-S0921889024000563-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140055768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
3D human pose estimation based on 2D–3D consistency with synchronized adversarial training 基于 2D-3D 一致性和同步对抗训练的 3D 人体姿态估计
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-02 DOI: 10.1016/j.robot.2024.104677
Yicheng Deng , Cheng Sun , Yongqi Sun , Jiahui Zhu

3D human pose estimation from a single image is still a challenging problem despite the large amount of work that has been performed in this field. Generally, most methods directly use neural networks and ignore certain constraints (e.g., reprojection constraints, joint angle, and bone length constraints). While a few methods consider these constraints but train the network separately, they cannot effectively solve the depth ambiguity problem. In this paper, we propose a GAN-based model for 3D human pose estimation, in which a reprojection network is employed to learn the mapping of the distribution from 3D poses to 2D poses, and a discriminator is employed for 2D–3D consistency discrimination. We adopt a novel strategy to synchronously train the generator, the reprojection network and the discriminator. Furthermore, inspired by the typical kinematic chain space (KCS) matrix, we introduce a weighted KCS matrix and take it as one of the discriminator’s inputs to impose joint angle and bone length constraints. The experimental results on Human3.6M show that our method significantly outperforms state-of-the-art methods in most cases.

尽管在这一领域已经开展了大量工作,但从单张图像进行三维人体姿态估计仍然是一个具有挑战性的问题。一般来说,大多数方法直接使用神经网络,忽略了某些约束条件(如重投影约束条件、关节角度和骨骼长度约束条件)。虽然有少数方法考虑了这些约束条件,但对网络进行了单独训练,但它们无法有效解决深度模糊问题。在本文中,我们提出了一种基于 GAN 的三维人体姿态估计模型,其中采用重投影网络来学习三维姿态到二维姿态的分布映射,并采用判别器来进行二维到三维的一致性判别。我们采用了一种新颖的策略来同步训练生成器、重投影网络和判别器。此外,受典型运动链空间(KCS)矩阵的启发,我们引入了加权 KCS 矩阵,并将其作为判别器的输入之一,以施加关节角度和骨骼长度约束。在 Human3.6M 上的实验结果表明,我们的方法在大多数情况下都明显优于最先进的方法。
{"title":"3D human pose estimation based on 2D–3D consistency with synchronized adversarial training","authors":"Yicheng Deng ,&nbsp;Cheng Sun ,&nbsp;Yongqi Sun ,&nbsp;Jiahui Zhu","doi":"10.1016/j.robot.2024.104677","DOIUrl":"https://doi.org/10.1016/j.robot.2024.104677","url":null,"abstract":"<div><p>3D human pose estimation from a single image is still a challenging problem despite the large amount of work that has been performed in this field. Generally, most methods directly use neural networks and ignore certain constraints (<span><math><mrow><mi>e</mi><mo>.</mo><mi>g</mi><mo>.</mo></mrow></math></span>, reprojection constraints, joint angle, and bone length constraints). While a few methods consider these constraints but train the network separately, they cannot effectively solve the depth ambiguity problem. In this paper, we propose a GAN-based model for 3D human pose estimation, in which a reprojection network is employed to learn the mapping of the distribution from 3D poses to 2D poses, and a discriminator is employed for 2D–3D consistency discrimination. We adopt a novel strategy to synchronously train the generator, the reprojection network and the discriminator. Furthermore, inspired by the typical kinematic chain space (KCS) matrix, we introduce a weighted KCS matrix and take it as one of the discriminator’s inputs to impose joint angle and bone length constraints. The experimental results on Human3.6M show that our method significantly outperforms state-of-the-art methods in most cases.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140024093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel hybrid swarm intelligence algorithm for solving TSP and desired-path-based online obstacle avoidance strategy for AUV 求解 TSP 的新型混合群智能算法和基于期望路径的自动潜航器在线避障策略
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-01 DOI: 10.1016/j.robot.2024.104678
Yixiao Zhang, Yue Shen, Qi Wang, Chao Song, Ning Dai, Bo He

Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter combination through Seagull Optimization Algorithm (SOA) to strengthen ACO’s search capability. To obtain a uniform initial distribution of the ACO parameter combination, we incorporated the Kent Chaos Map (KCM) to randomly initialize the seagull’s position, reducing the tendency of SOA to fall into the local optimum. To avoid slow calculation speed and premature convergence of ACO, we improved the adaptive multi-population mechanism to reduce repeated redundant calculations and used the ϵgreedy and default strategy, respectively, to update the ants’ position. 2Opt is applied to find shorter paths in each iteration. In addition, when AUV navigates on the planned path, it may encounter obstacles. Therefore, this paper proposes an autonomous obstacle avoidance algorithm based on forward-looking sonar to ensure safety during tasks. SOA-ACO-2Opt is verified against twelve different problems extracted from TSPLIB and compared with some state-of-the-art algorithms. Furthermore, sea trials were carried out for several representative marine engineering applications of TSP and obstacle avoidance. Experimental results show that this work can significantly improve AUV’s work efficiency and intelligence and protect the AUV’s safety.

针对蚁群优化(ACO)主要受制于参数的问题,我们提出了一种混合算法SOA-ACO-2Opt,通过海鸥优化算法(SOA)优化ACO参数组合,以增强ACO的搜索能力。为了获得均匀的 ACO 参数组合初始分布,我们加入了肯特混沌图(Kent Chaos Map,KCM)来随机初始化海鸥的位置,从而降低了 SOA 陷入局部最优的倾向。为了避免 ACO 计算速度过慢和过早收敛,我们改进了自适应多群体机制,以减少重复冗余计算,并分别使用和默认策略来更新蚂蚁的位置。在每次迭代中应用 2Opt 寻找更短的路径。此外,当 AUV 按计划路径导航时,可能会遇到障碍物。因此,本文提出了一种基于前视声纳的自主避障算法,以确保执行任务时的安全。SOA-ACO-2Opt 针对从 TSPLIB 中提取的 12 个不同问题进行了验证,并与一些最先进的算法进行了比较。此外,还对 TSP 和避障的几个代表性海洋工程应用进行了海上试验。实验结果表明,这项工作可以显著提高 AUV 的工作效率和智能,并保护 AUV 的安全。
{"title":"A novel hybrid swarm intelligence algorithm for solving TSP and desired-path-based online obstacle avoidance strategy for AUV","authors":"Yixiao Zhang,&nbsp;Yue Shen,&nbsp;Qi Wang,&nbsp;Chao Song,&nbsp;Ning Dai,&nbsp;Bo He","doi":"10.1016/j.robot.2024.104678","DOIUrl":"10.1016/j.robot.2024.104678","url":null,"abstract":"<div><p>Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter combination through Seagull Optimization Algorithm (SOA) to strengthen ACO’s search capability. To obtain a uniform initial distribution of the ACO parameter combination, we incorporated the Kent Chaos Map (KCM) to randomly initialize the seagull’s position, reducing the tendency of SOA to fall into the local optimum. To avoid slow calculation speed and premature convergence of ACO, we improved the adaptive multi-population mechanism to reduce repeated redundant calculations and used the <span><math><mrow><mi>ϵ</mi><mo>−</mo><mi>g</mi><mi>r</mi><mi>e</mi><mi>e</mi><mi>d</mi><mi>y</mi></mrow></math></span> and default strategy, respectively, to update the ants’ position. 2Opt is applied to find shorter paths in each iteration. In addition, when AUV navigates on the planned path, it may encounter obstacles. Therefore, this paper proposes an autonomous obstacle avoidance algorithm based on forward-looking sonar to ensure safety during tasks. SOA-ACO-2Opt is verified against twelve different problems extracted from TSPLIB and compared with some state-of-the-art algorithms. Furthermore, sea trials were carried out for several representative marine engineering applications of TSP and obstacle avoidance. Experimental results show that this work can significantly improve AUV’s work efficiency and intelligence and protect the AUV’s safety.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140056007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Object-aware interactive perception for tabletop scene exploration 用于桌面场景探索的对象感知交互式感知技术
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-03-01 DOI: 10.1016/j.robot.2024.104674
Cagatay Koc, Sanem Sariel

Recent advancements in sensors and deep learning techniques have improved reliability of robotic perceptual systems, but current systems are not robust enough for real-world challenges such as occlusions and sensing uncertainties in cluttered scenes. To overcome these issues, active or interactive perception actions are often necessary, such as sensor repositioning or object manipulation to reveal more information about the scene. Existing perception systems lack a comprehensive approach that incorporates both active and interactive action spaces, thereby limiting the robot’s perception capabilities. Moreover, these systems focus on exploring a single object or scene, without utilizing object information to guide the exploration of multiple objects. In this work, we propose an object-aware hybrid perception system that selects the next best action by considering both active and interactive action spaces and enhances the selection process with an object-aware approach to guide the cognitive robot operating in tabletop scenarios. Novel volumetric utility metrics are used to evaluate actions that include positioning sensors from a heterogeneous set or manipulating objects to gain a better perspective of the scene. The proposed system maintains the volumetric information of the scene that includes semantic information about objects, enabling it to exploit object information, associate occlusion with corresponding objects, and make informed decisions about object manipulation. We evaluate the performance of our system both in simulated and real-world experiments using a Baxter robotic platform equipped with two arms, RGB and depth cameras. Our experimental results show that the proposed system outperforms the compared state-of-the-art methods in the given scenarios, achieving an 11.2% performance increase.

传感器和深度学习技术的最新进展提高了机器人感知系统的可靠性,但目前的系统还不足以应对现实世界中的挑战,例如遮挡和杂乱场景中的感知不确定性。为了克服这些问题,通常需要采取主动或交互式感知行动,例如重新定位传感器或操纵物体,以揭示更多场景信息。现有的感知系统缺乏一种将主动和交互式行动空间结合起来的综合方法,从而限制了机器人的感知能力。此外,这些系统侧重于探索单个物体或场景,而没有利用物体信息来指导对多个物体的探索。在这项工作中,我们提出了一种对象感知混合感知系统,该系统通过考虑主动和交互式行动空间来选择下一个最佳行动,并通过对象感知方法来增强选择过程,从而引导认知机器人在桌面场景中进行操作。新颖的体积效用指标用于评估各种行动,包括从异构集合中定位传感器或操纵物体以获得更好的场景视角。所提议的系统可维护场景的体积信息,其中包括物体的语义信息,使其能够利用物体信息,将遮挡与相应的物体联系起来,并就物体操作做出明智的决策。我们使用配备了双臂、RGB 和深度摄像头的 Baxter 机器人平台,在模拟和实际实验中对系统性能进行了评估。我们的实验结果表明,在给定的场景中,所提出的系统优于同类最先进的方法,性能提高了 11.2%。
{"title":"Object-aware interactive perception for tabletop scene exploration","authors":"Cagatay Koc,&nbsp;Sanem Sariel","doi":"10.1016/j.robot.2024.104674","DOIUrl":"10.1016/j.robot.2024.104674","url":null,"abstract":"<div><p>Recent advancements in sensors and deep learning techniques have improved reliability of robotic perceptual systems, but current systems are not robust enough for real-world challenges such as occlusions and sensing uncertainties in cluttered scenes. To overcome these issues, active or interactive perception actions are often necessary, such as sensor repositioning or object manipulation to reveal more information about the scene. Existing perception systems lack a comprehensive approach that incorporates both active and interactive action spaces, thereby limiting the robot’s perception capabilities. Moreover, these systems focus on exploring a single object or scene, without utilizing object information to guide the exploration of multiple objects. In this work, we propose an object-aware hybrid perception system that selects the next best action by considering both active and interactive action spaces and enhances the selection process with an object-aware approach to guide the cognitive robot operating in tabletop scenarios. Novel volumetric utility metrics are used to evaluate actions that include positioning sensors from a heterogeneous set or manipulating objects to gain a better perspective of the scene. The proposed system maintains the volumetric information of the scene that includes semantic information about objects, enabling it to exploit object information, associate occlusion with corresponding objects, and make informed decisions about object manipulation. We evaluate the performance of our system both in simulated and real-world experiments using a Baxter robotic platform equipped with two arms, RGB and depth cameras. Our experimental results show that the proposed system outperforms the compared state-of-the-art methods in the given scenarios, achieving an 11.2% performance increase.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140056229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Direct trajectory optimization of macro-micro robotic system using a Gauss pseudospectral framework 利用高斯伪谱框架直接优化宏微型机器人系统的轨迹
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-02-29 DOI: 10.1016/j.robot.2024.104676
Yaohua Zhou , Chin-Yin Chen , Guilin Yang , Chi Zhang

Trajectory planning is a crucial aspect of macro-micro robotic systems (MMRSs), especially when the system has high degrees of freedom (DOFs). In the field of robotic polishing, the MMRS is usually composed of an industrial robot and an end-effector, which is responsible for polishing force control. Therefore, the compliance of the macro-robot can be minimized by trajectory planning to reduce its impact on the micro-robot. This study proposes a trajectory planning strategy based on Gauss pseudospectral method for a 9-DOF MMRS. Different from traditional sequential solution strategies, it can be used to obtain an approximate global optimal trajectory. Firstly, the velocity-level kinematics model of MMRS is built, which comprehensively considers the workpiece placement pose and task redundancy. Secondly, an optimal control model for trajectory planning is developed through an effective variable allocation. On the premise of considering traditional trajectory smoothness constraints, a constraint on manipulability is additionally analyzed to avoid reaching a singular configuration during compliance optimization. Thirdly, a Gauss pseudospectral framework based on the optimal control model is proposed, and the costate mapping theorem is proved. The latter provides a theoretical basis for the efficiency and accuracy of the proposed method. Finally, comparison results demonstrate the effectiveness of the proposed method.

轨迹规划是宏微型机器人系统(MMRS)的一个重要方面,尤其是当系统具有高自由度(DOFs)时。在机器人抛光领域,MMRS 通常由工业机器人和负责抛光力控制的末端执行器组成。因此,可以通过轨迹规划将宏观机器人的顺应性降至最低,以减少其对微型机器人的影响。本研究针对 9-DOF MMRS 提出了一种基于高斯伪谱法的轨迹规划策略。与传统的顺序求解策略不同,该策略可用于获得近似的全局最优轨迹。首先,建立 MMRS 的速度级运动学模型,全面考虑工件摆放姿势和任务冗余。其次,通过有效的变量分配,建立了用于轨迹规划的最优控制模型。在考虑传统轨迹平滑性约束的前提下,额外分析了可操控性约束,以避免在顺应性优化过程中达到奇异配置。第三,提出了基于最优控制模型的高斯伪谱框架,并证明了成本映射定理。后者为所提方法的效率和准确性提供了理论依据。最后,对比结果证明了所提方法的有效性。
{"title":"Direct trajectory optimization of macro-micro robotic system using a Gauss pseudospectral framework","authors":"Yaohua Zhou ,&nbsp;Chin-Yin Chen ,&nbsp;Guilin Yang ,&nbsp;Chi Zhang","doi":"10.1016/j.robot.2024.104676","DOIUrl":"https://doi.org/10.1016/j.robot.2024.104676","url":null,"abstract":"<div><p>Trajectory planning is a crucial aspect of macro-micro robotic systems (MMRSs), especially when the system has high degrees of freedom (DOFs). In the field of robotic polishing, the MMRS is usually composed of an industrial robot and an end-effector, which is responsible for polishing force control. Therefore, the compliance of the macro-robot can be minimized by trajectory planning to reduce its impact on the micro-robot. This study proposes a trajectory planning strategy based on Gauss pseudospectral method for a 9-DOF MMRS. Different from traditional sequential solution strategies, it can be used to obtain an approximate global optimal trajectory. Firstly, the velocity-level kinematics model of MMRS is built, which comprehensively considers the workpiece placement pose and task redundancy. Secondly, an optimal control model for trajectory planning is developed through an effective variable allocation. On the premise of considering traditional trajectory smoothness constraints, a constraint on manipulability is additionally analyzed to avoid reaching a singular configuration during compliance optimization. Thirdly, a Gauss pseudospectral framework based on the optimal control model is proposed, and the costate mapping theorem is proved. The latter provides a theoretical basis for the efficiency and accuracy of the proposed method. Finally, comparison results demonstrate the effectiveness of the proposed method.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A fast and stable GNSS-LiDAR-inertial state estimator from coarse to fine by iterated error-state Kalman filter 通过迭代误差状态卡尔曼滤波器实现从粗到精的快速稳定 GNSS-LiDAR 惯性状态估计器
IF 4.3 2区 计算机科学 Q1 Mathematics Pub Date : 2024-02-28 DOI: 10.1016/j.robot.2024.104675
Jixin Gao , Jianjun Sha , Yanheng Wang , Xiangwei Wang , Cong Tan

Simultaneous localization and mapping (SLAM) aims to solve the problems of robot localization and mapping in unknown environments. Recent related research usually uses closed-loop correction or integrate GNSS (Global Navigation Satellite System) into the optimization framework to ensure the long-term system accuracy and stability at the cost of huge computational resources. To balance efficiency and accuracy, this paper presents a fast and stable GNSS-LiDAR-inertial state estimator: GNSS, LiDAR and IMU are fused to achieve state estimation from coarse to fine, thereby improving the system accuracy and stability; the overall framework based on iterated error-state Kalman filter makes our system faster than most multi-sensor fusion SLAM. We also design a fast GNSS online initialization method and a multi-layer outlier rejection mechanism for our system. In addition, we apply backward propagation for multi-sensor motion compensation to overcome the limitations of fast motion. Finally, comprehensive experiments demonstrate that our system achieves higher accuracy and computational efficiency than the state-of-the-art navigation systems on the latest challenging public datasets, and perform equally well in the real environment.

同步定位与绘图(SLAM)旨在解决机器人在未知环境中的定位与绘图问题。近期的相关研究通常采用闭环校正或将全球导航卫星系统(GNSS)纳入优化框架,以巨大的计算资源为代价确保系统的长期精度和稳定性。为了兼顾效率和精度,本文提出了一种快速稳定的 GNSS-LiDAR 惯性状态估计器:通过融合 GNSS、LiDAR 和 IMU,实现了从粗到细的状态估计,从而提高了系统精度和稳定性;基于迭代误差状态卡尔曼滤波器的整体框架使我们的系统比大多数多传感器融合 SLAM 更快。我们还为系统设计了快速 GNSS 在线初始化方法和多层离群点剔除机制。此外,我们还将后向传播用于多传感器运动补偿,以克服快速运动的限制。最后,综合实验证明,我们的系统在最新的具有挑战性的公共数据集上实现了比最先进导航系统更高的精度和计算效率,并且在真实环境中表现同样出色。
{"title":"A fast and stable GNSS-LiDAR-inertial state estimator from coarse to fine by iterated error-state Kalman filter","authors":"Jixin Gao ,&nbsp;Jianjun Sha ,&nbsp;Yanheng Wang ,&nbsp;Xiangwei Wang ,&nbsp;Cong Tan","doi":"10.1016/j.robot.2024.104675","DOIUrl":"10.1016/j.robot.2024.104675","url":null,"abstract":"<div><p>Simultaneous localization and mapping (SLAM) aims to solve the problems of robot localization and mapping in unknown environments. Recent related research usually uses closed-loop correction or integrate GNSS (Global Navigation Satellite System) into the optimization framework to ensure the long-term system accuracy and stability at the cost of huge computational resources. To balance efficiency and accuracy, this paper presents a fast and stable GNSS-LiDAR-inertial state estimator: GNSS, LiDAR and IMU are fused to achieve state estimation from coarse to fine, thereby improving the system accuracy and stability; the overall framework based on iterated error-state Kalman filter makes our system faster than most multi-sensor fusion SLAM. We also design a fast GNSS online initialization method and a multi-layer outlier rejection mechanism for our system. In addition, we apply backward propagation for multi-sensor motion compensation to overcome the limitations of fast motion. Finally, comprehensive experiments demonstrate that our system achieves higher accuracy and computational efficiency than the state-of-the-art navigation systems on the latest challenging public datasets, and perform equally well in the real environment.</p></div>","PeriodicalId":49592,"journal":{"name":"Robotics and Autonomous Systems","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140006937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Robotics and Autonomous Systems
全部 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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1