Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN ...Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN planning remains a challenge,especially in scenarios where traditional search algorithms struggle to navigate the vast solution space efficiently.This research proposes a novel technique to enhance HTN planning by integrating the Ant Colony Optimization(ACO)algorithm into the refinement process.The Ant System algorithm,inspired by the foraging behavior of ants,is well-suited for addressing optimization problems by efficiently exploring solution spaces.By incorporating ACO into the refinement phase of HTN planning,the authors aim to leverage its adaptive nature and decentralized decision-making to improve plan generation.This paper involves the development of a hybrid strategy called ACO-HTN,which combines HTN planning with ACO-based plan selection.This technique enables the system to adaptively refine plans by guiding the search towards optimal solutions.To evaluate the effectiveness of the proposed technique,this paper conducts empirical experiments on various domains and benchmark datasets.Our results demonstrate that the ACO-HTN strategy enhances the efficiency and effectiveness of HTN planning,outperforming traditional methods in terms of solution quality and computational performance.展开更多
The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)w...The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)while maintaining cost-efficiency and sustainable deployment.Traditional strategies struggle with complex 3D propagation,building penetration loss,and the balance between coverage and infrastructure cost.To address this challenge,this study presents the first application of a Global-best Guided Quantum-inspired Tabu Search with Quantum-Not Gate(GQTS-QNG)framework for 3D base-station deployment optimization.The problem is formulated as a multi-objective model that simultaneously maximizes coverage and minimizes deployment cost.A binary-to-decimal encodingmechanism is designed to represent discrete placement coordinates and base station types,leveraging a quantum-inspired method to efficiently search and refine solutions within challenging combinatorial environments.Global-best guidance and tabu memory are integrated to strengthen convergence stability and avoid revisiting previously explored solutions.Simulation results across user densities ranging from 1000 to 10,000 show that GQTS-QNG consistently finds deployment configurations achieving full coverage while reducing deployment cost compared with the state-of-the-art algorithms under equal iteration times.Additionally,our method generates welldistributed and structured Pareto fronts,offering diverse planning options that allow operators to flexibly balance cost and performance requirements.These findings demonstrate that GQTS-QNG is a scalable and efficient algorithm for sustainable 3D cellular network deployment in B5G/6G urban scenarios.展开更多
Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, networ...Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, network reliability and the network loss are the main objective of transmission network planning. Combined with set pair analysis (SPA), particle swarm optimization (PSO), neural network (NN), a hybrid particle swarm optimization model was established with neural network and set pair analysis for transmission network planning (HPNS). Firstly, the contact degree of set pair analysis was introduced, the traditional goal set was converted into the collection of the three indicators including the identity degree, difference agree and contrary degree. On this bases, using shi(H), the three objective optimization problem was converted into single objective optimization problem. Secondly, using the fast and efficient search capabilities of PSO, the transmission network planning model based on set pair analysis was optimized. In the process of optimization, by improving the BP neural network constantly training so that the value of the fitness function of PSO becomes smaller in order to obtain the optimization program fitting the three objectives better. Finally, compared HPNS with PSO algorithm and the classic genetic algorithm, HPNS increased about 23% efficiency than THA, raised about 3.7% than PSO and improved about 2.96% than GA.展开更多
The paper mainly focuses on the network planning and optimization problem in the 5G telecommunication system based on the numerical investigation.There have been two portions of this work,such as network planning for ...The paper mainly focuses on the network planning and optimization problem in the 5G telecommunication system based on the numerical investigation.There have been two portions of this work,such as network planning for efficient network models and optimization of power allocation in the 5G network.The radio network planning process has been completed based on a specific area.The data rate requirement can be solved by allowing the densification of the system by deploying small cells.The radio network planning scheme is the indispensable platform in arranging a wireless network that encounters convinced coverage method,capacity,and Quality of Service necessities.In this study,the eighty micro base stations and two-hundred mobile stations are deployed in the-15km×15km wide selected area in the Yangon downtown area.The optimization processes were also analyzed based on the source and destination nodes in the 5G network.The base stations’location is minimized and optimized in a selected geographical area with the linear programming technique and analyzed in this study.展开更多
The author introduced particle swarm optimization as a new method for power transmission network expansion planning. A new discrete method for particle swarm optimization was developed,which is suitable for power tran...The author introduced particle swarm optimization as a new method for power transmission network expansion planning. A new discrete method for particle swarm optimization was developed,which is suitable for power transmission network expansion planning, and requires less computer s memory.The optimization fitness function construction, parameter selection, convergence judgement, and their characters were analyzod.Numerical simulation demonstrated the effectiveness and correctness or the method. This paper provides an academic and practical basis of particle swarm optimization in application of transmission network expansion planning for further investigation.展开更多
In dynamic and uncertain reconnaissance missions,effective task assignment and path planning for multiple unmanned aerial vehicles(UAVs)present significant challenges.A stochastic multi-UAV reconnaissance scheduling p...In dynamic and uncertain reconnaissance missions,effective task assignment and path planning for multiple unmanned aerial vehicles(UAVs)present significant challenges.A stochastic multi-UAV reconnaissance scheduling problem is formulated as a combinatorial optimization task with nonlinear objectives and coupled constraints.To solve the non-deterministic polynomial(NP)-hard problem efficiently,a novel learning-enhanced pigeon-inspired optimization(L-PIO)algorithm is proposed.The algorithm integrates a Q-learning mechanism to dynamically regulate control parameters,enabling adaptive exploration–exploitation trade-offs across different optimization phases.Additionally,geometric abstraction techniques are employed to approximate complex reconnaissance regions using maximum inscribed rectangles and spiral path models,allowing for precise cost modeling of UAV paths.The formal objective function is developed to minimize global flight distance and completion time while maximizing reconnaissance priority and task coverage.A series of simulation experiments are conducted under three scenarios:static task allocation,dynamic task emergence,and UAV failure recovery.Comparative analysis with several updated algorithms demonstrates that L-PIO exhibits superior robustness,adaptability,and computational efficiency.The results verify the algorithm's effectiveness in addressing dynamic reconnaissance task planning in real-time multi-UAV applications.展开更多
Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the...Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.展开更多
A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the s...A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.展开更多
Recently, unmanned aerial vehicles （UAVs） acting as relay platforms have attracted considerable attention due to the advantages of extending coverage and improving connectivity for long-range communications. Specifi...Recently, unmanned aerial vehicles （UAVs） acting as relay platforms have attracted considerable attention due to the advantages of extending coverage and improving connectivity for long-range communications. Specifically, in the scenario where the access point （AP） is mobile, a UAV needs to find an efficient path to guarantee the connectivity of the relay link. Motivated by this fact, this paper proposes an optimal design for beamforming （BF） and UAV path planning. First of all, we study a dual-hop amplify-and-forward （AF） wireless relay network, in which a UAV is used as relay between a mobile AP and a fixed base station （BS）. In the network, both of the AP and the BS are equipped with multiple antennas, whereas the UAV has a single antenna. Then, we obtain the output signal^to-noise ratio （SNR） of the dual-hop relay network. Based on the criterion of maximizing the output SNR, we develop an optimal design to obtain the solution of the optimal BF weight vector and the UAV heading angle. Next, we derive the closed-form outage probability （OP） expression to investigate the performance of the dual-hop relay network conveniently. Finally, computer simulations show that the proposed approach can obtain nearly optimal flying path and OP performance, indicating the effectiveness of the proposed algorithm. Furthermore, we find that increasing the antenna number at the BS or the maximal heading angle can significantly improve the performance of the considered relay network.展开更多
A strategy of developing on-line optimization intelligent systems based on combiningflowsheeting simulation and optimization package with artificial neural networks(ANN)is presented inthis paper.A number of optimizati...A strategy of developing on-line optimization intelligent systems based on combiningflowsheeting simulation and optimization package with artificial neural networks(ANN)is presented inthis paper.A number of optimization cases for a certain chemical plant are obtained off-line byusing PROCESS-Ⅱ or other flowsheeting programming with optimization.Then,taking these cases astraining examples,we establish a neural network systems which can be used on-line as an optimizer toobtain setpoints from input data sampled from distributed control system through gross error detectionand data reconciliation procedures.Such an on-line optimizer possesses two advantages over nonlinearprogramming package:first of all,there is no convergence problem for the trained ANN to be usedonline;secondly,the frequency for setpoints updating is not limited because only algebraic calculationrather than optimization is required to be carried out on-line.Here two key problems ofimplementing ANN approaches to the on-line optimization展开更多
The continuously growing of cellular networks complexity, which followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this pap...The continuously growing of cellular networks complexity, which followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (such as the environmental one) of the cellular network, are shown.展开更多
Improving maternal health is one of the Sustainable Development Goals.Hospital service areas(HSAs),which contain most hospitalization behaviors at the local scale,are crucial for health care planning.However,little at...Improving maternal health is one of the Sustainable Development Goals.Hospital service areas(HSAs),which contain most hospitalization behaviors at the local scale,are crucial for health care planning.However,little attention has been given to HSAs for maternal care and the hierarchy structure.Considering Hubei,central China,as a case study,this study aims to fill these gaps by developing a method for delineating hierarchical HSAs for maternal care using a network optimization approach.The approach is driven by actual patient flow data and has an explicit objective to maximize the modularity.It also establishes the hierarchical structure of maternal care HSAs,which is fundamental for the planning of hierarchical maternal care and referral systems.In our case study,45 secondary HSAs and 22tertiary HSAs are delineated to achieve maximal modularity.The HSAs perform well in terms of indices such as the Localization Index and Market Share Index.Furthermore,there is a complementary relationship between secondary and tertiary hospitals,which suggests the need for referral system planning.This study can provide evidence for the validity of the HSA and the planning of maternal care HSAs in China.It also provides transferable methods for planning hierarchical HSAs in other developing countries.展开更多
Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies...Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies.Additionally,the non-linear nature of cost functions can cause algorithms to become trapped in local optima.Furthermore,there is often a lack of adequate consideration for real-world constraints,for example,due to the necessity for obstacle avoidance or because of the restrictions of flight safety.To address the aforementioned issues,this paper proposes a dynamic weighted spherical particle swarm optimization(DW-SPSO)algorithm.The algorithm adopts a dual Sigmoid-based adaptive weight adjustment mechanism for balancing global exploration and local exploitation,as well as a lens-based opposition learning one to improve search flexibility and solution diversity.Simulation experiments on real digital elevation models demonstrate that DW-SPSO significantly outperforms recent state-of-the-art particle swarm optimization(PSO)variants in terms of path safety,smoothness,and convergence speed.The performance superiority is statistically validated by the Wilcoxon signed-rank test.The results confirm the algorithm’s effectiveness in generating high-quality UAV paths under diverse threat conditions,offering a robust solution for autonomous navigation systems.展开更多
In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional...In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional(3D)environment is transformed into an optimization problem by introducing the fitness function and constraints such as minimizing path length,maintaining a low and stable flight altitude,and avoiding threat zones.A multi-strategy hybrid grey wolf optimization(MSHGWO)algorithm is proposed to address this problem.Firstly,a chaotic Cubic mapping is introduced to initialize the grey wolf positions to make its initial position distribution more uniform.Secondly,an adaptive adjustment weight factor is designed,which can adjust the movement weight based on the rate of fitness value decrease within a unit Euclidean distance,thereby improving the quality of the population.Finally,an elite opposition-based learning strategy is introduced to improve the population diversity so that the population jumps out of the local optimum.Simulation results indicate that the MSHGWO is capable of generating constraint-compliant paths for each UAV in complex 3D environments.Furthermore,the MSHGWO outperforms other algorithms in terms of convergence speed and solution quality.Meanwhile,flight experiments were conducted to validate the path planning capability of MSHGWO in real-world obstacle environments,further demonstrating the feasibility of the proposed multi-UAV cooperative path planning approach.展开更多
In order to cope with the global environmental crisis caused by energy generation and achieve carbon neutrality,it is imperative to promote a new power system dominated by renewable energy sources(RESs).This paper foc...In order to cope with the global environmental crisis caused by energy generation and achieve carbon neutrality,it is imperative to promote a new power system dominated by renewable energy sources(RESs).This paper focuses on the uncertainty of RESs and the distribution characteristics of carbon emission flows(CEFs),and studies the low-carbon operation and power system planning problem.Firstly,this paper extends the uncertainty of RES to the meteorological field and establishes meteorological robust constraints of photovoltaic(PV)generation.Based on the CEF theory,the carbon transmission trajectory is accurately delineated to improve the operation of power system.Considering further constraints from the power flow,CEF,and component operation characteristics of the active distribution network(ADN),this paper formulates a low-carbon joint planning model of ADN with PV,battery energy storage system(BESS),and distributed gas generator(DGG),taking into account economy and carbon reduction.In the case study,the low-carbon planning and operation scheme are analyzed in detail across multiple dimensions including time and space.The solution results show that the planning model can effectively leverage the low-carbon performance of PV and BESS,and improve the distribution of CEF.Through case comparison,the model can also efficiently reduce the total cost of the system and enhance carbon emission reduction benefits by 35.10 to 41.04%.展开更多
In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF n...In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.展开更多
Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic ...Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.展开更多
Spiking Neural Network(SNN)inspired by the biological triggering mechanism of neurons to provide a novel solution for plant disease detection,offering enhanced performance and efficiency in contrast to Artificial Neur...Spiking Neural Network(SNN)inspired by the biological triggering mechanism of neurons to provide a novel solution for plant disease detection,offering enhanced performance and efficiency in contrast to Artificial Neural Networks(ANN).Unlike conventional ANNs,which process static images without fully capturing the inherent temporal dynamics,our approach represents the first implementation of SNNs tailored explicitly for agricultural disease classification,integrating an encoding method to convert static RGB plant images into temporally encoded spike trains.Additionally,while Bernoulli trials and standard deep learning architectures likeConvolutionalNeuralNetworks(CNNs)and Fully Connected Neural Networks(FCNNs)have been used extensively,our work is the first to integrate these trials within an SNN framework specifically for agricultural applications.This integration not only refines spike regulation and reduces computational overhead by 30%but also delivers superior accuracy(93.4%)in plant disease classification,marking a significant advancement in precision agriculture that has not been previously explored.Our approach uniquely transforms static plant leaf images into time-dependent representations,leveraging SNNs’intrinsic temporal processing capabilities.This approach aligns with the inherent ability of SNNs to capture dynamic,timedependent patterns,making them more suitable for detecting disease activations in plants than conventional ANNs that treat inputs as static entities.Unlike prior works,our hybrid encoding scheme dynamically adapts to pixel intensity variations(via threshold),enabling robust feature extraction under diverse agricultural conditions.The dual-stage preprocessing customizes the SNN’s behavior in two ways:the encoding threshold is derived from pixel distributions in diseased regions,and Bernoulli trials selectively reduce redundant spikes to ensure energy efficiency on low-power devices.We used a comprehensive dataset of 87,000 RGB images of plant leaves,which included 38 distinct classes of healthy and unhealthy leaves.To train and evaluate three distinct neural network architectures,DeepSNN,SimpleCNN,and SimpleFCNN,the dataset was rigorously preprocessed,including stochastic rotation,horizontal flip,resizing,and normalization.Moreover,by integrating Bernoulli trials to regulate spike generation,ourmethod focuses on extracting themost relevant featureswhile reducingcomputational overhead.Using a comprehensivedatasetof87,000RGB images across 38 classes,we rigorously preprocessed the data and evaluated three architectures:DeepSNN,SimpleCNN,and SimpleFCNN.The results demonstrate that DeepSNN outperforms the other models,achieving superior accuracy,efficient feature extraction,and robust spike management,thereby establishing the potential of SNNs for real-time,energy-efficient agricultural applications.展开更多
Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power o...Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power optimization based on clustering-local relaxation-correction is proposed.Firstly,the k-medoids clustering algorithm is used to divide the reduced power scene into periods.Then,the discrete variables and continuous variables are optimized in the same period of time.Finally,the number of input groups of parallel capacitor banks(CB)in multiple periods is fixed,and then the secondary static reactive power optimization correction is carried out by using the continuous reactive power output device based on the static reactive power compensation device(SVC),the new energy grid-connected inverter,and the electric vehicle charging station.According to the characteristics of the model,a hybrid optimization algorithm with a cross-feedback mechanism is used to solve different types of variables,and an improved artificial hummingbird algorithm based on tent chaotic mapping and adaptive mutation is proposed to improve the solution efficiency.The simulation results show that the proposed decoupling strategy can obtain satisfactory optimization resultswhile strictly guaranteeing the dynamic constraints of discrete variables,and the hybrid algorithm can effectively solve the mixed integer nonlinear optimization problem.展开更多
To avoid collisions between a suspended object,cables,towing robots,and obstacles in the environment in a multi-robot suspension system,obstacle avoidance planning was studied based on a collaborative optimization met...To avoid collisions between a suspended object,cables,towing robots,and obstacles in the environment in a multi-robot suspension system,obstacle avoidance planning was studied based on a collaborative optimization method for force and position.Based on the analysis of the kinematics and dynamics of the system,the inverse kinematics and inverse dynamics of the system are solved using the least variance method.The obstacle avoidance planning is performed in the solved collisionfree feasible space using the stable dung beetle optimization(SDBO)algorithm,which ensures that the suspended object can move stably to the target point in the workspace.The optimal obstacle avoidance trajectory of the multi-robot suspension system can be accurately determined by using the collaborative optimization method for force and position to plan the towing robot and the cable.Finally,the correctness of the obstacle avoidance planning method is verified by simulations.By taking a special scenario,the remarkable findings reveal that the SDBO algorithm outperforms the dung beetle optimization algorithm by reducing the length of the planned trajectory of the suspended object by 14.51%and the height by 79.88%,and reducing the minimum fitness by 95.84%and the average fitness by 94.77%.The results can help the multi-robot suspension system to perform various towing tasks safely and stably,and extend the related planning and control theory.展开更多
基金supported by the Ministry of Science and High Education of the Russian Federation by the grant 075-15-2022-1137supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R323),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN planning remains a challenge,especially in scenarios where traditional search algorithms struggle to navigate the vast solution space efficiently.This research proposes a novel technique to enhance HTN planning by integrating the Ant Colony Optimization(ACO)algorithm into the refinement process.The Ant System algorithm,inspired by the foraging behavior of ants,is well-suited for addressing optimization problems by efficiently exploring solution spaces.By incorporating ACO into the refinement phase of HTN planning,the authors aim to leverage its adaptive nature and decentralized decision-making to improve plan generation.This paper involves the development of a hybrid strategy called ACO-HTN,which combines HTN planning with ACO-based plan selection.This technique enables the system to adaptively refine plans by guiding the search towards optimal solutions.To evaluate the effectiveness of the proposed technique,this paper conducts empirical experiments on various domains and benchmark datasets.Our results demonstrate that the ACO-HTN strategy enhances the efficiency and effectiveness of HTN planning,outperforming traditional methods in terms of solution quality and computational performance.
基金supported by the National Science and Technology Council,Taiwan,under Grants 113-2221-E-260-014-MY2 and 114-2119-M-033-001.
文摘The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)while maintaining cost-efficiency and sustainable deployment.Traditional strategies struggle with complex 3D propagation,building penetration loss,and the balance between coverage and infrastructure cost.To address this challenge,this study presents the first application of a Global-best Guided Quantum-inspired Tabu Search with Quantum-Not Gate(GQTS-QNG)framework for 3D base-station deployment optimization.The problem is formulated as a multi-objective model that simultaneously maximizes coverage and minimizes deployment cost.A binary-to-decimal encodingmechanism is designed to represent discrete placement coordinates and base station types,leveraging a quantum-inspired method to efficiently search and refine solutions within challenging combinatorial environments.Global-best guidance and tabu memory are integrated to strengthen convergence stability and avoid revisiting previously explored solutions.Simulation results across user densities ranging from 1000 to 10,000 show that GQTS-QNG consistently finds deployment configurations achieving full coverage while reducing deployment cost compared with the state-of-the-art algorithms under equal iteration times.Additionally,our method generates welldistributed and structured Pareto fronts,offering diverse planning options that allow operators to flexibly balance cost and performance requirements.These findings demonstrate that GQTS-QNG is a scalable and efficient algorithm for sustainable 3D cellular network deployment in B5G/6G urban scenarios.
基金Projects(70373017 70572090) supported by the National Natural Science Foundation of China
文摘Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, network reliability and the network loss are the main objective of transmission network planning. Combined with set pair analysis (SPA), particle swarm optimization (PSO), neural network (NN), a hybrid particle swarm optimization model was established with neural network and set pair analysis for transmission network planning (HPNS). Firstly, the contact degree of set pair analysis was introduced, the traditional goal set was converted into the collection of the three indicators including the identity degree, difference agree and contrary degree. On this bases, using shi(H), the three objective optimization problem was converted into single objective optimization problem. Secondly, using the fast and efficient search capabilities of PSO, the transmission network planning model based on set pair analysis was optimized. In the process of optimization, by improving the BP neural network constantly training so that the value of the fitness function of PSO becomes smaller in order to obtain the optimization program fitting the three objectives better. Finally, compared HPNS with PSO algorithm and the classic genetic algorithm, HPNS increased about 23% efficiency than THA, raised about 3.7% than PSO and improved about 2.96% than GA.
基金This work was fully supported by U Nyi Hla Nge Foundation at Yangon Technological University,Gyogone,Insein PO,11011,Yangon,Myanmar。
文摘The paper mainly focuses on the network planning and optimization problem in the 5G telecommunication system based on the numerical investigation.There have been two portions of this work,such as network planning for efficient network models and optimization of power allocation in the 5G network.The radio network planning process has been completed based on a specific area.The data rate requirement can be solved by allowing the densification of the system by deploying small cells.The radio network planning scheme is the indispensable platform in arranging a wireless network that encounters convinced coverage method,capacity,and Quality of Service necessities.In this study,the eighty micro base stations and two-hundred mobile stations are deployed in the-15km×15km wide selected area in the Yangon downtown area.The optimization processes were also analyzed based on the source and destination nodes in the 5G network.The base stations’location is minimized and optimized in a selected geographical area with the linear programming technique and analyzed in this study.
基金Supported by National Natural Science Foundation of China (50177017)Important science and technology research project of Shanghai China (041612012)National Power Grid Company subsidized Research SGZL[2004]151.
文摘The author introduced particle swarm optimization as a new method for power transmission network expansion planning. A new discrete method for particle swarm optimization was developed,which is suitable for power transmission network expansion planning, and requires less computer s memory.The optimization fitness function construction, parameter selection, convergence judgement, and their characters were analyzod.Numerical simulation demonstrated the effectiveness and correctness or the method. This paper provides an academic and practical basis of particle swarm optimization in application of transmission network expansion planning for further investigation.
基金supported by the National Natural Science Foundation of China(Nos.T2121003,U24B20156)Open Fund of the National Key Laboratory of Helicopter Aeromechanics(No.2024-ZSJ-LB-02-06)。
文摘In dynamic and uncertain reconnaissance missions,effective task assignment and path planning for multiple unmanned aerial vehicles(UAVs)present significant challenges.A stochastic multi-UAV reconnaissance scheduling problem is formulated as a combinatorial optimization task with nonlinear objectives and coupled constraints.To solve the non-deterministic polynomial(NP)-hard problem efficiently,a novel learning-enhanced pigeon-inspired optimization(L-PIO)algorithm is proposed.The algorithm integrates a Q-learning mechanism to dynamically regulate control parameters,enabling adaptive exploration–exploitation trade-offs across different optimization phases.Additionally,geometric abstraction techniques are employed to approximate complex reconnaissance regions using maximum inscribed rectangles and spiral path models,allowing for precise cost modeling of UAV paths.The formal objective function is developed to minimize global flight distance and completion time while maximizing reconnaissance priority and task coverage.A series of simulation experiments are conducted under three scenarios:static task allocation,dynamic task emergence,and UAV failure recovery.Comparative analysis with several updated algorithms demonstrates that L-PIO exhibits superior robustness,adaptability,and computational efficiency.The results verify the algorithm's effectiveness in addressing dynamic reconnaissance task planning in real-time multi-UAV applications.
基金supported by the Science and Technology Project of Sichuan Electric Power Company“Power Supply Guarantee Strategy for Urban Distribution Networks Considering Coordination with Virtual Power Plant during Extreme Weather Event”(No.521920230003).
文摘Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.
文摘A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.
基金supported by the National Natural Science Foundation of China (Nos. 61202351, 61271255)the Natural Science Foundation of Jiangsu Province (No. BK20131068)+2 种基金the Open Research Fund of National Mobile Communications Research Laboratory in Southeast University (No. 2012D15)the Funding of Jiangsu Innovation Program for Graduate Education (No. CXLX11_0202)the Fundamental Research Funds for the Central Universities
文摘Recently, unmanned aerial vehicles （UAVs） acting as relay platforms have attracted considerable attention due to the advantages of extending coverage and improving connectivity for long-range communications. Specifically, in the scenario where the access point （AP） is mobile, a UAV needs to find an efficient path to guarantee the connectivity of the relay link. Motivated by this fact, this paper proposes an optimal design for beamforming （BF） and UAV path planning. First of all, we study a dual-hop amplify-and-forward （AF） wireless relay network, in which a UAV is used as relay between a mobile AP and a fixed base station （BS）. In the network, both of the AP and the BS are equipped with multiple antennas, whereas the UAV has a single antenna. Then, we obtain the output signal^to-noise ratio （SNR） of the dual-hop relay network. Based on the criterion of maximizing the output SNR, we develop an optimal design to obtain the solution of the optimal BF weight vector and the UAV heading angle. Next, we derive the closed-form outage probability （OP） expression to investigate the performance of the dual-hop relay network conveniently. Finally, computer simulations show that the proposed approach can obtain nearly optimal flying path and OP performance, indicating the effectiveness of the proposed algorithm. Furthermore, we find that increasing the antenna number at the BS or the maximal heading angle can significantly improve the performance of the considered relay network.
基金Supported by the National Nature Science Foundation of China,the Research Foundation of General Corporation of China Petro-Chemical Industry and the Natural Science and Engineering Research Council of Canada.
文摘A strategy of developing on-line optimization intelligent systems based on combiningflowsheeting simulation and optimization package with artificial neural networks(ANN)is presented inthis paper.A number of optimization cases for a certain chemical plant are obtained off-line byusing PROCESS-Ⅱ or other flowsheeting programming with optimization.Then,taking these cases astraining examples,we establish a neural network systems which can be used on-line as an optimizer toobtain setpoints from input data sampled from distributed control system through gross error detectionand data reconciliation procedures.Such an on-line optimizer possesses two advantages over nonlinearprogramming package:first of all,there is no convergence problem for the trained ANN to be usedonline;secondly,the frequency for setpoints updating is not limited because only algebraic calculationrather than optimization is required to be carried out on-line.Here two key problems ofimplementing ANN approaches to the on-line optimization
文摘The continuously growing of cellular networks complexity, which followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (such as the environmental one) of the cellular network, are shown.
基金National Natural Science Foundation of China,No.41671497。
文摘Improving maternal health is one of the Sustainable Development Goals.Hospital service areas(HSAs),which contain most hospitalization behaviors at the local scale,are crucial for health care planning.However,little attention has been given to HSAs for maternal care and the hierarchy structure.Considering Hubei,central China,as a case study,this study aims to fill these gaps by developing a method for delineating hierarchical HSAs for maternal care using a network optimization approach.The approach is driven by actual patient flow data and has an explicit objective to maximize the modularity.It also establishes the hierarchical structure of maternal care HSAs,which is fundamental for the planning of hierarchical maternal care and referral systems.In our case study,45 secondary HSAs and 22tertiary HSAs are delineated to achieve maximal modularity.The HSAs perform well in terms of indices such as the Localization Index and Market Share Index.Furthermore,there is a complementary relationship between secondary and tertiary hospitals,which suggests the need for referral system planning.This study can provide evidence for the validity of the HSA and the planning of maternal care HSAs in China.It also provides transferable methods for planning hierarchical HSAs in other developing countries.
基金supported by the National Natural Science Foundation of China(Grant No.62106092)the Natural Science Foundation of Fujian Province(Grant Nos.2024J01822,2025J01981)the Natural Science Foundation of Zhangzhou City(Grant No.ZZ2024J28).
文摘Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies.Additionally,the non-linear nature of cost functions can cause algorithms to become trapped in local optima.Furthermore,there is often a lack of adequate consideration for real-world constraints,for example,due to the necessity for obstacle avoidance or because of the restrictions of flight safety.To address the aforementioned issues,this paper proposes a dynamic weighted spherical particle swarm optimization(DW-SPSO)algorithm.The algorithm adopts a dual Sigmoid-based adaptive weight adjustment mechanism for balancing global exploration and local exploitation,as well as a lens-based opposition learning one to improve search flexibility and solution diversity.Simulation experiments on real digital elevation models demonstrate that DW-SPSO significantly outperforms recent state-of-the-art particle swarm optimization(PSO)variants in terms of path safety,smoothness,and convergence speed.The performance superiority is statistically validated by the Wilcoxon signed-rank test.The results confirm the algorithm’s effectiveness in generating high-quality UAV paths under diverse threat conditions,offering a robust solution for autonomous navigation systems.
文摘In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional(3D)environment is transformed into an optimization problem by introducing the fitness function and constraints such as minimizing path length,maintaining a low and stable flight altitude,and avoiding threat zones.A multi-strategy hybrid grey wolf optimization(MSHGWO)algorithm is proposed to address this problem.Firstly,a chaotic Cubic mapping is introduced to initialize the grey wolf positions to make its initial position distribution more uniform.Secondly,an adaptive adjustment weight factor is designed,which can adjust the movement weight based on the rate of fitness value decrease within a unit Euclidean distance,thereby improving the quality of the population.Finally,an elite opposition-based learning strategy is introduced to improve the population diversity so that the population jumps out of the local optimum.Simulation results indicate that the MSHGWO is capable of generating constraint-compliant paths for each UAV in complex 3D environments.Furthermore,the MSHGWO outperforms other algorithms in terms of convergence speed and solution quality.Meanwhile,flight experiments were conducted to validate the path planning capability of MSHGWO in real-world obstacle environments,further demonstrating the feasibility of the proposed multi-UAV cooperative path planning approach.
基金supported by the Key Program of National Natural Science Foundation of China under Grant 52130702.
文摘In order to cope with the global environmental crisis caused by energy generation and achieve carbon neutrality,it is imperative to promote a new power system dominated by renewable energy sources(RESs).This paper focuses on the uncertainty of RESs and the distribution characteristics of carbon emission flows(CEFs),and studies the low-carbon operation and power system planning problem.Firstly,this paper extends the uncertainty of RES to the meteorological field and establishes meteorological robust constraints of photovoltaic(PV)generation.Based on the CEF theory,the carbon transmission trajectory is accurately delineated to improve the operation of power system.Considering further constraints from the power flow,CEF,and component operation characteristics of the active distribution network(ADN),this paper formulates a low-carbon joint planning model of ADN with PV,battery energy storage system(BESS),and distributed gas generator(DGG),taking into account economy and carbon reduction.In the case study,the low-carbon planning and operation scheme are analyzed in detail across multiple dimensions including time and space.The solution results show that the planning model can effectively leverage the low-carbon performance of PV and BESS,and improve the distribution of CEF.Through case comparison,the model can also efficiently reduce the total cost of the system and enhance carbon emission reduction benefits by 35.10 to 41.04%.
文摘In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005Innovation Project of Guangxi Graduate Education under Grant No.YCSW2024313.
文摘Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.
基金supported in part by the Basic Science Research Program through the National Research Foundation of Korea(NRF),funded by the Ministry of Education(NRF-2021R1A6A1A03039493).
文摘Spiking Neural Network(SNN)inspired by the biological triggering mechanism of neurons to provide a novel solution for plant disease detection,offering enhanced performance and efficiency in contrast to Artificial Neural Networks(ANN).Unlike conventional ANNs,which process static images without fully capturing the inherent temporal dynamics,our approach represents the first implementation of SNNs tailored explicitly for agricultural disease classification,integrating an encoding method to convert static RGB plant images into temporally encoded spike trains.Additionally,while Bernoulli trials and standard deep learning architectures likeConvolutionalNeuralNetworks(CNNs)and Fully Connected Neural Networks(FCNNs)have been used extensively,our work is the first to integrate these trials within an SNN framework specifically for agricultural applications.This integration not only refines spike regulation and reduces computational overhead by 30%but also delivers superior accuracy(93.4%)in plant disease classification,marking a significant advancement in precision agriculture that has not been previously explored.Our approach uniquely transforms static plant leaf images into time-dependent representations,leveraging SNNs’intrinsic temporal processing capabilities.This approach aligns with the inherent ability of SNNs to capture dynamic,timedependent patterns,making them more suitable for detecting disease activations in plants than conventional ANNs that treat inputs as static entities.Unlike prior works,our hybrid encoding scheme dynamically adapts to pixel intensity variations(via threshold),enabling robust feature extraction under diverse agricultural conditions.The dual-stage preprocessing customizes the SNN’s behavior in two ways:the encoding threshold is derived from pixel distributions in diseased regions,and Bernoulli trials selectively reduce redundant spikes to ensure energy efficiency on low-power devices.We used a comprehensive dataset of 87,000 RGB images of plant leaves,which included 38 distinct classes of healthy and unhealthy leaves.To train and evaluate three distinct neural network architectures,DeepSNN,SimpleCNN,and SimpleFCNN,the dataset was rigorously preprocessed,including stochastic rotation,horizontal flip,resizing,and normalization.Moreover,by integrating Bernoulli trials to regulate spike generation,ourmethod focuses on extracting themost relevant featureswhile reducingcomputational overhead.Using a comprehensivedatasetof87,000RGB images across 38 classes,we rigorously preprocessed the data and evaluated three architectures:DeepSNN,SimpleCNN,and SimpleFCNN.The results demonstrate that DeepSNN outperforms the other models,achieving superior accuracy,efficient feature extraction,and robust spike management,thereby establishing the potential of SNNs for real-time,energy-efficient agricultural applications.
基金funded by the“Research and Application Project of Collaborative Optimization Control Technology for Distribution Station Area for High Proportion Distributed PV Consumption(4000-202318079A-1-1-ZN)”of the Headquarters of the State Grid Corporation.
文摘Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power optimization based on clustering-local relaxation-correction is proposed.Firstly,the k-medoids clustering algorithm is used to divide the reduced power scene into periods.Then,the discrete variables and continuous variables are optimized in the same period of time.Finally,the number of input groups of parallel capacitor banks(CB)in multiple periods is fixed,and then the secondary static reactive power optimization correction is carried out by using the continuous reactive power output device based on the static reactive power compensation device(SVC),the new energy grid-connected inverter,and the electric vehicle charging station.According to the characteristics of the model,a hybrid optimization algorithm with a cross-feedback mechanism is used to solve different types of variables,and an improved artificial hummingbird algorithm based on tent chaotic mapping and adaptive mutation is proposed to improve the solution efficiency.The simulation results show that the proposed decoupling strategy can obtain satisfactory optimization resultswhile strictly guaranteeing the dynamic constraints of discrete variables,and the hybrid algorithm can effectively solve the mixed integer nonlinear optimization problem.
基金supported by the Excellent Graduate Student“Innovation Star”project of Education Department of Gansu Province(Grant No.2025CXZX-675)the National Natural Science Foundation of China(Grant No.51965032)+3 种基金the National Natural Science Foundation of Gansu Province of China(Grant No.22JR5RA319)the Excellent Doctoral Student Foundation of Gansu Province of China(Grant No.23JRRA842)the Open Project of State Key Laboratory of Rail Transit Vehicle System,Southwest Jiaotong University(Grant No.RVL2411)the Key Research and Development Project of Lanzhou Jiaotong University(Grant No.LZJTU-ZDYF2302).
文摘To avoid collisions between a suspended object,cables,towing robots,and obstacles in the environment in a multi-robot suspension system,obstacle avoidance planning was studied based on a collaborative optimization method for force and position.Based on the analysis of the kinematics and dynamics of the system,the inverse kinematics and inverse dynamics of the system are solved using the least variance method.The obstacle avoidance planning is performed in the solved collisionfree feasible space using the stable dung beetle optimization(SDBO)algorithm,which ensures that the suspended object can move stably to the target point in the workspace.The optimal obstacle avoidance trajectory of the multi-robot suspension system can be accurately determined by using the collaborative optimization method for force and position to plan the towing robot and the cable.Finally,the correctness of the obstacle avoidance planning method is verified by simulations.By taking a special scenario,the remarkable findings reveal that the SDBO algorithm outperforms the dung beetle optimization algorithm by reducing the length of the planned trajectory of the suspended object by 14.51%and the height by 79.88%,and reducing the minimum fitness by 95.84%and the average fitness by 94.77%.The results can help the multi-robot suspension system to perform various towing tasks safely and stably,and extend the related planning and control theory.
