During path planning, it is necessary to satisfy the requirements of multiple objectives. Multi-objective synthesis is based on the need of flight mission and subjectivity inclination of decision-maker. The decision-m...During path planning, it is necessary to satisfy the requirements of multiple objectives. Multi-objective synthesis is based on the need of flight mission and subjectivity inclination of decision-maker. The decision-maker, however, has illegibility for under- standing the requirements of multiple objectives and the subjectivity inclination. It is important to develop a reasonable cost performance index for describing the illegibility of the decision-maker in multi-objective path planning. Based on Voronoi dia- gram method for the path planning, this paper studies the synthesis method of the multi-objective cost performance index. Ac- cording to the application of the cost performance index to the path planning based on Voronoi diagram method, this paper ana- lyzes the cost performance index which has been referred to at present. The analysis shows the insufficiency of the cost per- formance index at present, i.e., it is difficult to synthesize sub-objective flmctions because of the great disparity of the sub-objective fimctions. Thus, a new approach is developed to optimize the cost performance index with the multi-objective fuzzy optimization strategy, and an improved performance index is established, which could coordinate the weight conflict of the sub-objective functions. Finally, the experimental result shows the effectiveness of the proposed approach.展开更多
Efficient flight path design for unmanned aerial vehicles(UAVs)in urban environmental event monitoring remains a critical challenge,particularly in prioritizing high-risk zones within complex urban landscapes.Current ...Efficient flight path design for unmanned aerial vehicles(UAVs)in urban environmental event monitoring remains a critical challenge,particularly in prioritizing high-risk zones within complex urban landscapes.Current UAV path planning methodologies often inadequately account for environmental risk factors and exhibit limitations in balancing global and local optimization efficiency.To address these gaps,this study proposes a hybrid path planning framework integrating an improved Ant Colony Optimization(ACO)algorithm with an Orthogonal Jump Point Search(OJPS)algorithm.Firstly,a two-dimensional grid model is constructed to simulate urban environments,with key monitoring nodes selected based on grid-specific environmental risk values.Subsequently,the improved ACO algorithm is used for global path planning,and the OJPS algorithm is integrated to optimize the local path.The improved ACO algorithm introduces the risk value of environmental events,which is used to direct the UAV to the area with higher risk.In the OJPS algorithm,the path search direction is restricted to the orthogonal direction,which improves the computational efficiency of local path optimization.In order to evaluate the performance of the model,this paper utilizes the metrics of the average risk value of the path,the flight time,and the number of turns.The experimental results demonstrate that the proposed improved ACO algorithm performs well in the average risk value of the paths traveled within the first 5 min,within the first 8 min,and within the first 10 min,with improvements of 48.33%,26.10%,and 6.746%,respectively,over the Particle Swarm Optimization(PSO)algorithm and 70.33%,19.08%,and 10.246%,respectively,over theArtificial Rabbits Optimization(ARO)algorithm.TheOJPS algorithmdemonstrates superior performance in terms of flight time and number of turns,exhibiting a reduction of 40%,40%and 57.1%in flight time compared to the other three algorithms,and a reduction of 11.1%,11.1%and 33.8%in the number of turns compared to the other three algorithms.These results highlight the effectiveness of the proposed method in improving the UAV’s ability to respond efficiently to urban environmental events,offering significant implications for the future of UAV path planning in complex urban settings.展开更多
Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony al...Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is proposed.First,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock problem.Second,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of view.Then,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the algorithm.Third,a Bezier curve is used to smooth the shortest path obtained.Finally,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority.展开更多
The problem of finished surface being not first-order continuous commonly exists in machining sculptured surfaces with a torus cutter and some other types of cutters. To solve this problem, a dual drive curve tool pat...The problem of finished surface being not first-order continuous commonly exists in machining sculptured surfaces with a torus cutter and some other types of cutters. To solve this problem, a dual drive curve tool path planning method is proposed in this article. First, the maximum machining strip width of a whole tool path can be obtained through optimizing each tool position with multi-point machining （MPM） method. Second, two drive curves are then determined according to the obtained maximum machining strip width. Finally, the tool is positioned once more along the dual drive curve under the condition of tool path smoothness. A computer simulation and cutting experiments are carried out to testify the performance of the new method. The machined surface is measured with a coordinate measuring machine （CMM） to examine the machining quality. The results obtained show that this method can effectively eliminate sharp scallops between adjacent tool paths, keep tool paths smooth, and improve the surface machining quality as well as machining efficiency.展开更多
In this paper,a new bevel-tip flexible needle path planning method based on the bee-foraging learning particle swarm optimization(BFL-PSO)algorithm and the needle retraction strategy in 3D space is proposed to improve...In this paper,a new bevel-tip flexible needle path planning method based on the bee-foraging learning particle swarm optimization(BFL-PSO)algorithm and the needle retraction strategy in 3D space is proposed to improve the puncture accuracy and shorten the puncture distance in the case of multiple puncture targets.First,the movement of the needle after penetrating the human body is analyzed,and the objective function which includes puncture path error,puncture path length,and collision function is established.Then,the BFL-PSO algorithm and the needle retraction strategy are analyzed.Finally,medical images of the tissue to be punctured are obtained by medical imaging instruments,i.e.,magnetic resonance(MR),and the 3D model of the punctured environment is constructed by 3D Slicer to obtain the environment information on targets and obstacles,and the path of flexible needle is carried out based on the BFL-PSO optimization algorithm and the needle retraction strategy.The simulation results show that,compared with other path planning methods in the related literature,the new path planning method proposed in this paper has higher path planning accuracy,shorter puncture distance,and good adaptability to multi-target path planning problems.展开更多
In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running...In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.展开更多
Paths planning of Unmanned Aerial Vehicles(UAVs)in a dynamic environment is considered a challenging task in autonomous flight control design.In this work,an efficient method based on a Multi-Objective MultiVerse Opti...Paths planning of Unmanned Aerial Vehicles(UAVs)in a dynamic environment is considered a challenging task in autonomous flight control design.In this work,an efficient method based on a Multi-Objective MultiVerse Optimization(MOMVO)algorithm is proposed and successfully applied to solve the path planning problem of quadrotors with moving obstacles.Such a path planning task is formulated as a multicriteria optimization problem under operational constraints.The proposed MOMVO-based planning approach aims to lead the drone to traverse the shortest path from the starting point and the target without collision with moving obstacles.The vehicle moves to the next position from its current one such that the line joining minimizes the total path length and allows aligning its direction towards the goal.To choose the best compromise solution among all the non-dominated Pareto ones obtained for compromise objectives,the modified Technique for Order Preference by Similarity to Ideal Solution(TOPSIS)is investigated.A set of homologous metaheuristics such as Multiobjective Salp Swarm Algorithm(MSSA),Multi-Objective Grey Wolf Optimizer(MOGWO),Multi-Objective Particle Swarm Optimization(MOPSO),and Non-Dominated Genetic Algorithm II(NSGAII)is used as a basis for the performance comparison.Demonstrative results and statistical analyses show the superiority and effectiveness of the proposed MOMVO-based planning method.The obtained results are satisfactory and encouraging for future practical implementation of the path planning strategy.展开更多
The overall performance of multi-robot collaborative systems is significantly affected by the multi-robot task allocation.To improve the effectiveness,robustness,and safety of multi-robot collaborative systems,a multi...The overall performance of multi-robot collaborative systems is significantly affected by the multi-robot task allocation.To improve the effectiveness,robustness,and safety of multi-robot collaborative systems,a multimodal multi-objective evolutionary algorithm based on deep reinforcement learning is proposed in this paper.The improved multimodal multi-objective evolutionary algorithm is used to solve multi-robot task allo-cation problems.Moreover,a deep reinforcement learning strategy is used in the last generation to provide a high-quality path for each assigned robot via an end-to-end manner.Comparisons with three popular multimodal multi-objective evolutionary algorithms on three different scenarios of multi-robot task allocation problems are carried out to verify the performance of the proposed algorithm.The experimental test results show that the proposed algorithm can generate sufficient equivalent schemes to improve the availability and robustness of multi-robot collaborative systems in uncertain environments,and also produce the best scheme to improve the overall task execution efficiency of multi-robot collaborative systems.展开更多
A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperati...A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.展开更多
In autonomous navigation and robotics,particularly within intelligent transportation systems,efficient and precise path planning is essential for navigation through complex environments.While traditional path planning...In autonomous navigation and robotics,particularly within intelligent transportation systems,efficient and precise path planning is essential for navigation through complex environments.While traditional path planning algorithms such as ACO show potential,they frequently encounter limitations in directionality and local optima challenges.This paper introduces an enhanced algorithm—ACO-ESD.Through the implementation of a Step Direction Judgement mechanism that considers pheromone concentrations,heuristic functions,and supplementary indices,the ACOESD algorithm significantly improves path search directionality,expedites convergence,and effectively circumvents local optima.Simulation results indicate that the ACO-ESD algorithm surpasses traditional ACO algorithms in path efficiency,accuracy,and convergence rate,offering an effective solution for path planning in complex weighted lattice maps.展开更多
文摘During path planning, it is necessary to satisfy the requirements of multiple objectives. Multi-objective synthesis is based on the need of flight mission and subjectivity inclination of decision-maker. The decision-maker, however, has illegibility for under- standing the requirements of multiple objectives and the subjectivity inclination. It is important to develop a reasonable cost performance index for describing the illegibility of the decision-maker in multi-objective path planning. Based on Voronoi dia- gram method for the path planning, this paper studies the synthesis method of the multi-objective cost performance index. Ac- cording to the application of the cost performance index to the path planning based on Voronoi diagram method, this paper ana- lyzes the cost performance index which has been referred to at present. The analysis shows the insufficiency of the cost per- formance index at present, i.e., it is difficult to synthesize sub-objective flmctions because of the great disparity of the sub-objective fimctions. Thus, a new approach is developed to optimize the cost performance index with the multi-objective fuzzy optimization strategy, and an improved performance index is established, which could coordinate the weight conflict of the sub-objective functions. Finally, the experimental result shows the effectiveness of the proposed approach.
基金supported by the Special Project forKey Fields of Ordinary Universities in Guangdong Province(Number:2023ZDZX1076).
文摘Efficient flight path design for unmanned aerial vehicles(UAVs)in urban environmental event monitoring remains a critical challenge,particularly in prioritizing high-risk zones within complex urban landscapes.Current UAV path planning methodologies often inadequately account for environmental risk factors and exhibit limitations in balancing global and local optimization efficiency.To address these gaps,this study proposes a hybrid path planning framework integrating an improved Ant Colony Optimization(ACO)algorithm with an Orthogonal Jump Point Search(OJPS)algorithm.Firstly,a two-dimensional grid model is constructed to simulate urban environments,with key monitoring nodes selected based on grid-specific environmental risk values.Subsequently,the improved ACO algorithm is used for global path planning,and the OJPS algorithm is integrated to optimize the local path.The improved ACO algorithm introduces the risk value of environmental events,which is used to direct the UAV to the area with higher risk.In the OJPS algorithm,the path search direction is restricted to the orthogonal direction,which improves the computational efficiency of local path optimization.In order to evaluate the performance of the model,this paper utilizes the metrics of the average risk value of the path,the flight time,and the number of turns.The experimental results demonstrate that the proposed improved ACO algorithm performs well in the average risk value of the paths traveled within the first 5 min,within the first 8 min,and within the first 10 min,with improvements of 48.33%,26.10%,and 6.746%,respectively,over the Particle Swarm Optimization(PSO)algorithm and 70.33%,19.08%,and 10.246%,respectively,over theArtificial Rabbits Optimization(ARO)algorithm.TheOJPS algorithmdemonstrates superior performance in terms of flight time and number of turns,exhibiting a reduction of 40%,40%and 57.1%in flight time compared to the other three algorithms,and a reduction of 11.1%,11.1%and 33.8%in the number of turns compared to the other three algorithms.These results highlight the effectiveness of the proposed method in improving the UAV’s ability to respond efficiently to urban environmental events,offering significant implications for the future of UAV path planning in complex urban settings.
基金the National Natural Science Founda-tion(Nos.62063019 and 61763026)the Gansu Nat-ural Science Foundation Project(No.20JR10RA152)the Gansu Provincial Department of Educa-tion:Excellent Graduate“Innovation Star”Project(No.2021CXZX-507)。
文摘Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is proposed.First,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock problem.Second,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of view.Then,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the algorithm.Third,a Bezier curve is used to smooth the shortest path obtained.Finally,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority.
基金National Natural Science Foundation of China (50875012)National High-tech Research and Development Program (2008AA04Z124)+1 种基金National Science and Technology Major Project (2009ZX04001-141)Joint Construction Project of Beijing Municipal Commission of Education
文摘The problem of finished surface being not first-order continuous commonly exists in machining sculptured surfaces with a torus cutter and some other types of cutters. To solve this problem, a dual drive curve tool path planning method is proposed in this article. First, the maximum machining strip width of a whole tool path can be obtained through optimizing each tool position with multi-point machining （MPM） method. Second, two drive curves are then determined according to the obtained maximum machining strip width. Finally, the tool is positioned once more along the dual drive curve under the condition of tool path smoothness. A computer simulation and cutting experiments are carried out to testify the performance of the new method. The machined surface is measured with a coordinate measuring machine （CMM） to examine the machining quality. The results obtained show that this method can effectively eliminate sharp scallops between adjacent tool paths, keep tool paths smooth, and improve the surface machining quality as well as machining efficiency.
基金supported in part by the National Key R&D Funding(No.2018YFE0206900).
文摘In this paper,a new bevel-tip flexible needle path planning method based on the bee-foraging learning particle swarm optimization(BFL-PSO)algorithm and the needle retraction strategy in 3D space is proposed to improve the puncture accuracy and shorten the puncture distance in the case of multiple puncture targets.First,the movement of the needle after penetrating the human body is analyzed,and the objective function which includes puncture path error,puncture path length,and collision function is established.Then,the BFL-PSO algorithm and the needle retraction strategy are analyzed.Finally,medical images of the tissue to be punctured are obtained by medical imaging instruments,i.e.,magnetic resonance(MR),and the 3D model of the punctured environment is constructed by 3D Slicer to obtain the environment information on targets and obstacles,and the path of flexible needle is carried out based on the BFL-PSO optimization algorithm and the needle retraction strategy.The simulation results show that,compared with other path planning methods in the related literature,the new path planning method proposed in this paper has higher path planning accuracy,shorter puncture distance,and good adaptability to multi-target path planning problems.
基金Aeronautical Science Foundation of China(No.20220001057001)。
文摘In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.
文摘Paths planning of Unmanned Aerial Vehicles(UAVs)in a dynamic environment is considered a challenging task in autonomous flight control design.In this work,an efficient method based on a Multi-Objective MultiVerse Optimization(MOMVO)algorithm is proposed and successfully applied to solve the path planning problem of quadrotors with moving obstacles.Such a path planning task is formulated as a multicriteria optimization problem under operational constraints.The proposed MOMVO-based planning approach aims to lead the drone to traverse the shortest path from the starting point and the target without collision with moving obstacles.The vehicle moves to the next position from its current one such that the line joining minimizes the total path length and allows aligning its direction towards the goal.To choose the best compromise solution among all the non-dominated Pareto ones obtained for compromise objectives,the modified Technique for Order Preference by Similarity to Ideal Solution(TOPSIS)is investigated.A set of homologous metaheuristics such as Multiobjective Salp Swarm Algorithm(MSSA),Multi-Objective Grey Wolf Optimizer(MOGWO),Multi-Objective Particle Swarm Optimization(MOPSO),and Non-Dominated Genetic Algorithm II(NSGAII)is used as a basis for the performance comparison.Demonstrative results and statistical analyses show the superiority and effectiveness of the proposed MOMVO-based planning method.The obtained results are satisfactory and encouraging for future practical implementation of the path planning strategy.
基金the Shanghai Pujiang Program (No.22PJD030),the National Natural Science Foundation of China (Nos.61603244 and 71904116)the National Natural Science Foundation of China-Shandong Joint Fund (No.U2006228)。
文摘The overall performance of multi-robot collaborative systems is significantly affected by the multi-robot task allocation.To improve the effectiveness,robustness,and safety of multi-robot collaborative systems,a multimodal multi-objective evolutionary algorithm based on deep reinforcement learning is proposed in this paper.The improved multimodal multi-objective evolutionary algorithm is used to solve multi-robot task allo-cation problems.Moreover,a deep reinforcement learning strategy is used in the last generation to provide a high-quality path for each assigned robot via an end-to-end manner.Comparisons with three popular multimodal multi-objective evolutionary algorithms on three different scenarios of multi-robot task allocation problems are carried out to verify the performance of the proposed algorithm.The experimental test results show that the proposed algorithm can generate sufficient equivalent schemes to improve the availability and robustness of multi-robot collaborative systems in uncertain environments,and also produce the best scheme to improve the overall task execution efficiency of multi-robot collaborative systems.
基金the National Science and Technology Support Program(No.2015BAG20B05)
文摘A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.
文摘In autonomous navigation and robotics,particularly within intelligent transportation systems,efficient and precise path planning is essential for navigation through complex environments.While traditional path planning algorithms such as ACO show potential,they frequently encounter limitations in directionality and local optima challenges.This paper introduces an enhanced algorithm—ACO-ESD.Through the implementation of a Step Direction Judgement mechanism that considers pheromone concentrations,heuristic functions,and supplementary indices,the ACOESD algorithm significantly improves path search directionality,expedites convergence,and effectively circumvents local optima.Simulation results indicate that the ACO-ESD algorithm surpasses traditional ACO algorithms in path efficiency,accuracy,and convergence rate,offering an effective solution for path planning in complex weighted lattice maps.
