Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as...Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.展开更多
With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execu...With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execution,it is a nonlinear problem with constraints.Traditional optimization algorithms have difficulty in finding the optimal solution that minimizes the cost function under various constraints.At the same time,robustness should be taken into account to ensure the reliable and safe operation of the UAVs.In this paper,a self-adaptive sparrow search algorithm(SSA),denoted as DRSSA,is presented.During optimization,a dynamic population strategy is used to allocate the searching effort between exploration and exploitation;a t-distribution perturbation coefficient is proposed to adaptively adjust the exploration range;a random learning strategy is used to help the algorithm from falling into the vicinity of the origin and local optimums.The convergence of DRSSA is tested by 29 test functions from the Institute of Electrical and Electronics Engineers(IEEE)Congress on Evolutionary Computation(CEC)2017 benchmark suite.Furthermore,a stochastic optimization strategy is introduced to enhance safety in the path by accounting for potential perturbations.Two sets of simulation experiments on multi-UAV path planning in three-dimensional environments demonstrate that the algorithm exhibits strong optimization capabilities and robustness in dealing with uncertain situations.展开更多
In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms...In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.展开更多
Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lowe...Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lower machining efficiency and longer machining time due to its time-varying cutter-workpiece engagement angle and a high percentage of non-cutting tool paths.To address these issues,this paper introduces a parameter-variant trochoidal-like(PVTR)tool path planning method for chatter-free and high-efficiency milling.This method ensures a constant engagement angle for each tool path period by adjusting the trochoidal radius and step.Initially,the nonlinear equation for the PVTR toolpath is established.Then,a segmented recurrence method is proposed to plan tool paths based on the desired engagement angle.The impact of trochoidal tool path parameters on the engagement angle is analyzed and coupled this information with the milling stability model based on spindle speed and engagement angle to determine the desired engagement angle throughout the machining process.Finally,several experimental tests are carried out using the bull-nose end mill to validate the feasibility and effectiveness of the proposed method.展开更多
The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving...The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving timely and compatible solutions to treat diverse skin injuries.In situ bioprinting has emerged as a key new technology,since it reduces risks during the implantation of printed scaffolds and demonstrates superior therapeutic effects.However,maintaining printing fidelity during in situ bioprinting remains a critical challenge,particularly with respect to model layering and path planning.This study proposes a novel optimization-based conformal path planning strategy for in situ bioprinting-based repair of complex skin injuries.This strategy employs constrained optimization to identify optimal waypoints on a point cloud-approximated curved surface,thereby ensuring a high degree of similarity between predesigned planar and surface-mapped 3D paths.Furthermore,this method is applicable for skin wound treatments,since it generates 3D-equidistant zigzag curves along surface tangents and enables multi-layer conformal path planning to facilitate the treatment of volumetric injuries.Furthermore,the proposed algorithm was found to be a feasible and effective treatment in a murine back injury model as well as in other complex models,thereby showcasing its potential to guide in situ bioprinting,enhance bioprinting fidelity,and facilitate improvement of clinical outcomes.展开更多
To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The...To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.展开更多
Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous...Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous control process of SMR can be divided into three stages,say,state diagnosis,autonomous decision-making and coordinated control.In this paper,the autonomous state recognition and task planning of unmanned SMR are investigated.An operating condition recognition method based on the knowledge base of SMR operation is proposed by using the artificial neural network(ANN)technology,which constructs a basis for the state judgment of intelligent reactor control path planning.An improved reinforcement learning path planning algorithm is utilized to implement the path transfer decision-makingThis algorithm performs condition transitions with minimal cost under specified modes.In summary,the full range control path intelligent decision-planning technology of SMR is realized,thus provides some theoretical basis for the design and build of unmanned SMR in the future.展开更多
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV...Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.展开更多
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.展开更多
A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path...A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.展开更多
Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threat...Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.展开更多
Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees l...Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees lead to slow convergence and force an unfavorable trade-off between path quality and traversal safety.To address these challenges,we introduce HS-APF-RRT*,a novel algorithm that fuses layered sampling,an enhanced Artificial Potential Field(APF),and a dynamic neighborhood-expansion mechanism.First,the workspace is hierarchically partitioned into macro,meso,and micro sampling layers,progressively biasing random samples toward safer,lower-energy regions.Second,we augment the traditional APF by incorporating a slope-dependent repulsive term,enabling stronger avoidance of steep obstacles.Third,a dynamic expansion strategy adaptively switches between 8 and 16 connected neighborhoods based on local obstacle density,striking an effective balance between search efficiency and collision-avoidance precision.In simulated off-road scenarios,HS-APF-RRT*is benchmarked against RRT*,GoalBiased RRT*,and APF-RRT*,and demonstrates significantly faster convergence,lower path-energy consumption,and enhanced safety margins.展开更多
Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper propose...Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.展开更多
The traditional production of bionic wigs through manual weaving is a complex process characterized by high labor intensity,making automation challenging.To address this issue,an automated weaving process for bionic w...The traditional production of bionic wigs through manual weaving is a complex process characterized by high labor intensity,making automation challenging.To address this issue,an automated weaving process for bionic wigs is proposed and the design of an automated bionic wig weaving machine is presented based on an analysis of manual weaving principles and processes.Furthermore,according to the characteristics of the weaving machine and the distribution pattern of weaving nodes,the minimum weaving duration of a single hairnet is taken as the optimization goal,and a continuous weaving path planning for the weaving process of the mixed scheme is conducted.The weaving duration for various weaving paths are calculated and compared,and the results indicate that the duration of the S-shaped weaving path is always the shortest in different weaving regions.The designed automated weaving process and the weaving path planning provide a theoretical foundation and experimental data for achieving automated weaving of bionic wigs.展开更多
Taking modern indoor building construction as an example,this study analyzes the path planning and navigation of a smart plastering robot.It includes a basic introduction to smart plastering robots,an analysis of mult...Taking modern indoor building construction as an example,this study analyzes the path planning and navigation of a smart plastering robot.It includes a basic introduction to smart plastering robots,an analysis of multi-sensor fusion localization algorithms for smart plastering robots,and an analysis of path planning and navigation functions for smart plastering robots.It is hoped that through this analysis,a reference is provided for the path planning and navigation design of such robots to meet their practical application needs.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
Despite its immense potential,the application of digital twin technology in real industrial scenarios still faces numerous challenges.This study focuses on industrial assembly lines in sectors such as microelectronics...Despite its immense potential,the application of digital twin technology in real industrial scenarios still faces numerous challenges.This study focuses on industrial assembly lines in sectors such as microelectronics,pharmaceuticals,and food packaging,where precision and speed are paramount,applying digital twin technology to the robotic assembly process.The innovation of this research lies in the development of a digital twin architecture and system for Delta robots that is suitable for real industrial environments.Based on this system,a deep reinforcement learning algorithm for obstacle avoidance path planning in Delta robots has been developed,significantly enhancing learning efficiency through an improved intermediate reward mechanism.Experiments on communication and interaction between the digital twin system and the physical robot validate the effectiveness of this method.The system not only enhances the integration of digital twin technology,deep reinforcement learning and robotics,offering an efficient solution for path planning and target grasping inDelta robots,but also underscores the transformative potential of digital twin technology in intelligent manufacturing,with extensive applicability across diverse industrial domains.展开更多
To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a...To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a two-stage scaling factor variation strategy.In the initial phase,it adapts according to environmental complexity.In the following phase,it combines individual and global experiences to fine-tune the orientation factor,effectively improving its global search capability.Furthermore,this study developed a new population update method,ensuring that well-adapted individuals are retained,which enhances population diversity.In benchmark function tests across different dimensions,the proposed algorithm consistently demonstrates superior convergence accuracy and speed.This study also tested the TPADE algorithm in path planning simulations.The experimental results reveal that the TPADE algorithm outperforms existing algorithms by achieving path lengths of 28.527138 and 31.963990 in simple and complex map environments,respectively.These findings indicate that the proposed algorithm is more adaptive and efficient in path planning.展开更多
In recent years,renewable energy(RE)penetration has become an important target in power systems.However,RE power is affected by climate change and has strong randomness and volatility.Adequate transmission capacity an...In recent years,renewable energy(RE)penetration has become an important target in power systems.However,RE power is affected by climate change and has strong randomness and volatility.Adequate transmission capacity and energy storage systems(ESSs)are conducive to the integration of RE.Therefore,coordinated transmission renewable–storage expansion planning(TRSEP)is an effective decision-making approach to cope with the impacts of climate change and achieve the development tar-get of RE penetration.Electricity trading between different systems is common;therefore,in addition to the penetration of RE into the internal loads of the system,the proportion of RE generation in tie lines is gaining attention,making analyses of the RE transmission path necessary.Referring to the flow of carbon emissions,this paper defines the RE power flow density to track the transmission path of RE.Next,a TRSEP model is proposed that can clearly distinguish the RE transmission path into internal loads,exter-nal loads,and energy losses.To address the presence of bilinear terms in the proposed model,the McCormick method is applied,and a customized feasibility correction strategy is designed to obtain a good feasible solution.Numerical results from case studies are provided to verify the rationality and effectiveness of the approach proposed in this paper.展开更多
基金supported by the Committee of Science of the Ministry of Education and Science of the Republic of Kazakhstan under Grant No.249015/0224.
文摘Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.
基金Foundation items:National Natural Science Foundation of China(No.62303108)Fundamental Research Funds for the Central Universities,China(No.CUSF-DH-T-2023065)。
文摘With the advancement of technology,the collaboration of multiple unmanned aerial vehicles(multi-UAVs)is a general trend,both in military and civilian domains.Path planning is a crucial step for multi-UAV mission execution,it is a nonlinear problem with constraints.Traditional optimization algorithms have difficulty in finding the optimal solution that minimizes the cost function under various constraints.At the same time,robustness should be taken into account to ensure the reliable and safe operation of the UAVs.In this paper,a self-adaptive sparrow search algorithm(SSA),denoted as DRSSA,is presented.During optimization,a dynamic population strategy is used to allocate the searching effort between exploration and exploitation;a t-distribution perturbation coefficient is proposed to adaptively adjust the exploration range;a random learning strategy is used to help the algorithm from falling into the vicinity of the origin and local optimums.The convergence of DRSSA is tested by 29 test functions from the Institute of Electrical and Electronics Engineers(IEEE)Congress on Evolutionary Computation(CEC)2017 benchmark suite.Furthermore,a stochastic optimization strategy is introduced to enhance safety in the path by accounting for potential perturbations.Two sets of simulation experiments on multi-UAV path planning in three-dimensional environments demonstrate that the algorithm exhibits strong optimization capabilities and robustness in dealing with uncertain situations.
基金supported by the National Natural Science Foundation of China(No.62373027).
文摘In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.
基金supported by the National Natural Science Foundation of China(Grant Nos.U22A20202 and 52275477).
文摘Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lower machining efficiency and longer machining time due to its time-varying cutter-workpiece engagement angle and a high percentage of non-cutting tool paths.To address these issues,this paper introduces a parameter-variant trochoidal-like(PVTR)tool path planning method for chatter-free and high-efficiency milling.This method ensures a constant engagement angle for each tool path period by adjusting the trochoidal radius and step.Initially,the nonlinear equation for the PVTR toolpath is established.Then,a segmented recurrence method is proposed to plan tool paths based on the desired engagement angle.The impact of trochoidal tool path parameters on the engagement angle is analyzed and coupled this information with the milling stability model based on spindle speed and engagement angle to determine the desired engagement angle throughout the machining process.Finally,several experimental tests are carried out using the bull-nose end mill to validate the feasibility and effectiveness of the proposed method.
基金supported in part by the National Natural Science Foundation of China(Nos.52205532 and 624B2077)the National Key Research and Development Program of China(No.2023YFB4302003).
文摘The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving timely and compatible solutions to treat diverse skin injuries.In situ bioprinting has emerged as a key new technology,since it reduces risks during the implantation of printed scaffolds and demonstrates superior therapeutic effects.However,maintaining printing fidelity during in situ bioprinting remains a critical challenge,particularly with respect to model layering and path planning.This study proposes a novel optimization-based conformal path planning strategy for in situ bioprinting-based repair of complex skin injuries.This strategy employs constrained optimization to identify optimal waypoints on a point cloud-approximated curved surface,thereby ensuring a high degree of similarity between predesigned planar and surface-mapped 3D paths.Furthermore,this method is applicable for skin wound treatments,since it generates 3D-equidistant zigzag curves along surface tangents and enables multi-layer conformal path planning to facilitate the treatment of volumetric injuries.Furthermore,the proposed algorithm was found to be a feasible and effective treatment in a murine back injury model as well as in other complex models,thereby showcasing its potential to guide in situ bioprinting,enhance bioprinting fidelity,and facilitate improvement of clinical outcomes.
文摘To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.
文摘Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous control process of SMR can be divided into three stages,say,state diagnosis,autonomous decision-making and coordinated control.In this paper,the autonomous state recognition and task planning of unmanned SMR are investigated.An operating condition recognition method based on the knowledge base of SMR operation is proposed by using the artificial neural network(ANN)technology,which constructs a basis for the state judgment of intelligent reactor control path planning.An improved reinforcement learning path planning algorithm is utilized to implement the path transfer decision-makingThis algorithm performs condition transitions with minimal cost under specified modes.In summary,the full range control path intelligent decision-planning technology of SMR is realized,thus provides some theoretical basis for the design and build of unmanned SMR in the future.
基金National Natural Science Foundation of China(Grant No.52472417)to provide fund for conducting experiments.
文摘Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.
基金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.
基金supported by the National Science Fund for Distinguished Young Scholars(52425211)BIT Research Fund Program for Young Scholars(XSQD-202201005).
文摘A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method.
基金supported by the Ministry of Industry and Information Technology(No.23100002022102001)。
文摘Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.
基金supported in part by 14th Five Year National Key R&D Program Project(Project Number:2023YFB3211001)the National Natural Science Foundation of China(62273339,U24A201397).
文摘Rapidly-exploring Random Tree(RRT)and its variants have become foundational in path-planning research,yet in complex three-dimensional off-road environments their uniform blind sampling and limited safety guarantees lead to slow convergence and force an unfavorable trade-off between path quality and traversal safety.To address these challenges,we introduce HS-APF-RRT*,a novel algorithm that fuses layered sampling,an enhanced Artificial Potential Field(APF),and a dynamic neighborhood-expansion mechanism.First,the workspace is hierarchically partitioned into macro,meso,and micro sampling layers,progressively biasing random samples toward safer,lower-energy regions.Second,we augment the traditional APF by incorporating a slope-dependent repulsive term,enabling stronger avoidance of steep obstacles.Third,a dynamic expansion strategy adaptively switches between 8 and 16 connected neighborhoods based on local obstacle density,striking an effective balance between search efficiency and collision-avoidance precision.In simulated off-road scenarios,HS-APF-RRT*is benchmarked against RRT*,GoalBiased RRT*,and APF-RRT*,and demonstrates significantly faster convergence,lower path-energy consumption,and enhanced safety margins.
基金supported by the Shaanxi Province Natural Science Basic Research Program Project(2024JC-YBMS-572)partially funded by Yan’an University Graduate Education Innovation Program Project(YCX2023032,YCX2023033,YCX2024094,YCX2024097)the“14th Five Year Plan Medium and Long Term Major Scientific Research Project”(2021ZCQ015)of Yan’an University.
文摘Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.
基金Yuzhou Olandi Arts&Crafts Co.,Ltd.,Project of Development and Research of Wig Planting Equipment,China(No.HX103210723)。
文摘The traditional production of bionic wigs through manual weaving is a complex process characterized by high labor intensity,making automation challenging.To address this issue,an automated weaving process for bionic wigs is proposed and the design of an automated bionic wig weaving machine is presented based on an analysis of manual weaving principles and processes.Furthermore,according to the characteristics of the weaving machine and the distribution pattern of weaving nodes,the minimum weaving duration of a single hairnet is taken as the optimization goal,and a continuous weaving path planning for the weaving process of the mixed scheme is conducted.The weaving duration for various weaving paths are calculated and compared,and the results indicate that the duration of the S-shaped weaving path is always the shortest in different weaving regions.The designed automated weaving process and the weaving path planning provide a theoretical foundation and experimental data for achieving automated weaving of bionic wigs.
基金Science and Technology Research Project of Chongqing Education Commission(Project No.:KJQN202401902)Chongqing Construction Science and Technology Plan Project(Project No.:Chinese Society For Urban Studies,2024:3-24)+1 种基金cientific Research Fund Project of Chongqing Institute of Engineering(Project No.:2022gcky01)College Student Innovation and Entrepreneurship Training Program Project of Chongqing Institute of Engineering(Project No.:CXCY2024018)。
文摘Taking modern indoor building construction as an example,this study analyzes the path planning and navigation of a smart plastering robot.It includes a basic introduction to smart plastering robots,an analysis of multi-sensor fusion localization algorithms for smart plastering robots,and an analysis of path planning and navigation functions for smart plastering robots.It is hoped that through this analysis,a reference is provided for the path planning and navigation design of such robots to meet their practical application needs.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
基金supported in part by the National Natural Science Foundation of China under Grants 62303098 and 62173073in part by China Postdoctoral Science Foundation under Grant 2022M720679+1 种基金in part by the Central University Basic Research Fund of China under Grant N2304021in part by the Liaoning Provincial Science and Technology Plan Project-Technology Innovation Guidance of the Science and Technology Department under Grant 2023JH1/10400011.
文摘Despite its immense potential,the application of digital twin technology in real industrial scenarios still faces numerous challenges.This study focuses on industrial assembly lines in sectors such as microelectronics,pharmaceuticals,and food packaging,where precision and speed are paramount,applying digital twin technology to the robotic assembly process.The innovation of this research lies in the development of a digital twin architecture and system for Delta robots that is suitable for real industrial environments.Based on this system,a deep reinforcement learning algorithm for obstacle avoidance path planning in Delta robots has been developed,significantly enhancing learning efficiency through an improved intermediate reward mechanism.Experiments on communication and interaction between the digital twin system and the physical robot validate the effectiveness of this method.The system not only enhances the integration of digital twin technology,deep reinforcement learning and robotics,offering an efficient solution for path planning and target grasping inDelta robots,but also underscores the transformative potential of digital twin technology in intelligent manufacturing,with extensive applicability across diverse industrial domains.
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金The National Natural Science Foundation of China(No.62272239,62303214)Jiangsu Agricultural Science and Tech-nology Independent Innovation Fund(No.SJ222051).
文摘To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a two-stage scaling factor variation strategy.In the initial phase,it adapts according to environmental complexity.In the following phase,it combines individual and global experiences to fine-tune the orientation factor,effectively improving its global search capability.Furthermore,this study developed a new population update method,ensuring that well-adapted individuals are retained,which enhances population diversity.In benchmark function tests across different dimensions,the proposed algorithm consistently demonstrates superior convergence accuracy and speed.This study also tested the TPADE algorithm in path planning simulations.The experimental results reveal that the TPADE algorithm outperforms existing algorithms by achieving path lengths of 28.527138 and 31.963990 in simple and complex map environments,respectively.These findings indicate that the proposed algorithm is more adaptive and efficient in path planning.
基金supported by State Key Laboratory of Electrical Insulation and Power Equipment(EIPE22119).
文摘In recent years,renewable energy(RE)penetration has become an important target in power systems.However,RE power is affected by climate change and has strong randomness and volatility.Adequate transmission capacity and energy storage systems(ESSs)are conducive to the integration of RE.Therefore,coordinated transmission renewable–storage expansion planning(TRSEP)is an effective decision-making approach to cope with the impacts of climate change and achieve the development tar-get of RE penetration.Electricity trading between different systems is common;therefore,in addition to the penetration of RE into the internal loads of the system,the proportion of RE generation in tie lines is gaining attention,making analyses of the RE transmission path necessary.Referring to the flow of carbon emissions,this paper defines the RE power flow density to track the transmission path of RE.Next,a TRSEP model is proposed that can clearly distinguish the RE transmission path into internal loads,exter-nal loads,and energy losses.To address the presence of bilinear terms in the proposed model,the McCormick method is applied,and a customized feasibility correction strategy is designed to obtain a good feasible solution.Numerical results from case studies are provided to verify the rationality and effectiveness of the approach proposed in this paper.
