This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated ...This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated with multi-UAV collaborative trajectory planning in intricate battlefield environments.Initially,a collaborative planning cost function for the multi-UAV system is formulated,thereby converting the trajectory planning challenge into an optimization problem.Building on the foundational dung beetle optimization(DBO)algorithm,BFDBO incorporates three significant innovations:a boundary reflection mechanism,an adaptive mixed exploration strategy,and a dynamic multi-scale mutation strategy.These enhancements are intended to optimize the equilibrium between local exploration and global exploitation,facilitating the discovery of globally optimal trajectories thatminimize the cost function.Numerical simulations utilizing the CEC2022 benchmark function indicate that all three enhancements of BFDBOpositively influence its performance,resulting in accelerated convergence and improved optimization accuracy relative to leading optimization algorithms.In two battlefield scenarios of varying complexities,BFDBO achieved a minimum of a 39% reduction in total trajectory planning costs when compared to DBO and three other highperformance variants,while also demonstrating superior average runtime.This evidence underscores the effectiveness and applicability of BFDBO in practical,real-world contexts.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-ob...Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm(INSGA-II)is proposed.Trajectory function is planned with a new composite polynomial that by combining of quintic polynomials with cubic Bezier curves.Then,an INSGA-II,by introducing three genetic operators:ranking group selection(RGS),direction-based crossover(DBX)and adaptive precision-controllable mutation(APCM),is developed to optimize travelling time and torque fluctuation.Inverted generational distance,hypervolume and optimizer overhead are selected to evaluate the convergence,diversity and computational effort of algorithms.The optimal solution is determined via fuzzy comprehensive evaluation to obtain the optimal trajectory.Taking a serial-parallel hybrid manipulator as instance,the velocity and acceleration profiles obtained using this composite polynomial are compared with those obtained using a quintic B-spline method.The effectiveness and practicability of the proposed method are verified by simulation results.This research proposes a trajectory optimization method which can offer a better solution with efficiency and stability for a point-to-point task of robot manipulators.展开更多
Under the demand of strategic air traffic flow management and the concept of trajectory based operations（TBO）,the network-wide 4D flight trajectories planning（N4DFTP） problem has been investigated with the purpose...Under the demand of strategic air traffic flow management and the concept of trajectory based operations（TBO）,the network-wide 4D flight trajectories planning（N4DFTP） problem has been investigated with the purpose of safely and efficiently allocating 4D trajectories（4DTs）（3D position and time） for all the flights in the whole airway network.Considering that the introduction of large-scale 4DTs inevitably increases the problem complexity,an efficient model for strategiclevel conflict management is developed in this paper.Specifically,a bi-objective N4 DFTP problem that aims to minimize both potential conflicts and the trajectory cost is formulated.In consideration of the large-scale,high-complexity,and multi-objective characteristics of the N4DFTP problem,a multi-objective multi-memetic algorithm（MOMMA） that incorporates an evolutionary global search framework together with three problem-specific local search operators is implemented.It is capable of rapidly and effectively allocating 4DTs via rerouting,target time controlling,and flight level changing.Additionally,to balance the ability of exploitation and exploration of the algorithm,a special hybridization scheme is adopted for the integration of local and global search.Empirical studies using real air traffic data in China with different network complexities show that the proposed MOMMA is effective to solve the N4 DFTP problem.The solutions achieved are competitive for elaborate decision support under a TBO environment.展开更多
The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is propo...The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is proposed. IBA has two steps. The first step is the 1 stknot point planning under lower set position accuracy; the second step is the 2nd knot pointplanning that inherits the results of the 1st planning under higher set position accuracy. Thesimulation results reveal that the number of inverse kinematical calculation (IKC) caused by IBA isdecreased compared with BA. IBA is more efficient to plan knot points.展开更多
This paper investiga tes a trajectory planning algorithm to reduce the manipulator’s working time.A t ime-optimal trajectory planning(TOTP)is conducted based on improved ad aptive genetic algorithm(IAGA)and combined ...This paper investiga tes a trajectory planning algorithm to reduce the manipulator’s working time.A t ime-optimal trajectory planning(TOTP)is conducted based on improved ad aptive genetic algorithm(IAGA)and combined with cubic triangular Bezier spline(CTBS).The CTBS based trajectory planning we did before can achieve continuous second and third derivation,hence it meets the stability requirements of the m anipulator.The working time can be greatly reduced by applying IAGA to the puma 560 trajectory planning when considering physical constraints such as angular ve locity,angular acceleration and jerk.Simulation experiments in both Matlab and ADAMS illustrate that TOTP based on IAGA can give a time optimal result with sm oothness and stability.展开更多
This paper presents a novel general method for computing optimal motions of an industrial robot manipulator （AdeptOne XL robot） in the presence of fixed and oscillating obstacles. The optimization model considers th...This paper presents a novel general method for computing optimal motions of an industrial robot manipulator （AdeptOne XL robot） in the presence of fixed and oscillating obstacles. The optimization model considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacle avoidance. The problem has 6 objective functions, 88 variables, and 21 constraints. Two evolutionary algorithms, namely, elitist non-dominated sorting genetic algorithm （NSGA-II） and multi-objective differential evolution （MODE）, have been used for the optimization. Two methods （normalized weighting objective functions and average fitness factor） are used to select the best solution tradeoffs. Two multi-objective performance measures, namely solution spread measure and ratio of non-dominated individuals, are used to evaluate the Pareto optimal fronts. Two multi-objective performance measures, namely, optimizer overhead and algorithm effort, are used to find the computational effort of the optimization algorithm. The trajectories are defined by B-spline functions. The results obtained from NSGA-II and MODE are compared and analyzed.展开更多
This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based...This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based on the communication and memory characteristics of particle swarm optimization(PSO). IGSA technique is incorporated into the multi-robot system in a dynamic framework, which will provide robust performance, self-deterministic cooperation, and coping with an inhospitable environment. The robots in the team make independent decisions, coordinate, and cooperate with each other to accomplish a common goal using the developed IGSA. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position in the proposed environment. Finally, the analytical and experimental results of the multi-robot path planning were compared with those obtained by IGSA, GSA and differential evolution(DE) in a similar environment. The simulation and the Khepera environment result show outperforms of IGSA as compared to GSA and DE with respect to the average total trajectory path deviation, average uncovered trajectory target distance and energy optimization in terms of rotation.展开更多
Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the ...Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.展开更多
Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a ki...Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.展开更多
In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional R...In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.展开更多
巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(...巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(grey wolf optimizer, GWO)算法的掘进机断面成形轨迹规划方法。首先,根据夹矸位置将待截割断面环境分为4种情况,对相应断面进行栅格化处理并建立栅格地图,同时采用二值膨胀法对不规则夹矸进行膨胀化处理。然后,对GWO算法进行了改进,以提升其寻优性能和收敛速度。接着,开展了仿真实验,利用改进GWO算法实现了4种环境下掘进机断面成形轨迹的规划。最后,利用掘进机样机开展了断面截割实验。仿真结果表明:相较于传统的GWO算法,改进GWO算法的收敛速度更快且收敛精度更高;在4种断面环境下,基于改进GWO算法规划的断面成形轨迹长度最短,欠挖面积最小,转向次数最少,更容易实现高精度、高效率的轨迹跟踪控制,保证了巷道断面的成形质量。实验结果表明,基于改进GWO算法规划的断面成形轨迹既能提高掘进机的截割效率,又能满足巷道断面成形的质量要求。研究结果可为煤矿井下智能掘进技术的发展提供新的思路和方法。展开更多
基金funded by the National Defense Science and Technology Innovation project,grant number ZZKY20223103the Basic Frontier InnovationProject at the Engineering University of PAP,grant number WJY202429+2 种基金the Basic Frontier lnnovation Project at the Engineering University of PAP,grant number WJY202408the Graduate Student Funding Priority Project,grant number JYWJ2024B006Key project of National Social Science Foundation,grant number 2023-SKJJ-A-116.
文摘This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated with multi-UAV collaborative trajectory planning in intricate battlefield environments.Initially,a collaborative planning cost function for the multi-UAV system is formulated,thereby converting the trajectory planning challenge into an optimization problem.Building on the foundational dung beetle optimization(DBO)algorithm,BFDBO incorporates three significant innovations:a boundary reflection mechanism,an adaptive mixed exploration strategy,and a dynamic multi-scale mutation strategy.These enhancements are intended to optimize the equilibrium between local exploration and global exploitation,facilitating the discovery of globally optimal trajectories thatminimize the cost function.Numerical simulations utilizing the CEC2022 benchmark function indicate that all three enhancements of BFDBOpositively influence its performance,resulting in accelerated convergence and improved optimization accuracy relative to leading optimization algorithms.In two battlefield scenarios of varying complexities,BFDBO achieved a minimum of a 39% reduction in total trajectory planning costs when compared to DBO and three other highperformance variants,while also demonstrating superior average runtime.This evidence underscores the effectiveness and applicability of BFDBO in practical,real-world contexts.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
基金Supported by the Zhejiang Provincial Natural Science Foundation for Distinguished Young Scientists(Grant No.LR18E050003)the National Natural Science Foundation of China(Grant Nos.51975523,51905481)+2 种基金Natural Science Foundation of Zhejiang Province(Grant No.LY22E050012)the Students in Zhejiang Province Science and Technology Innovation Plan(Xinmiao Talents Program)(Grant No.2020R403054)the China Postdoctoral Science Foundation(Grant No.2020M671784)。
文摘Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm(INSGA-II)is proposed.Trajectory function is planned with a new composite polynomial that by combining of quintic polynomials with cubic Bezier curves.Then,an INSGA-II,by introducing three genetic operators:ranking group selection(RGS),direction-based crossover(DBX)and adaptive precision-controllable mutation(APCM),is developed to optimize travelling time and torque fluctuation.Inverted generational distance,hypervolume and optimizer overhead are selected to evaluate the convergence,diversity and computational effort of algorithms.The optimal solution is determined via fuzzy comprehensive evaluation to obtain the optimal trajectory.Taking a serial-parallel hybrid manipulator as instance,the velocity and acceleration profiles obtained using this composite polynomial are compared with those obtained using a quintic B-spline method.The effectiveness and practicability of the proposed method are verified by simulation results.This research proposes a trajectory optimization method which can offer a better solution with efficiency and stability for a point-to-point task of robot manipulators.
基金co-supported by the National Science Foundation for Young Scientists of China(No.61401011)the National Key Technologies R&D Program of China(No.2015BAG15B01)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(No.61521091)
文摘Under the demand of strategic air traffic flow management and the concept of trajectory based operations（TBO）,the network-wide 4D flight trajectories planning（N4DFTP） problem has been investigated with the purpose of safely and efficiently allocating 4D trajectories（4DTs）（3D position and time） for all the flights in the whole airway network.Considering that the introduction of large-scale 4DTs inevitably increases the problem complexity,an efficient model for strategiclevel conflict management is developed in this paper.Specifically,a bi-objective N4 DFTP problem that aims to minimize both potential conflicts and the trajectory cost is formulated.In consideration of the large-scale,high-complexity,and multi-objective characteristics of the N4DFTP problem,a multi-objective multi-memetic algorithm（MOMMA） that incorporates an evolutionary global search framework together with three problem-specific local search operators is implemented.It is capable of rapidly and effectively allocating 4DTs via rerouting,target time controlling,and flight level changing.Additionally,to balance the ability of exploitation and exploration of the algorithm,a special hybridization scheme is adopted for the integration of local and global search.Empirical studies using real air traffic data in China with different network complexities show that the proposed MOMMA is effective to solve the N4 DFTP problem.The solutions achieved are competitive for elaborate decision support under a TBO environment.
基金This project is supported by National 863 Hi-tech Foundation of China(No. 2001AA422210).
文摘The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is proposed. IBA has two steps. The first step is the 1 stknot point planning under lower set position accuracy; the second step is the 2nd knot pointplanning that inherits the results of the 1st planning under higher set position accuracy. Thesimulation results reveal that the number of inverse kinematical calculation (IKC) caused by IBA isdecreased compared with BA. IBA is more efficient to plan knot points.
基金Fund of Taishan Scholar in Shandong Province,Shandong University of Science and Technology Research Fund(No.2010KYTD101)
文摘This paper investiga tes a trajectory planning algorithm to reduce the manipulator’s working time.A t ime-optimal trajectory planning(TOTP)is conducted based on improved ad aptive genetic algorithm(IAGA)and combined with cubic triangular Bezier spline(CTBS).The CTBS based trajectory planning we did before can achieve continuous second and third derivation,hence it meets the stability requirements of the m anipulator.The working time can be greatly reduced by applying IAGA to the puma 560 trajectory planning when considering physical constraints such as angular ve locity,angular acceleration and jerk.Simulation experiments in both Matlab and ADAMS illustrate that TOTP based on IAGA can give a time optimal result with sm oothness and stability.
文摘This paper presents a novel general method for computing optimal motions of an industrial robot manipulator （AdeptOne XL robot） in the presence of fixed and oscillating obstacles. The optimization model considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacle avoidance. The problem has 6 objective functions, 88 variables, and 21 constraints. Two evolutionary algorithms, namely, elitist non-dominated sorting genetic algorithm （NSGA-II） and multi-objective differential evolution （MODE）, have been used for the optimization. Two methods （normalized weighting objective functions and average fitness factor） are used to select the best solution tradeoffs. Two multi-objective performance measures, namely solution spread measure and ratio of non-dominated individuals, are used to evaluate the Pareto optimal fronts. Two multi-objective performance measures, namely, optimizer overhead and algorithm effort, are used to find the computational effort of the optimization algorithm. The trajectories are defined by B-spline functions. The results obtained from NSGA-II and MODE are compared and analyzed.
文摘This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based on the communication and memory characteristics of particle swarm optimization(PSO). IGSA technique is incorporated into the multi-robot system in a dynamic framework, which will provide robust performance, self-deterministic cooperation, and coping with an inhospitable environment. The robots in the team make independent decisions, coordinate, and cooperate with each other to accomplish a common goal using the developed IGSA. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position in the proposed environment. Finally, the analytical and experimental results of the multi-robot path planning were compared with those obtained by IGSA, GSA and differential evolution(DE) in a similar environment. The simulation and the Khepera environment result show outperforms of IGSA as compared to GSA and DE with respect to the average total trajectory path deviation, average uncovered trajectory target distance and energy optimization in terms of rotation.
基金supported by the National Key R&D Project(No.2020YFB1600101)National Natural Science Foundations of China(Nos.U1833103,71801215)Civil Aviation Flight Wide Area Surveillance and Safety Control Technology Key Laboratory Open Fund(No.202008)。
文摘Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.
基金Project(61273138)supported by the National Natural Science Foundation of ChinaProject(14JCZDJC39300)supported by the Key Fund of Tianjin,China
文摘Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.
基金supported by Gansu Provincial Science and Technology Program Project(No.23JRRA868)Lanzhou Municipal Talent Innovation and Entrepreneurship Project(No.2019-RC-103)。
文摘In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.
文摘巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(grey wolf optimizer, GWO)算法的掘进机断面成形轨迹规划方法。首先,根据夹矸位置将待截割断面环境分为4种情况,对相应断面进行栅格化处理并建立栅格地图,同时采用二值膨胀法对不规则夹矸进行膨胀化处理。然后,对GWO算法进行了改进,以提升其寻优性能和收敛速度。接着,开展了仿真实验,利用改进GWO算法实现了4种环境下掘进机断面成形轨迹的规划。最后,利用掘进机样机开展了断面截割实验。仿真结果表明:相较于传统的GWO算法,改进GWO算法的收敛速度更快且收敛精度更高;在4种断面环境下,基于改进GWO算法规划的断面成形轨迹长度最短,欠挖面积最小,转向次数最少,更容易实现高精度、高效率的轨迹跟踪控制,保证了巷道断面的成形质量。实验结果表明,基于改进GWO算法规划的断面成形轨迹既能提高掘进机的截割效率,又能满足巷道断面成形的质量要求。研究结果可为煤矿井下智能掘进技术的发展提供新的思路和方法。
