This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously a...This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration.展开更多
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish...This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.展开更多
Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existin...Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existing algorithms often treat this as a single-objective optimization problem,whereas in reality,it should be multi-objective,considering factors such as distance,safety,and smoothness simultaneously.Secondly,the limited availability of optimization results arises due to they are single-path,which fail to meet real-world conditions.To address these challenges,first of all,an improved AUV path planning model is proposed,in which the collisions of path and obstacles are classified more specifically.Subsequently,a novel Altruistic Nurturing Algorithm(ANA)inspired by natural altruism is introduced.In the algorithm,nurturing cost considering Pareto rank and crowd distance is introduced as guidance of evolution to avoid futile calculation,abandonment threshold is self-adaptive with descendant situation to help individuals escape from local optima and double selection strategy combining crowd and k-nearest neighbors selection helps to get a better-distributed Pareto front.Experimental results comparing ANA with existing algorithms in AUV path planning demonstrate its superiority.Finally,a user-friendly interface,the Multi-Objective AUV Path Planner,is designed to provide users with a group of paths for informed decisionmaking.展开更多
Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed o...Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed or targets failed to be executed.To improve the mission reliability,a resilient mission planning framework integrates task pre-and re-assignment modules is developed in this paper.In the task pre-assignment phase,to guarantee the mission reliability,probability constraints regarding the minimum mission success rate are imposed to establish a multi-objective optimization model.And an improved genetic algorithm with the multi-population mechanism and specifically designed evolutionary operators is used for efficient solution.As in the task-reassignment phase,possible trigger events are first analyzed.A real-time contract net protocol-based algorithm is then proposed to address the corresponding emergency scenario.And the dual objective used in the former phase is adapted into a single objective to keep a consistent combat intention.Three cases of different scales demonstrate that the two modules cooperate well with each other.On the one hand,the pre-assignment module can generate high-reliability mission schedules as an elaborate mathematical model is introduced.On the other hand,the re-assignment module can efficiently respond to various emergencies and adjust the original schedule within a millisecond.The corresponding animation is accessible at bilibili.com/video/BV12t421w7EE for better illustration.展开更多
The close proximity and the necessity of coordination between multiple high-voltage direct currents(HVDCs)raise the issue of grid partitioning in multi-infeed HVDC systems.A multi-objective partition strategy is propo...The close proximity and the necessity of coordination between multiple high-voltage direct currents(HVDCs)raise the issue of grid partitioning in multi-infeed HVDC systems.A multi-objective partition strategy is proposed in this paper.Several types of relationships to be coordinated and complemented are analyzed and formulated using quantitative indices.According to the graph theory,the HVDC partition is transformed into a graph-cut problem and solved via the spectral clustering algorithm.Finally,the proposed method is validated for a practical multi-HVDC grid,confirming its feasibility and effectiveness.展开更多
The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to an...The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.展开更多
Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptio...Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptions due to its subtropical monsoon climate,including typhoons and gusty winds,present ongoing challenges.Despite the growing focus on operational costs and third-party risks,research on low-altitude urban wind fields remains scarce.This study addresses this gap by integrating wind field analysis into UAV path planning,introducing key innovations to the classical model.First,UAV wind resistance and turbulence constraints are analyzed,mapping high-wind-speed and turbulence-prone zones in the airspace.Second,wind dynamics are incorporated into path planning by considering airspeed and groundspeed variation,optimizing waypoint selection and flight speed adjustments to improve overall energy efficiency.Additionally,a wind-aware Theta*algorithm is proposed,leveraging wind vectors to expedite search process,while Computational Fluid Dynamics(CFD)techniques are employed to calculate wind fields.A case study of Shenzhen,examining wind patterns over the past decade,demonstrates a 6.23%improvement in groundspeed and a 7.69%reduction in energy consumption compared to wind-agnostic models.This framework advances UAV logistics by enhancing route safety and energy efficiency,contributing to more cost-effective operations.展开更多
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.展开更多
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr...Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.展开更多
Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based...Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based car-following(CF)framework employing the Deep Deterministic Policy Gradient(DDPG)algorithm,which integrates a multi-objective reward function that balances the four goals while maintaining safe policy learning.Utilizing real-world driving data from the highD dataset,the proposed model learns adaptive speed control policies suitable for dynamic traffic scenarios.The performance of the DRL-based model is evaluated against a traditional model predictive control-adaptive cruise control(MPC-ACC)controller.Results show that theDRLmodel significantly enhances safety,achieving zero collisions and a higher average time-to-collision(TTC)of 8.45 s,compared to 5.67 s for MPC and 6.12 s for human drivers.For efficiency,the model demonstrates 89.2% headway compliance and maintains speed tracking errors below 1.2 m/s in 90% of cases.In terms of energy optimization,the proposed approach reduces fuel consumption by 5.4% relative to MPC.Additionally,it enhances passenger comfort by lowering jerk values by 65%,achieving 0.12 m/s3 vs.0.34 m/s3 for human drivers.A multi-objective reward function is integrated to ensure stable policy convergence while simultaneously balancing the four key performance metrics.Moreover,the findings underscore the potential of DRL in advancing autonomous vehicle control,offering a robust and sustainable solution for safer,more efficient,and more comfortable transportation systems.展开更多
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.展开更多
Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.Howev...Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.However,traditional approaches frequently rely on single-objective optimization methods which are insufficient for capturing the complexity of such problems.To address this limitation,we introduce MDMOSA(Multi-objective Dwarf Mongoose Optimization with Simulated Annealing),a hybrid that integrates multi-objective optimization for efficient task scheduling in Infrastructure-as-a-Service(IaaS)cloud environments.MDMOSA harmonizes the exploration capabilities of the biologically inspired Dwarf Mongoose Optimization(DMO)with the exploitation strengths of Simulated Annealing(SA),achieving a balanced search process.The algorithm aims to optimize task allocation by reducing makespan and financial cost while improving system resource utilization.We evaluate MDMOSA through extensive simulations using the real-world Google Cloud Jobs(GoCJ)dataset within the CloudSim environment.Comparative analysis against benchmarked algorithms such as SMOACO,MOTSGWO,and MFPAGWO reveals that MDMOSA consistently achieves superior performance in terms of scheduling efficiency,cost-effectiveness,and scalability.These results confirm the potential of MDMOSA as a robust and adaptable solution for resource scheduling in dynamic and heterogeneous cloud computing infrastructures.展开更多
Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structu...Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.展开更多
In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and red...In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces s...Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces several unsolved challenges.Specifically,communication costs and system heterogeneity,such as nonidentical data distribution,hinder federated learning's progress.Several approaches have recently emerged for federated learning involving heterogeneous clients with varying computational capabilities(namely,heterogeneous federated learning).However,heterogeneous federated learning faces two key challenges:optimising model size and determining client selection ratios.Moreover,efficiently aggregating local models from clients with diverse capabilities is crucial for addressing system heterogeneity and communication efficiency.This paper proposes an evolutionary multiobjective optimisation framework for heterogeneous federated learning(MOHFL)to address these issues.Our approach elegantly formulates and solves a biobjective optimisation problem that minimises communication cost and model error rate.The decision variables in this framework comprise model sizes and client selection ratios for each Q client cluster,yielding a total of 2×Q optimisation parameters to be tuned.We develop a partition-based strategy for MOHFL that segregates clients into clusters based on their communication and computation capabilities.Additionally,we implement an adaptive model sizing mechanism that dynamically assigns appropriate subnetwork architectures to clients based on their computational constraints.We also propose a unified aggregation framework to combine models of varying sizes from heterogeneous clients effectively.Extensive experiments on multiple datasets demonstrate the effectiveness and superiority of our proposed method compared to existing approaches.展开更多
Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning p...Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning problems.However,Q-learning faces challenges in search and update efficiency.To address these issues,we propose an improved Q-learning(IQL)algorithm.We use an enhanced Ant Colony Optimization(ACO)algorithmto optimizeQtable initialization.We also introduce the UCH mechanism to refine the reward function and overcome the exploration dilemma.The IQL algorithm is extensively tested in three grid environments of different scales.The results validate the accuracy of themethod and demonstrate superior path-planning performance compared to traditional approaches.The algorithm reduces the number of trials required for convergence,improves learning efficiency,and enables faster adaptation to environmental changes.It also enhances stability and accuracy by reducing the standard deviation of trials to zero.On grid maps of different sizes,IQL achieves higher expected returns.Compared with the original Q-learning algorithm,IQL improves performance by 12.95%,18.28%,and 7.98% on 10*10,20*20,and 30*30 maps,respectively.The proposed algorithm has promising applications in robotics,path planning,intelligent transportation,aerospace,and game development.展开更多
With the expanding applications of unmanned aerial vehicles(UAVs),precise flight evaluation has emerged as a critical enabler for efficient path planning,directly impacting operational performance and safety.Tradition...With the expanding applications of unmanned aerial vehicles(UAVs),precise flight evaluation has emerged as a critical enabler for efficient path planning,directly impacting operational performance and safety.Traditional path planning algorithms typically combine Dubins curves with local optimization to minimize trajectory length under 3D spatial constraints.However,these methods often overlook the correlation between pilot control quality and UAV flight dynamics,limiting their adaptability in complex scenarios.In this paper,we propose an intelligent flight evaluation model specifically designed to enhancemulti-waypoint trajectory optimization algorithms.Our model leverages a decision tree to integrate attitude parameters and trajectory matching metrics,establishing a quantitative link between pilot control quality and UAV flight states.Experimental results demonstrate that the proposed model not only accurately assesses pilot performance across diverse skill levels but also improves the optimality of generated trajectories.When integrated with our path planning algorithm,it efficiently produces optimal trajectories while strictly adhering to UAV flight constraints.This integrated framework highlights significant potential for real-time UAV training,performance assessment,and adaptive mission planning applications.展开更多
Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrain...Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrained onboard devices to nearby Roadside Unit(RSU),thereby achieving lower delay and energy consumption.However,due to the limited storage capacity and energy budget of RSUs,it is challenging to meet the demands of the highly dynamic Internet of Vehicles(IoV)environment.Therefore,determining reasonable service caching and computation offloading strategies is crucial.To address this,this paper proposes a joint service caching scheme for cloud-edge collaborative IoV computation offloading.By modeling the dynamic optimization problem using Markov Decision Processes(MDP),the scheme jointly optimizes task delay,energy consumption,load balancing,and privacy entropy to achieve better quality of service.Additionally,a dynamic adaptive multi-objective deep reinforcement learning algorithm is proposed.Each Double Deep Q-Network(DDQN)agent obtains rewards for different objectives based on distinct reward functions and dynamically updates the objective weights by learning the value changes between objectives using Radial Basis Function Networks(RBFN),thereby efficiently approximating the Pareto-optimal decisions for multiple objectives.Extensive experiments demonstrate that the proposed algorithm can better coordinate the three-tier computing resources of cloud,edge,and vehicles.Compared to existing algorithms,the proposed method reduces task delay and energy consumption by 10.64%and 5.1%,respectively.展开更多
Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To addres...Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To address these challenges,this paper proposes a multi-objective trajectory optimization framework.The system dynamics capture both nonlinear rigid-flexible coupling and antenna deformation through a reduced-order formulation.To enhance discretization efficiency,a predictive-terminal hp-adaptive pseudospectral method is employed,assigning collocation density based on task-phase characteristics:finer resolution is applied to dynamic segments requiring higher accuracy,especially near the terminal phase.This enables efficient transcription of the continuous-time problem into a Nonlinear Programming Problem(NLP).The resulting NLP is then solved using a multi-objective optimization strategy based on the nondominated sorting genetic algorithm II,which explores trade-offs among antenna pointing accuracy,energy consumption,and structural vibration.Numerical results demonstrate that the proposed method achieves a reduction of approximately 14.0% in control energy and 41.8%in peak actuation compared to a GPOPS-II baseline,while significantly enhancing vibration suppression.The resulting Pareto front reveals structured trade-offs and clustered solutions,offering robust and diverse options for precision,low-disturbance mission planning.展开更多
文摘This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration.
基金Supported by the Natural Science Foundation of Zhejiang Province(No.LQ22F030015).
文摘This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.
基金supported by the Guangzhou City School Joint Found Project(SL2022A03J01009)the National Nature Science Foundation of China(Grant No.51975135)the Natural Science Foundation of Guangdong Province(2018A030310063).
文摘Solving the path planning problem of Autonomous Underwater Vehicles(AUVs)is crucial for reducing energy waste and improving operational efficiency.However,two main challenges hinder further development:Firstly,existing algorithms often treat this as a single-objective optimization problem,whereas in reality,it should be multi-objective,considering factors such as distance,safety,and smoothness simultaneously.Secondly,the limited availability of optimization results arises due to they are single-path,which fail to meet real-world conditions.To address these challenges,first of all,an improved AUV path planning model is proposed,in which the collisions of path and obstacles are classified more specifically.Subsequently,a novel Altruistic Nurturing Algorithm(ANA)inspired by natural altruism is introduced.In the algorithm,nurturing cost considering Pareto rank and crowd distance is introduced as guidance of evolution to avoid futile calculation,abandonment threshold is self-adaptive with descendant situation to help individuals escape from local optima and double selection strategy combining crowd and k-nearest neighbors selection helps to get a better-distributed Pareto front.Experimental results comparing ANA with existing algorithms in AUV path planning demonstrate its superiority.Finally,a user-friendly interface,the Multi-Objective AUV Path Planner,is designed to provide users with a group of paths for informed decisionmaking.
基金supported by the National Key Research and Development Plan(Grant No.2021YFB3302501)the National Natural Science Foundation of China(Grant Nos.12102077,12161076,U2241263).
文摘Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution reliability.During the practical execution phase,there are inevitable risks where UAVs being destroyed or targets failed to be executed.To improve the mission reliability,a resilient mission planning framework integrates task pre-and re-assignment modules is developed in this paper.In the task pre-assignment phase,to guarantee the mission reliability,probability constraints regarding the minimum mission success rate are imposed to establish a multi-objective optimization model.And an improved genetic algorithm with the multi-population mechanism and specifically designed evolutionary operators is used for efficient solution.As in the task-reassignment phase,possible trigger events are first analyzed.A real-time contract net protocol-based algorithm is then proposed to address the corresponding emergency scenario.And the dual objective used in the former phase is adapted into a single objective to keep a consistent combat intention.Three cases of different scales demonstrate that the two modules cooperate well with each other.On the one hand,the pre-assignment module can generate high-reliability mission schedules as an elaborate mathematical model is introduced.On the other hand,the re-assignment module can efficiently respond to various emergencies and adjust the original schedule within a millisecond.The corresponding animation is accessible at bilibili.com/video/BV12t421w7EE for better illustration.
基金supported by the Science and Technology Project of State Grid Corporation of China:“Control Strategy Optimization Technology for Large-Scale Photovoltaic Power Generation on the Sending-end and Receiving-end of DC Power System”(4000-201934198A-0-0-00)
文摘The close proximity and the necessity of coordination between multiple high-voltage direct currents(HVDCs)raise the issue of grid partitioning in multi-infeed HVDC systems.A multi-objective partition strategy is proposed in this paper.Several types of relationships to be coordinated and complemented are analyzed and formulated using quantitative indices.According to the graph theory,the HVDC partition is transformed into a graph-cut problem and solved via the spectral clustering algorithm.Finally,the proposed method is validated for a practical multi-HVDC grid,confirming its feasibility and effectiveness.
基金Supported by the National Basic Research Program of China ("973" Program)the National Natural Science Foundation of China (60872112, 10805012)+1 种基金the Natural Science Foundation of Zhejiang Province(Z207588)the College Science Research Project of Anhui Province (KJ2008B268)~~
文摘The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.
基金supported by the National Natural Science Foundation of China(No.U2433214)。
文摘Shenzhen,a major city in southern China,has experienced rapid advancements in Unmanned Aerial Vehicle(UAV)technology,resulting in extensive logistics networks with thousands of daily flights.However,frequent disruptions due to its subtropical monsoon climate,including typhoons and gusty winds,present ongoing challenges.Despite the growing focus on operational costs and third-party risks,research on low-altitude urban wind fields remains scarce.This study addresses this gap by integrating wind field analysis into UAV path planning,introducing key innovations to the classical model.First,UAV wind resistance and turbulence constraints are analyzed,mapping high-wind-speed and turbulence-prone zones in the airspace.Second,wind dynamics are incorporated into path planning by considering airspeed and groundspeed variation,optimizing waypoint selection and flight speed adjustments to improve overall energy efficiency.Additionally,a wind-aware Theta*algorithm is proposed,leveraging wind vectors to expedite search process,while Computational Fluid Dynamics(CFD)techniques are employed to calculate wind fields.A case study of Shenzhen,examining wind patterns over the past decade,demonstrates a 6.23%improvement in groundspeed and a 7.69%reduction in energy consumption compared to wind-agnostic models.This framework advances UAV logistics by enhancing route safety and energy efficiency,contributing to more cost-effective operations.
基金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.
基金National Natural Science Foundation of China(32301712)Natural Science Foundation of Jiangsu Province(BK20230548,BK20250876)+2 种基金Project of Faculty of Agricultural Equipment of Jiangsu University(NGXB20240203)A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD-2023-87)Open Funding Project of the Key Laboratory of Modern Agricultural Equipment and Technology(Jiangsu University),Ministry of Education(MAET202101)。
文摘Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.
基金the Hebei Province Science and Technology Plan Project(19221909D)rincess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R308),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based car-following(CF)framework employing the Deep Deterministic Policy Gradient(DDPG)algorithm,which integrates a multi-objective reward function that balances the four goals while maintaining safe policy learning.Utilizing real-world driving data from the highD dataset,the proposed model learns adaptive speed control policies suitable for dynamic traffic scenarios.The performance of the DRL-based model is evaluated against a traditional model predictive control-adaptive cruise control(MPC-ACC)controller.Results show that theDRLmodel significantly enhances safety,achieving zero collisions and a higher average time-to-collision(TTC)of 8.45 s,compared to 5.67 s for MPC and 6.12 s for human drivers.For efficiency,the model demonstrates 89.2% headway compliance and maintains speed tracking errors below 1.2 m/s in 90% of cases.In terms of energy optimization,the proposed approach reduces fuel consumption by 5.4% relative to MPC.Additionally,it enhances passenger comfort by lowering jerk values by 65%,achieving 0.12 m/s3 vs.0.34 m/s3 for human drivers.A multi-objective reward function is integrated to ensure stable policy convergence while simultaneously balancing the four key performance metrics.Moreover,the findings underscore the potential of DRL in advancing autonomous vehicle control,offering a robust and sustainable solution for safer,more efficient,and more comfortable transportation systems.
基金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.
文摘Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.However,traditional approaches frequently rely on single-objective optimization methods which are insufficient for capturing the complexity of such problems.To address this limitation,we introduce MDMOSA(Multi-objective Dwarf Mongoose Optimization with Simulated Annealing),a hybrid that integrates multi-objective optimization for efficient task scheduling in Infrastructure-as-a-Service(IaaS)cloud environments.MDMOSA harmonizes the exploration capabilities of the biologically inspired Dwarf Mongoose Optimization(DMO)with the exploitation strengths of Simulated Annealing(SA),achieving a balanced search process.The algorithm aims to optimize task allocation by reducing makespan and financial cost while improving system resource utilization.We evaluate MDMOSA through extensive simulations using the real-world Google Cloud Jobs(GoCJ)dataset within the CloudSim environment.Comparative analysis against benchmarked algorithms such as SMOACO,MOTSGWO,and MFPAGWO reveals that MDMOSA consistently achieves superior performance in terms of scheduling efficiency,cost-effectiveness,and scalability.These results confirm the potential of MDMOSA as a robust and adaptable solution for resource scheduling in dynamic and heterogeneous cloud computing infrastructures.
基金supported by the National Natural Science Foundation of China(No.12202295)the International(Regional)Cooperation and Exchange Projects of the National Natural Science Foundation of China(No.W2421002)+2 种基金the Sichuan Science and Technology Program(No.2025ZNSFSC0845)Zhejiang Provincial Natural Science Foundation of China(No.ZCLZ24A0201)the Fundamental Research Funds for the Provincial Universities of Zhejiang(No.GK249909299001-004)。
文摘Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.
基金supported by the National Natural Science Foundation of China under Grant No.61972040the Science and Technology Research and Development Project funded by China Railway Material Trade Group Luban Company.
文摘In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金supported by the National Research Foundation of Korea grant funded by the Korea government(RS-2023-00217116)。
文摘Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces several unsolved challenges.Specifically,communication costs and system heterogeneity,such as nonidentical data distribution,hinder federated learning's progress.Several approaches have recently emerged for federated learning involving heterogeneous clients with varying computational capabilities(namely,heterogeneous federated learning).However,heterogeneous federated learning faces two key challenges:optimising model size and determining client selection ratios.Moreover,efficiently aggregating local models from clients with diverse capabilities is crucial for addressing system heterogeneity and communication efficiency.This paper proposes an evolutionary multiobjective optimisation framework for heterogeneous federated learning(MOHFL)to address these issues.Our approach elegantly formulates and solves a biobjective optimisation problem that minimises communication cost and model error rate.The decision variables in this framework comprise model sizes and client selection ratios for each Q client cluster,yielding a total of 2×Q optimisation parameters to be tuned.We develop a partition-based strategy for MOHFL that segregates clients into clusters based on their communication and computation capabilities.Additionally,we implement an adaptive model sizing mechanism that dynamically assigns appropriate subnetwork architectures to clients based on their computational constraints.We also propose a unified aggregation framework to combine models of varying sizes from heterogeneous clients effectively.Extensive experiments on multiple datasets demonstrate the effectiveness and superiority of our proposed method compared to existing approaches.
基金Financial supports from the National Natural Science Foundation of China(GrantNo.52374123&51974144)Project of Liaoning Provincial Department of Education(GrantNo.LJKZ0340)Liaoning Revitalization Talents Program(Grant No.XLYC2211085)are greatly acknowledged.
文摘Q-learning is a classical reinforcement learning method with broad applicability.It can respond effectively to environmental changes and provide flexible strategies,making it suitable for solving robot path-planning problems.However,Q-learning faces challenges in search and update efficiency.To address these issues,we propose an improved Q-learning(IQL)algorithm.We use an enhanced Ant Colony Optimization(ACO)algorithmto optimizeQtable initialization.We also introduce the UCH mechanism to refine the reward function and overcome the exploration dilemma.The IQL algorithm is extensively tested in three grid environments of different scales.The results validate the accuracy of themethod and demonstrate superior path-planning performance compared to traditional approaches.The algorithm reduces the number of trials required for convergence,improves learning efficiency,and enables faster adaptation to environmental changes.It also enhances stability and accuracy by reducing the standard deviation of trials to zero.On grid maps of different sizes,IQL achieves higher expected returns.Compared with the original Q-learning algorithm,IQL improves performance by 12.95%,18.28%,and 7.98% on 10*10,20*20,and 30*30 maps,respectively.The proposed algorithm has promising applications in robotics,path planning,intelligent transportation,aerospace,and game development.
基金funded in part by the Fundamental Research Funds for the Central Universities under Grant NS2023052in part by the Natural Science Foundation of Jiangsu Province of China under Grants No.BK20231439 and No.BK20222012.
文摘With the expanding applications of unmanned aerial vehicles(UAVs),precise flight evaluation has emerged as a critical enabler for efficient path planning,directly impacting operational performance and safety.Traditional path planning algorithms typically combine Dubins curves with local optimization to minimize trajectory length under 3D spatial constraints.However,these methods often overlook the correlation between pilot control quality and UAV flight dynamics,limiting their adaptability in complex scenarios.In this paper,we propose an intelligent flight evaluation model specifically designed to enhancemulti-waypoint trajectory optimization algorithms.Our model leverages a decision tree to integrate attitude parameters and trajectory matching metrics,establishing a quantitative link between pilot control quality and UAV flight states.Experimental results demonstrate that the proposed model not only accurately assesses pilot performance across diverse skill levels but also improves the optimality of generated trajectories.When integrated with our path planning algorithm,it efficiently produces optimal trajectories while strictly adhering to UAV flight constraints.This integrated framework highlights significant potential for real-time UAV training,performance assessment,and adaptive mission planning applications.
基金supported by Key Science and Technology Program of Henan Province,China(Grant Nos.242102210147,242102210027)Fujian Province Young and Middle aged Teacher Education Research Project(Science and Technology Category)(No.JZ240101)(Corresponding author:Dong Yuan).
文摘Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrained onboard devices to nearby Roadside Unit(RSU),thereby achieving lower delay and energy consumption.However,due to the limited storage capacity and energy budget of RSUs,it is challenging to meet the demands of the highly dynamic Internet of Vehicles(IoV)environment.Therefore,determining reasonable service caching and computation offloading strategies is crucial.To address this,this paper proposes a joint service caching scheme for cloud-edge collaborative IoV computation offloading.By modeling the dynamic optimization problem using Markov Decision Processes(MDP),the scheme jointly optimizes task delay,energy consumption,load balancing,and privacy entropy to achieve better quality of service.Additionally,a dynamic adaptive multi-objective deep reinforcement learning algorithm is proposed.Each Double Deep Q-Network(DDQN)agent obtains rewards for different objectives based on distinct reward functions and dynamically updates the objective weights by learning the value changes between objectives using Radial Basis Function Networks(RBFN),thereby efficiently approximating the Pareto-optimal decisions for multiple objectives.Extensive experiments demonstrate that the proposed algorithm can better coordinate the three-tier computing resources of cloud,edge,and vehicles.Compared to existing algorithms,the proposed method reduces task delay and energy consumption by 10.64%and 5.1%,respectively.
基金supported by the National Natural Science Foundation of China(No.62173107).
文摘Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To address these challenges,this paper proposes a multi-objective trajectory optimization framework.The system dynamics capture both nonlinear rigid-flexible coupling and antenna deformation through a reduced-order formulation.To enhance discretization efficiency,a predictive-terminal hp-adaptive pseudospectral method is employed,assigning collocation density based on task-phase characteristics:finer resolution is applied to dynamic segments requiring higher accuracy,especially near the terminal phase.This enables efficient transcription of the continuous-time problem into a Nonlinear Programming Problem(NLP).The resulting NLP is then solved using a multi-objective optimization strategy based on the nondominated sorting genetic algorithm II,which explores trade-offs among antenna pointing accuracy,energy consumption,and structural vibration.Numerical results demonstrate that the proposed method achieves a reduction of approximately 14.0% in control energy and 41.8%in peak actuation compared to a GPOPS-II baseline,while significantly enhancing vibration suppression.The resulting Pareto front reveals structured trade-offs and clustered solutions,offering robust and diverse options for precision,low-disturbance mission planning.
