An adaptive path planning algorithm was proposed,which improves upon traditional A*by integrating an improved A*algorithm with the Dynamic Window Approach(DWA).This addresses the problems of slow search speed,unsmooth...An adaptive path planning algorithm was proposed,which improves upon traditional A*by integrating an improved A*algorithm with the Dynamic Window Approach(DWA).This addresses the problems of slow search speed,unsmooth paths,and poor dynamic obstacle avoidance capability.Through an“8+5”neighborhood screening,a 16-neighborhood evaluation function,and a second-order then third-order Bézier curve optimization process,a Jetson Nano+ROS(Robot Operating System)is deployed to meet the requirements of efficient and safe navigation for fire inspection robots in complex environments.The results show that,compared with the original algorithm,the proposed algorithm reduces the average number of traversed nodes by 49.23%,the number of turns in the optimized path has decreased by approximately 28.82%,decreases curvature by 66.6%,and eliminates path tangency with obstacles.This also supports real-time obstacle avoidance with integration DWA,and outperforms traditional methods.展开更多
An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale...An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10−4 p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the p...Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.展开更多
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.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
Aiming at the complex and restrictive characteristics of human resource allocation in multiple scientific university research projects, an improved pigeon-inspired optimization(IPIO) algorithm is proposed wherein loss...Aiming at the complex and restrictive characteristics of human resource allocation in multiple scientific university research projects, an improved pigeon-inspired optimization(IPIO) algorithm is proposed wherein loss minimization and the shortest project delay time are considered as optimization goals. Firstly, mathematical modelling of the problem is carried out, and the multi-objective optimization problem is transformed into a single-objective optimization problem by means of a weighted solution. In the second step, the traditional pigeon-inspired optimization(PIO) algorithm is discretized, and an adaptive parameter strategy is adopted to improve the shortcomings of the algorithm itself. Finally, by comparing the simulation results with the original algorithm and the genetic algorithm in the optimization of human resource allocation in multiple projects, the feasibility and superiority of the proposed algorithm in the optimization of human resource allocation in multi-scientific research projects is verified.展开更多
基金supported by the National Natural Science Foundation of China(Nos.61975015,62375017).
摘要An adaptive path planning algorithm was proposed,which improves upon traditional A*by integrating an improved A*algorithm with the Dynamic Window Approach(DWA).This addresses the problems of slow search speed,unsmooth paths,and poor dynamic obstacle avoidance capability.Through an“8+5”neighborhood screening,a 16-neighborhood evaluation function,and a second-order then third-order Bézier curve optimization process,a Jetson Nano+ROS(Robot Operating System)is deployed to meet the requirements of efficient and safe navigation for fire inspection robots in complex environments.The results show that,compared with the original algorithm,the proposed algorithm reduces the average number of traversed nodes by 49.23%,the number of turns in the optimized path has decreased by approximately 28.82%,decreases curvature by 66.6%,and eliminates path tangency with obstacles.This also supports real-time obstacle avoidance with integration DWA,and outperforms traditional methods.
基金supported by Yunnan Power Grid Co.,Ltd.Science and Technology Project:Research and application of key technologies for graphical-based power grid accident reconstruction and simulation(YNKJXM20240333).
摘要An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10−4 p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
摘要An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
基金supported by the Natural Science Foundation of Hunan Province of China(Nos.2021JJ10045 and 2025JJ60072)the Open Research Subject of State Key Laboratory of Intelligent Game(No.ZBKF-24-01)+1 种基金the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(No.2024M754304).
摘要Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.
基金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.
摘要In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
基金supported by the Fundamental Research Funds for the Central Scientific Research Institutes (Grant No. 20200306)。
摘要Aiming at the complex and restrictive characteristics of human resource allocation in multiple scientific university research projects, an improved pigeon-inspired optimization(IPIO) algorithm is proposed wherein loss minimization and the shortest project delay time are considered as optimization goals. Firstly, mathematical modelling of the problem is carried out, and the multi-objective optimization problem is transformed into a single-objective optimization problem by means of a weighted solution. In the second step, the traditional pigeon-inspired optimization(PIO) algorithm is discretized, and an adaptive parameter strategy is adopted to improve the shortcomings of the algorithm itself. Finally, by comparing the simulation results with the original algorithm and the genetic algorithm in the optimization of human resource allocation in multiple projects, the feasibility and superiority of the proposed algorithm in the optimization of human resource allocation in multi-scientific research projects is verified.