In the context of reducing its carbon emissions,the Chinese steel industry is currently undergoing an intelligent transformation to enhance its profitability and sustainability.The optimization of production planning ...In the context of reducing its carbon emissions,the Chinese steel industry is currently undergoing an intelligent transformation to enhance its profitability and sustainability.The optimization of production planning and scheduling plays a pivotal role in realizing these objectives such as improving production efficiency,saving energy,reducing carbon emissions,and enhancing quality.However,current practices in steel enterprises are largely dependent on experience-driven manual decision approaches supported by information systems,which are inadequate to meet the complex requirements of the industry.This study explores the current situation in production planning and scheduling,analyzes the characteristics and limitations of existing methods,and emphasizes the necessity and trends of intelligent systems.It surveys the current literature on production planning and scheduling in steel enterprises and analyzes the theoretical advancements and practical challenges associated with combinatorial and sequential optimization in this field.A key focus is on the limitations of current models and algorithms in effectively addressing the multi-objective and multiconstraint characteristics of steel produc-tion.To overcome these challenges,a novel framework for intelligent production planning and scheduling is proposed.This framework leverages data-and knowledge-driven decision-making and scenario adaptability,enabling the system to respond dynamically to real-time production conditions and market fluctuations.By integrating artificial intelligence and advanced optimization methodologies,the proposed framework improves the efficiency,cost-effectiveness,and environmental sustainability of steel manufacturing.展开更多
The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant ...The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant differences in operational costs and flexibility of various types of generation resources,as well as the volatility and uncertainty of renewable energy sources(such as wind and solar power)and the complex variability of load demand,the scheduling optimization of virtual power plants has become a critical issue that needs to be addressed.To solve this,this paper proposes an intelligent scheduling method for virtual power plants based on Deep Reinforcement Learning(DRL),utilizing Deep Q-Networks(DQN)for real-time optimization scheduling of dynamic peaking unit(DPU)and stable baseload unit(SBU)in the virtual power plant.By modeling the scheduling problem as a Markov Decision Process(MDP)and designing an optimization objective function that integrates both performance and cost,the scheduling efficiency and economic performance of the virtual power plant are significantly improved.Simulation results show that,compared with traditional scheduling methods and other deep reinforcement learning algorithms,the proposed method demonstrates significant advantages in key performance indicators:response time is shortened by up to 34%,task success rate is increased by up to 46%,and costs are reduced by approximately 26%.Experimental results verify the efficiency and scalability of the method under complex load environments and the volatility of renewable energy,providing strong technical support for the intelligent scheduling of virtual power plants.展开更多
Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device ...Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.展开更多
Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan ...Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan is one of the crucial issues in shipbuilding.In this paper,production scheduling and material ordering with endogenous uncertainty of the outfitting process are investigated.The uncertain factors in outfitting equipment production are usually decision-related,which leads to difficulties in addressing uncertainties in the outfitting production workshops before production is conducted according to plan.This uncertainty is regarded as endogenous uncertainty and can be treated as non-anticipativity constraints in the model.To address this problem,a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process.A practical case of the shipyard of China Merchants Heavy Industry Co.,Ltd.is used to evaluate the performance of the proposed method.Satisfactory results are achieved at the lowest expected total cost as the complete kit rate of outfitting equipment is improved and emergency replenishment is reduced.展开更多
Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e....Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.展开更多
The environment of low-altitude urban airspace is complex and variable due to numerous obstacles,non-cooperative aircraft,and birds.Unmanned Aerial Vehicles(UAVs)leveraging environmental information to achieve three-d...The environment of low-altitude urban airspace is complex and variable due to numerous obstacles,non-cooperative aircraft,and birds.Unmanned Aerial Vehicles(UAVs)leveraging environmental information to achieve three-dimension collision-free trajectory planning is the prerequisite to ensure airspace security.However,the timely information of surrounding situation is difficult to acquire by UAVs,which further brings security risks.As a mature technology leveraged in traditional civil aviation,the Automatic Dependent Surveillance-Broadcast(ADS-B)realizes continuous surveillance of the information of aircraft.Consequently,we leverage ADS-B for surveillance and information broadcasting,and divide the aerial airspace into multiple sub-airspaces to improve flight safety in UAV trajectory planning.In detail,we propose the secure Sub-airSpaces Planning(SSP)algorithm and Particle Swarm Optimization Rapidly-exploring Random Trees(PSO-RRT)algorithm for the UAV trajectory planning in law-altitude airspace.The performance of the proposed algorithm is verified by simulations and the results show that SSP reduces both the maximum number of UAVs in the sub-airspace and the length of the trajectory,and PSO-RRT reduces the cost of UAV trajectory in the sub-airspace.展开更多
The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving...The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving timely and compatible solutions to treat diverse skin injuries.In situ bioprinting has emerged as a key new technology,since it reduces risks during the implantation of printed scaffolds and demonstrates superior therapeutic effects.However,maintaining printing fidelity during in situ bioprinting remains a critical challenge,particularly with respect to model layering and path planning.This study proposes a novel optimization-based conformal path planning strategy for in situ bioprinting-based repair of complex skin injuries.This strategy employs constrained optimization to identify optimal waypoints on a point cloud-approximated curved surface,thereby ensuring a high degree of similarity between predesigned planar and surface-mapped 3D paths.Furthermore,this method is applicable for skin wound treatments,since it generates 3D-equidistant zigzag curves along surface tangents and enables multi-layer conformal path planning to facilitate the treatment of volumetric injuries.Furthermore,the proposed algorithm was found to be a feasible and effective treatment in a murine back injury model as well as in other complex models,thereby showcasing its potential to guide in situ bioprinting,enhance bioprinting fidelity,and facilitate improvement of clinical outcomes.展开更多
As the development of new power systems accelerates and the impacts of high renewable energy integration and extreme weather intensify,grid-alternative energy storage is garnering increasing attention for its grid-int...As the development of new power systems accelerates and the impacts of high renewable energy integration and extreme weather intensify,grid-alternative energy storage is garnering increasing attention for its grid-interaction benefits and clear business models.Consequently,assessing the value of grid-alternative energy storage in the systemtransition has become critically important.Considering the performance characteristics of storage,we propose a value assessment frame-work for grid-alternative energy storage,quantifying its non-wires-alternative effects from both cost and benefit perspectives.Building on this,we developed a collaborative planning model for energy storage and transmission grids,aimed at maximizing the economic benefits of storage systems while balancing investment and operational costs.The model considers regional grid interconnections and their interactions with system operation.By participating in system operations,grid-alternative energy storage not only maximizes its own economic benefits but also generates social welfare transfer effects.Furthermore,based on multi-regional interconnected planning,grid-alternative energy storage can reduce system costs by approximately 35%,with the most significant changes observed in generation costs.Multi-regional coordinated planning significantly enhances the sys-tem’s flexibility in regulation.However,when the load factor of interconnection lines between regions remains constant,system operational flexibility tends to decrease,leading to a roughly 28.9%increase in storage investment.Additionally,under regional coordinated planning,the greater the disparity in wind power integration across interconnected regions,the more noticeable the reduction in system costs.展开更多
Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lowe...Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lower machining efficiency and longer machining time due to its time-varying cutter-workpiece engagement angle and a high percentage of non-cutting tool paths.To address these issues,this paper introduces a parameter-variant trochoidal-like(PVTR)tool path planning method for chatter-free and high-efficiency milling.This method ensures a constant engagement angle for each tool path period by adjusting the trochoidal radius and step.Initially,the nonlinear equation for the PVTR toolpath is established.Then,a segmented recurrence method is proposed to plan tool paths based on the desired engagement angle.The impact of trochoidal tool path parameters on the engagement angle is analyzed and coupled this information with the milling stability model based on spindle speed and engagement angle to determine the desired engagement angle throughout the machining process.Finally,several experimental tests are carried out using the bull-nose end mill to validate the feasibility and effectiveness of the proposed method.展开更多
To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The...To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.展开更多
Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power sta...Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power stations).To solve the problem,we propose an energy harvesting based task scheduling and resource management framework to provide robust and low-cost edge computing services for smart grid.First,we formulate an energy consumption minimization problem with regard to task offloading,time switching,and resource allocation for mobile devices,which can be decoupled and transformed into a typical knapsack problem.Then,solutions are derived by two different algorithms.Furthermore,we deploy renewable energy and energy storage units at edge servers to tackle intermittency and instability problems.Finally,we design an energy management algorithm based on sampling average approximation for edge computing servers to derive the optimal charging/discharging strategies,number of energy storage units,and renewable energy utilization.The simulation results show the efficiency and superiority of our proposed framework.展开更多
This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti...This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.展开更多
Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and ...Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and smart transportation systems.Fog computing tackles a range of challenges,including processing,storage,bandwidth,latency,and reliability,by locally distributing secure information through end nodes.Consisting of endpoints,fog nodes,and back-end cloud infrastructure,it provides advanced capabilities beyond traditional cloud computing.In smart environments,particularly within smart city transportation systems,the abundance of devices and nodes poses significant challenges related to power consumption and system reliability.To address the challenges of latency,energy consumption,and fault tolerance in these environments,this paper proposes a latency-aware,faulttolerant framework for resource scheduling and data management,referred to as the FORD framework,for smart cities in fog environments.This framework is designed to meet the demands of time-sensitive applications,such as those in smart transportation systems.The FORD framework incorporates latency-aware resource scheduling to optimize task execution in smart city environments,leveraging resources from both fog and cloud environments.Through simulation-based executions,tasks are allocated to the nearest available nodes with minimum latency.In the event of execution failure,a fault-tolerantmechanism is employed to ensure the successful completion of tasks.Upon successful execution,data is efficiently stored in the cloud data center,ensuring data integrity and reliability within the smart city ecosystem.展开更多
The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertai...The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.展开更多
In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms...In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.展开更多
To adapt to the uncertainty of new energy,increase new energy consumption,and reduce carbon emissions,a high-voltage distribution network energy storage planning model based on robustness-oriented planning and distrib...To adapt to the uncertainty of new energy,increase new energy consumption,and reduce carbon emissions,a high-voltage distribution network energy storage planning model based on robustness-oriented planning and distributed new energy consumption is proposed.Firstly,the spatio-temporal correlation of large-scale wind-photovoltaic energy is modeled based on the Vine Copula model,and the spatial correlation of the generated wind-photovoltaic power generation is corrected to get the spatio-temporal correlation of wind-photovoltaic power generation scenarios.Finally,considering the subsequent development of new energy on demand for high-voltage distribution network peaking margin and the economy of the system peaking,we propose the optimization model of high-voltage distribution network energy storage plant siting and capacity setting for source-storage cooperative peaking.The simulation results show that the proposed energy storage plant planning method can effectively alleviate the branch circuit blockage,promote new energy consumption,reduce the burden of the main grid peak shifting,and leave sufficient peak shifting margin for the subsequent development of a new energy distribution network while ensuring the economy.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as...Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.展开更多
In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy sys...In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy system(IIES).The upper level represents the integrated energy operator,and the lower level is the electricity-heatgas load aggregator.Owing to the benefit conflict between the upper and lower levels of the IIES,a dynamic pricing mechanism for coordinating the interests of the upper and lower levels is proposed,combined with factors such as the carbon emissions of the IIES,as well as the lower load interruption power.The price of selling energy can be dynamically adjusted to the lower LA in the mechanism,according to the information on carbon emissions and load interruption power.Mutual benefits and win-win situations are achieved between the upper and lower multistakeholders.Finally,CPLEX is used to iteratively solve the bilevel optimization model.The optimal solution is selected according to the joint optimal discrimination mechanism.Thesimulation results indicate that the sourceload coordinate operation can reduce the upper and lower operation costs.Using the proposed pricingmechanism,the carbon emissions and load interruption power of IEO-LA are reduced by 9.78%and 70.19%,respectively,and the capture power of the carbon capture equipment is improved by 36.24%.The validity of the proposed model and method is verified.展开更多
Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous...Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous control process of SMR can be divided into three stages,say,state diagnosis,autonomous decision-making and coordinated control.In this paper,the autonomous state recognition and task planning of unmanned SMR are investigated.An operating condition recognition method based on the knowledge base of SMR operation is proposed by using the artificial neural network(ANN)technology,which constructs a basis for the state judgment of intelligent reactor control path planning.An improved reinforcement learning path planning algorithm is utilized to implement the path transfer decision-makingThis algorithm performs condition transitions with minimal cost under specified modes.In summary,the full range control path intelligent decision-planning technology of SMR is realized,thus provides some theoretical basis for the design and build of unmanned SMR in the future.展开更多
基金supported by the Key Program of the National Natural Science Foundation of China(Nos.52334008 and 51734004).
文摘In the context of reducing its carbon emissions,the Chinese steel industry is currently undergoing an intelligent transformation to enhance its profitability and sustainability.The optimization of production planning and scheduling plays a pivotal role in realizing these objectives such as improving production efficiency,saving energy,reducing carbon emissions,and enhancing quality.However,current practices in steel enterprises are largely dependent on experience-driven manual decision approaches supported by information systems,which are inadequate to meet the complex requirements of the industry.This study explores the current situation in production planning and scheduling,analyzes the characteristics and limitations of existing methods,and emphasizes the necessity and trends of intelligent systems.It surveys the current literature on production planning and scheduling in steel enterprises and analyzes the theoretical advancements and practical challenges associated with combinatorial and sequential optimization in this field.A key focus is on the limitations of current models and algorithms in effectively addressing the multi-objective and multiconstraint characteristics of steel produc-tion.To overcome these challenges,a novel framework for intelligent production planning and scheduling is proposed.This framework leverages data-and knowledge-driven decision-making and scenario adaptability,enabling the system to respond dynamically to real-time production conditions and market fluctuations.By integrating artificial intelligence and advanced optimization methodologies,the proposed framework improves the efficiency,cost-effectiveness,and environmental sustainability of steel manufacturing.
基金supported by the National Key Research and Development Program of China,Grant No.2020YFB0905900.
文摘The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant differences in operational costs and flexibility of various types of generation resources,as well as the volatility and uncertainty of renewable energy sources(such as wind and solar power)and the complex variability of load demand,the scheduling optimization of virtual power plants has become a critical issue that needs to be addressed.To solve this,this paper proposes an intelligent scheduling method for virtual power plants based on Deep Reinforcement Learning(DRL),utilizing Deep Q-Networks(DQN)for real-time optimization scheduling of dynamic peaking unit(DPU)and stable baseload unit(SBU)in the virtual power plant.By modeling the scheduling problem as a Markov Decision Process(MDP)and designing an optimization objective function that integrates both performance and cost,the scheduling efficiency and economic performance of the virtual power plant are significantly improved.Simulation results show that,compared with traditional scheduling methods and other deep reinforcement learning algorithms,the proposed method demonstrates significant advantages in key performance indicators:response time is shortened by up to 34%,task success rate is increased by up to 46%,and costs are reduced by approximately 26%.Experimental results verify the efficiency and scalability of the method under complex load environments and the volatility of renewable energy,providing strong technical support for the intelligent scheduling of virtual power plants.
基金supported by the Changzhou Science and Technology Support Project(CE20235045)Open Subject of Jiangsu Province Key Laboratory of Power Transmission and Distribution(2021JSSPD12)+1 种基金Talent Projects of Jiangsu University of Technology(KYY20018)Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633).
文摘Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.
基金supported in part by the High-tech ship scientific research project of the Ministry of Industry and Information Technology of the People’s Republic of China,and the National Nature Science Foundation of China(Grant No.71671113)the Science and Technology Department of Shaanxi Province(No.2020GY-219)the Ministry of Education Collaborative Project of Production,Learning and Research(No.201901024016).
文摘Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan is one of the crucial issues in shipbuilding.In this paper,production scheduling and material ordering with endogenous uncertainty of the outfitting process are investigated.The uncertain factors in outfitting equipment production are usually decision-related,which leads to difficulties in addressing uncertainties in the outfitting production workshops before production is conducted according to plan.This uncertainty is regarded as endogenous uncertainty and can be treated as non-anticipativity constraints in the model.To address this problem,a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process.A practical case of the shipyard of China Merchants Heavy Industry Co.,Ltd.is used to evaluate the performance of the proposed method.Satisfactory results are achieved at the lowest expected total cost as the complete kit rate of outfitting equipment is improved and emergency replenishment is reduced.
基金the financial support of the National Key Research and Development Plan(2021YFB3302501)the financial support of the National Natural Science Foundation of China(12102077)。
文摘Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.
基金supported by the National Key R&D Program of China(No.2022YFB3104502)the National Natural Science Foundation of China(No.62301251)+2 种基金the Natural Science Foundation of Jiangsu Province of China under Project(No.BK20220883)the open research fund of National Mobile Communications Research Laboratory,Southeast University,China(No.2024D04)the Young Elite Scientists Sponsorship Program by CAST(No.2023QNRC001).
文摘The environment of low-altitude urban airspace is complex and variable due to numerous obstacles,non-cooperative aircraft,and birds.Unmanned Aerial Vehicles(UAVs)leveraging environmental information to achieve three-dimension collision-free trajectory planning is the prerequisite to ensure airspace security.However,the timely information of surrounding situation is difficult to acquire by UAVs,which further brings security risks.As a mature technology leveraged in traditional civil aviation,the Automatic Dependent Surveillance-Broadcast(ADS-B)realizes continuous surveillance of the information of aircraft.Consequently,we leverage ADS-B for surveillance and information broadcasting,and divide the aerial airspace into multiple sub-airspaces to improve flight safety in UAV trajectory planning.In detail,we propose the secure Sub-airSpaces Planning(SSP)algorithm and Particle Swarm Optimization Rapidly-exploring Random Trees(PSO-RRT)algorithm for the UAV trajectory planning in law-altitude airspace.The performance of the proposed algorithm is verified by simulations and the results show that SSP reduces both the maximum number of UAVs in the sub-airspace and the length of the trajectory,and PSO-RRT reduces the cost of UAV trajectory in the sub-airspace.
基金supported in part by the National Natural Science Foundation of China(Nos.52205532 and 624B2077)the National Key Research and Development Program of China(No.2023YFB4302003).
文摘The global demand for effective skin injury treatments has prompted the exploration of tissue engineering solutions.While three-dimensional(3D)bioprinting has shown promise,challenges persist with respect to achieving timely and compatible solutions to treat diverse skin injuries.In situ bioprinting has emerged as a key new technology,since it reduces risks during the implantation of printed scaffolds and demonstrates superior therapeutic effects.However,maintaining printing fidelity during in situ bioprinting remains a critical challenge,particularly with respect to model layering and path planning.This study proposes a novel optimization-based conformal path planning strategy for in situ bioprinting-based repair of complex skin injuries.This strategy employs constrained optimization to identify optimal waypoints on a point cloud-approximated curved surface,thereby ensuring a high degree of similarity between predesigned planar and surface-mapped 3D paths.Furthermore,this method is applicable for skin wound treatments,since it generates 3D-equidistant zigzag curves along surface tangents and enables multi-layer conformal path planning to facilitate the treatment of volumetric injuries.Furthermore,the proposed algorithm was found to be a feasible and effective treatment in a murine back injury model as well as in other complex models,thereby showcasing its potential to guide in situ bioprinting,enhance bioprinting fidelity,and facilitate improvement of clinical outcomes.
基金funded by the Technology Project of State Grid Jibei Electric Power Supply Co.,Ltd.(Grant Number:52018F240001).
文摘As the development of new power systems accelerates and the impacts of high renewable energy integration and extreme weather intensify,grid-alternative energy storage is garnering increasing attention for its grid-interaction benefits and clear business models.Consequently,assessing the value of grid-alternative energy storage in the systemtransition has become critically important.Considering the performance characteristics of storage,we propose a value assessment frame-work for grid-alternative energy storage,quantifying its non-wires-alternative effects from both cost and benefit perspectives.Building on this,we developed a collaborative planning model for energy storage and transmission grids,aimed at maximizing the economic benefits of storage systems while balancing investment and operational costs.The model considers regional grid interconnections and their interactions with system operation.By participating in system operations,grid-alternative energy storage not only maximizes its own economic benefits but also generates social welfare transfer effects.Furthermore,based on multi-regional interconnected planning,grid-alternative energy storage can reduce system costs by approximately 35%,with the most significant changes observed in generation costs.Multi-regional coordinated planning significantly enhances the sys-tem’s flexibility in regulation.However,when the load factor of interconnection lines between regions remains constant,system operational flexibility tends to decrease,leading to a roughly 28.9%increase in storage investment.Additionally,under regional coordinated planning,the greater the disparity in wind power integration across interconnected regions,the more noticeable the reduction in system costs.
基金supported by the National Natural Science Foundation of China(Grant Nos.U22A20202 and 52275477).
文摘Trochoidal milling is known for its advantages in machining difficult-to-machine materials as it facilitates chip removal and tool cooling.However,the conventional trochoidal tool path presents challenges such as lower machining efficiency and longer machining time due to its time-varying cutter-workpiece engagement angle and a high percentage of non-cutting tool paths.To address these issues,this paper introduces a parameter-variant trochoidal-like(PVTR)tool path planning method for chatter-free and high-efficiency milling.This method ensures a constant engagement angle for each tool path period by adjusting the trochoidal radius and step.Initially,the nonlinear equation for the PVTR toolpath is established.Then,a segmented recurrence method is proposed to plan tool paths based on the desired engagement angle.The impact of trochoidal tool path parameters on the engagement angle is analyzed and coupled this information with the milling stability model based on spindle speed and engagement angle to determine the desired engagement angle throughout the machining process.Finally,several experimental tests are carried out using the bull-nose end mill to validate the feasibility and effectiveness of the proposed method.
文摘To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.
基金supported in part by the National Natural Science Foundation of China under Grant No.61473066in part by the Natural Science Foundation of Hebei Province under Grant No.F2021501020+2 种基金in part by the S&T Program of Qinhuangdao under Grant No.202401A195in part by the Science Research Project of Hebei Education Department under Grant No.QN2025008in part by the Innovation Capability Improvement Plan Project of Hebei Province under Grant No.22567637H
文摘Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power stations).To solve the problem,we propose an energy harvesting based task scheduling and resource management framework to provide robust and low-cost edge computing services for smart grid.First,we formulate an energy consumption minimization problem with regard to task offloading,time switching,and resource allocation for mobile devices,which can be decoupled and transformed into a typical knapsack problem.Then,solutions are derived by two different algorithms.Furthermore,we deploy renewable energy and energy storage units at edge servers to tackle intermittency and instability problems.Finally,we design an energy management algorithm based on sampling average approximation for edge computing servers to derive the optimal charging/discharging strategies,number of energy storage units,and renewable energy utilization.The simulation results show the efficiency and superiority of our proposed framework.
文摘This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.
基金supported by the Deanship of Scientific Research and Graduate Studies at King Khalid University under research grant number(R.G.P.2/93/45).
文摘Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and smart transportation systems.Fog computing tackles a range of challenges,including processing,storage,bandwidth,latency,and reliability,by locally distributing secure information through end nodes.Consisting of endpoints,fog nodes,and back-end cloud infrastructure,it provides advanced capabilities beyond traditional cloud computing.In smart environments,particularly within smart city transportation systems,the abundance of devices and nodes poses significant challenges related to power consumption and system reliability.To address the challenges of latency,energy consumption,and fault tolerance in these environments,this paper proposes a latency-aware,faulttolerant framework for resource scheduling and data management,referred to as the FORD framework,for smart cities in fog environments.This framework is designed to meet the demands of time-sensitive applications,such as those in smart transportation systems.The FORD framework incorporates latency-aware resource scheduling to optimize task execution in smart city environments,leveraging resources from both fog and cloud environments.Through simulation-based executions,tasks are allocated to the nearest available nodes with minimum latency.In the event of execution failure,a fault-tolerantmechanism is employed to ensure the successful completion of tasks.Upon successful execution,data is efficiently stored in the cloud data center,ensuring data integrity and reliability within the smart city ecosystem.
文摘The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.
基金supported by the National Natural Science Foundation of China(No.62373027).
文摘In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.
基金supported by State Grid Anhui Electric Power Co.,Ltd.Research Program(B3120923000C).
文摘To adapt to the uncertainty of new energy,increase new energy consumption,and reduce carbon emissions,a high-voltage distribution network energy storage planning model based on robustness-oriented planning and distributed new energy consumption is proposed.Firstly,the spatio-temporal correlation of large-scale wind-photovoltaic energy is modeled based on the Vine Copula model,and the spatial correlation of the generated wind-photovoltaic power generation is corrected to get the spatio-temporal correlation of wind-photovoltaic power generation scenarios.Finally,considering the subsequent development of new energy on demand for high-voltage distribution network peaking margin and the economy of the system peaking,we propose the optimization model of high-voltage distribution network energy storage plant siting and capacity setting for source-storage cooperative peaking.The simulation results show that the proposed energy storage plant planning method can effectively alleviate the branch circuit blockage,promote new energy consumption,reduce the burden of the main grid peak shifting,and leave sufficient peak shifting margin for the subsequent development of a new energy distribution network while ensuring the economy.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金supported by the Committee of Science of the Ministry of Education and Science of the Republic of Kazakhstan under Grant No.249015/0224.
文摘Unmanned aerial vehicles(UAVs)are widely used in situations with uncertain and risky areas lacking network coverage.In natural disasters,timely delivery of first aid supplies is crucial.Current UAVs face risks such as crashing into birds or unexpected structures.Airdrop systems with parachutes risk dispersing payloads away from target locations.The objective here is to use multiple UAVs to distribute payloads cooperatively to assigned locations.The civil defense department must balance coverage,accurate landing,and flight safety while considering battery power and capability.Deep Q-network(DQN)models are commonly used in multi-UAV path planning to effectively represent the surroundings and action spaces.Earlier strategies focused on advanced DQNs for UAV path planning in different configurations,but rarely addressed non-cooperative scenarios and disaster environments.This paper introduces a new DQN framework to tackle challenges in disaster environments.It considers unforeseen structures and birds that could cause UAV crashes and assumes urgent landing zones and winch-based airdrop systems for precise delivery and return.A new DQN model is developed,which incorporates the battery life,safe flying distance between UAVs,and remaining delivery points to encode surrounding hazards into the state space and Q-networks.Additionally,a unique reward system is created to improve UAV action sequences for better delivery coverage and safe landings.The experimental results demonstrate that multi-UAV first aid delivery in disaster environments can achieve advanced performance.
基金supported by the Central Government Guides Local Science and Technology Development Fund Project(2023ZY0020)Key R&D and Achievement Transformation Project in InnerMongolia Autonomous Region(2022YFHH0019)+3 种基金the Fundamental Research Funds for Inner Mongolia University of Science&Technology(2022053)Natural Science Foundation of Inner Mongolia(2022LHQN05002)National Natural Science Foundation of China(52067018)Metallurgical Engineering First-Class Discipline Construction Project in Inner Mongolia University of Science and Technology,Control Science and Engineering Quality Improvement and Cultivation Discipline Project in Inner Mongolia University of Science and Technology。
文摘In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy system(IIES).The upper level represents the integrated energy operator,and the lower level is the electricity-heatgas load aggregator.Owing to the benefit conflict between the upper and lower levels of the IIES,a dynamic pricing mechanism for coordinating the interests of the upper and lower levels is proposed,combined with factors such as the carbon emissions of the IIES,as well as the lower load interruption power.The price of selling energy can be dynamically adjusted to the lower LA in the mechanism,according to the information on carbon emissions and load interruption power.Mutual benefits and win-win situations are achieved between the upper and lower multistakeholders.Finally,CPLEX is used to iteratively solve the bilevel optimization model.The optimal solution is selected according to the joint optimal discrimination mechanism.Thesimulation results indicate that the sourceload coordinate operation can reduce the upper and lower operation costs.Using the proposed pricingmechanism,the carbon emissions and load interruption power of IEO-LA are reduced by 9.78%and 70.19%,respectively,and the capture power of the carbon capture equipment is improved by 36.24%.The validity of the proposed model and method is verified.
文摘Small modular reactor(SMR)belongs to the research forefront of nuclear reactor technology.Nowadays,advancement of intelligent control technologies paves a new way to the design and build of unmanned SMR.The autonomous control process of SMR can be divided into three stages,say,state diagnosis,autonomous decision-making and coordinated control.In this paper,the autonomous state recognition and task planning of unmanned SMR are investigated.An operating condition recognition method based on the knowledge base of SMR operation is proposed by using the artificial neural network(ANN)technology,which constructs a basis for the state judgment of intelligent reactor control path planning.An improved reinforcement learning path planning algorithm is utilized to implement the path transfer decision-makingThis algorithm performs condition transitions with minimal cost under specified modes.In summary,the full range control path intelligent decision-planning technology of SMR is realized,thus provides some theoretical basis for the design and build of unmanned SMR in the future.
