Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms ...Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms have achieved good results in many planning tasks.However,sampling-based methods have the inherent defect of having difficultly in solving planning problems with narrow passages.Therefore,several algorithms have been proposed to overcome these drawbacks.As one of the improved algorithms,Rapidlyexploring random vines(RRV)can achieve better results,but it may perform worse in cluttered environments and has a certain environmental selectivity.In this paper,we present a new improved planning method based on RRT-Connect and RRV,named adaptive RRT-Connect(ARRT-Connect),which deals well with the narrow passage environments while retaining the ability of RRT algorithms to plan paths in other environments.The proposed planner is shown to be adaptable to a variety of environments and can accomplish path planning in a short time.展开更多
Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base locat...Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base location.A new method is presented to optimize the base placement of manipulators through motion planning optimization and location optimization in the feasible area for manipulators.Firstly,research problems and contents are outlined.And then the feasible area for the manipulator base installation is discussed.Next,index depended on the joint movements and used to evaluate the kinematic performance of manipulators is defined.Although the mentioned indices in last section are regarded as the cost function of the latter,rapidly-exploring random tree(RRT) and rapidly-exploring random tree*(RRT*) algorithms are analyzed.And then,the proposed optimization method of manipulator base placement is studied by means of simulation research based on kinematic performance criteria.Finally,the conclusions could be proved effective from the simulation results.展开更多
The quality of hot-rolled steel strip is directly affected by the strip crown.Traditional machine learning models have shown limitations in accurately predicting the strip crown,particularly when dealing with imbalanc...The quality of hot-rolled steel strip is directly affected by the strip crown.Traditional machine learning models have shown limitations in accurately predicting the strip crown,particularly when dealing with imbalanced data.This limitation results in poor production quality and efficiency,leading to increased production costs.Thus,a novel strip crown prediction model that uses the Boruta and extremely randomized trees(Boruta-ERT)algorithms to address this issue was proposed.To improve the accuracy of our model,we utilized the synthetic minority over-sampling technique to balance the imbalance data sets.The Boruta-ERT prediction model was then used to select features and predict the strip crown.With the 2160 mm hot rolling production lines of a steel plant serving as the research object,the experimental results showed that 97.01% of prediction data have an absolute error of less than 8 lm.This level of accuracy met the control requirements for strip crown and demonstrated significant benefits for the improvement in production quality of steel strip.展开更多
To guide an unmanned aerial vehicle(UAV)flying in complex three-dimensional(3D)environments with unknown obstacles,a novel UAV path planning algorithm named IRRT^(∗)-C2TD3 is proposed.The algorithm combines the rapidl...To guide an unmanned aerial vehicle(UAV)flying in complex three-dimensional(3D)environments with unknown obstacles,a novel UAV path planning algorithm named IRRT^(∗)-C2TD3 is proposed.The algorithm combines the rapidly-exploring random tree star(RRT^(∗))algorithm with the twin delayed deep deterministic policy gradients(TD3)algorithm(a deep reinforcement learning algorithm).By employing exploration strategies from reinforcement learning,IRRT^(∗)-C2TD3 improves the RRT^(∗)algorithm.IRRT^(∗)-C2TD3 is a two-stage path planning algorithm comprising pre-planning and real-time planning.It performs pre-planning of paths by generating paths based on geometric connections toward the goal and smoothing them using cubic B-spline curves.By designing the network architecture and reward function of the TD3 algorithm,real-time planning in unknown environments is achieved based on the pre-planned path from the first stage.Simulation results show that IRRT^(∗)-C2TD3 demonstrates better path planning performance in 3D partially unknown environments than RRT^(∗)-C2TD3,M-C2TD3 and MODRRT^(∗)algorithms.展开更多
In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is intr...In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is introduced to reduce the randomness of the RRT^(*)algorithm,and then the initial path planning is carried out in a static environment.Secondly,apply the path in a dynamic environment,and use the initially planned path as the path cache.When a new obstacle appears in the path,the invalid path is clipped and the path is replanned.At this time,there is a certain probability to select the point in the path cache as the new node,so that the new path maintains the trend of the original path to a greater extent.Finally,MATLAB is used to carry out simulation experiments for the initial planning and replanning algorithms,respectively.More specifically,compared with the original RRT^(*)algorithm,the simulation results show that the number of nodes used by the new improved algorithm is reduced by 43.19%on average.展开更多
This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapi...This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.展开更多
Credit card fraud is a wide-ranging issue for financial institutions, involving theft and fraud committed using a payment card. In this paper, we explore the application of linear and nonlinear statistical modeling an...Credit card fraud is a wide-ranging issue for financial institutions, involving theft and fraud committed using a payment card. In this paper, we explore the application of linear and nonlinear statistical modeling and machine learning models on real credit card transaction data. The models built are supervised fraud models that attempt to identify which transactions are most likely fraudulent. We discuss the processes of data exploration, data cleaning, variable creation, feature selection, model algorithms, and results. Five different supervised models are explored and compared including logistic regression, neural networks, random forest, boosted tree and support vector machines. The boosted tree model shows the best fraud detection result (FDR = 49.83%) for this particular data set. The resulting model can be utilized in a credit card fraud detection system. A similar model development process can be performed in related business domains such as insurance and telecommunications, to avoid or detect fraudulent activity.展开更多
针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权...针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权值系数,提高随机树扩展的导向性和灵活性;同时采用局部节点过滤机制,过滤局部区域内聚集的节点;最后,使用节点直连策略对初始路径进行优化处理。仿真实验的结果表明,改进的RRT算法规划路径的速度更快且生成的路径质量更高,充分证明了改进算法的有效可行性。展开更多
针对传统RRT(Rapidly-exploring Random Tree)算法在进行机械臂路径规划时存在的采样随机性过大、搜索效率低下、所规划的路径曲折等问题,提出一种基于采样区域限制的改进RRT(Sampling Area Restriction RRT,SAR-RRT)算法。首先,针对随...针对传统RRT(Rapidly-exploring Random Tree)算法在进行机械臂路径规划时存在的采样随机性过大、搜索效率低下、所规划的路径曲折等问题,提出一种基于采样区域限制的改进RRT(Sampling Area Restriction RRT,SAR-RRT)算法。首先,针对随机性过大的问题,通过引入目标偏置策略来增强随机树的目标导向性,并采用球形采样区域以及角度限制策略对算法的采样进行约束,减少算法对无用空间区域的探索。其次,为提升算法的搜索效率,对随机树的节点扩展进行自适应优化,采用多步长扩展,使算法能够充分利用环境与障碍物的信息,同时利用贪婪思想加快随机树的收敛从而缩短路径的生成时间。最后,对初始规划出的路径进行二次优化处理,在去除路径中的冗余点后以三次B样条曲线对路径进行平滑处理,提升所规划路径的质量。实验结果表明,在2维及3维场景下,SAR-RRT算法均可以顺利完成路径规划任务。对比传统RRT算法,改进算法总体上使路径长度降低27.73%,规划时间缩短85.25%,采样点数减少87.19%且所生成的路径更加平滑。展开更多
基金supported in part by the National Science Foundation of China(61976175,91648208)the Key Project of Natural Science Basic Research Plan in Shaanxi Province of China(2019JZ-05)。
文摘Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms have achieved good results in many planning tasks.However,sampling-based methods have the inherent defect of having difficultly in solving planning problems with narrow passages.Therefore,several algorithms have been proposed to overcome these drawbacks.As one of the improved algorithms,Rapidlyexploring random vines(RRV)can achieve better results,but it may perform worse in cluttered environments and has a certain environmental selectivity.In this paper,we present a new improved planning method based on RRT-Connect and RRV,named adaptive RRT-Connect(ARRT-Connect),which deals well with the narrow passage environments while retaining the ability of RRT algorithms to plan paths in other environments.The proposed planner is shown to be adaptable to a variety of environments and can accomplish path planning in a short time.
基金Supported by the National Science and Technology Support Program of China(No.2013BAK03B01)
文摘Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base location.A new method is presented to optimize the base placement of manipulators through motion planning optimization and location optimization in the feasible area for manipulators.Firstly,research problems and contents are outlined.And then the feasible area for the manipulator base installation is discussed.Next,index depended on the joint movements and used to evaluate the kinematic performance of manipulators is defined.Although the mentioned indices in last section are regarded as the cost function of the latter,rapidly-exploring random tree(RRT) and rapidly-exploring random tree*(RRT*) algorithms are analyzed.And then,the proposed optimization method of manipulator base placement is studied by means of simulation research based on kinematic performance criteria.Finally,the conclusions could be proved effective from the simulation results.
基金supported by the National Natural Science Foundation of China(Grant Nos.52074085,U21A20117 and U21A20475)the Fundamental Research Funds for the Central Universities(Grant No.N2004010)the Liaoning Revitalization Talents Program(XLYC1907065).
文摘The quality of hot-rolled steel strip is directly affected by the strip crown.Traditional machine learning models have shown limitations in accurately predicting the strip crown,particularly when dealing with imbalanced data.This limitation results in poor production quality and efficiency,leading to increased production costs.Thus,a novel strip crown prediction model that uses the Boruta and extremely randomized trees(Boruta-ERT)algorithms to address this issue was proposed.To improve the accuracy of our model,we utilized the synthetic minority over-sampling technique to balance the imbalance data sets.The Boruta-ERT prediction model was then used to select features and predict the strip crown.With the 2160 mm hot rolling production lines of a steel plant serving as the research object,the experimental results showed that 97.01% of prediction data have an absolute error of less than 8 lm.This level of accuracy met the control requirements for strip crown and demonstrated significant benefits for the improvement in production quality of steel strip.
基金National Natural Science Foundation of China(No.62173084)Foundation of Shanghai Committee of Science and Technology,China(Nos.23ZR1401800 and 22JC1401403)。
文摘To guide an unmanned aerial vehicle(UAV)flying in complex three-dimensional(3D)environments with unknown obstacles,a novel UAV path planning algorithm named IRRT^(∗)-C2TD3 is proposed.The algorithm combines the rapidly-exploring random tree star(RRT^(∗))algorithm with the twin delayed deep deterministic policy gradients(TD3)algorithm(a deep reinforcement learning algorithm).By employing exploration strategies from reinforcement learning,IRRT^(∗)-C2TD3 improves the RRT^(∗)algorithm.IRRT^(∗)-C2TD3 is a two-stage path planning algorithm comprising pre-planning and real-time planning.It performs pre-planning of paths by generating paths based on geometric connections toward the goal and smoothing them using cubic B-spline curves.By designing the network architecture and reward function of the TD3 algorithm,real-time planning in unknown environments is achieved based on the pre-planned path from the first stage.Simulation results show that IRRT^(∗)-C2TD3 demonstrates better path planning performance in 3D partially unknown environments than RRT^(∗)-C2TD3,M-C2TD3 and MODRRT^(∗)algorithms.
基金National Natural Science Foundation of China(No.61903291)。
文摘In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is introduced to reduce the randomness of the RRT^(*)algorithm,and then the initial path planning is carried out in a static environment.Secondly,apply the path in a dynamic environment,and use the initially planned path as the path cache.When a new obstacle appears in the path,the invalid path is clipped and the path is replanned.At this time,there is a certain probability to select the point in the path cache as the new node,so that the new path maintains the trend of the original path to a greater extent.Finally,MATLAB is used to carry out simulation experiments for the initial planning and replanning algorithms,respectively.More specifically,compared with the original RRT^(*)algorithm,the simulation results show that the number of nodes used by the new improved algorithm is reduced by 43.19%on average.
基金the National Natural Science Foundation of China(Grant No.42274119)the Liaoning Revitalization Talents Program(Grant No.XLYC2002082)+1 种基金National Key Research and Development Plan Key Special Projects of Science and Technology Military Civil Integration(Grant No.2022YFF1400500)the Key Project of Science and Technology Commission of the Central Military Commission.
文摘This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.
文摘Credit card fraud is a wide-ranging issue for financial institutions, involving theft and fraud committed using a payment card. In this paper, we explore the application of linear and nonlinear statistical modeling and machine learning models on real credit card transaction data. The models built are supervised fraud models that attempt to identify which transactions are most likely fraudulent. We discuss the processes of data exploration, data cleaning, variable creation, feature selection, model algorithms, and results. Five different supervised models are explored and compared including logistic regression, neural networks, random forest, boosted tree and support vector machines. The boosted tree model shows the best fraud detection result (FDR = 49.83%) for this particular data set. The resulting model can be utilized in a credit card fraud detection system. A similar model development process can be performed in related business domains such as insurance and telecommunications, to avoid or detect fraudulent activity.
文摘针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权值系数,提高随机树扩展的导向性和灵活性;同时采用局部节点过滤机制,过滤局部区域内聚集的节点;最后,使用节点直连策略对初始路径进行优化处理。仿真实验的结果表明,改进的RRT算法规划路径的速度更快且生成的路径质量更高,充分证明了改进算法的有效可行性。
文摘针对传统RRT(Rapidly-exploring Random Tree)算法在进行机械臂路径规划时存在的采样随机性过大、搜索效率低下、所规划的路径曲折等问题,提出一种基于采样区域限制的改进RRT(Sampling Area Restriction RRT,SAR-RRT)算法。首先,针对随机性过大的问题,通过引入目标偏置策略来增强随机树的目标导向性,并采用球形采样区域以及角度限制策略对算法的采样进行约束,减少算法对无用空间区域的探索。其次,为提升算法的搜索效率,对随机树的节点扩展进行自适应优化,采用多步长扩展,使算法能够充分利用环境与障碍物的信息,同时利用贪婪思想加快随机树的收敛从而缩短路径的生成时间。最后,对初始规划出的路径进行二次优化处理,在去除路径中的冗余点后以三次B样条曲线对路径进行平滑处理,提升所规划路径的质量。实验结果表明,在2维及3维场景下,SAR-RRT算法均可以顺利完成路径规划任务。对比传统RRT算法,改进算法总体上使路径长度降低27.73%,规划时间缩短85.25%,采样点数减少87.19%且所生成的路径更加平滑。
