Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of in...Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.展开更多
Learning-based methods have become mainstream for solving residential energy scheduling problems. In order to improve the learning efficiency of existing methods and increase the utilization of renewable energy, we pr...Learning-based methods have become mainstream for solving residential energy scheduling problems. In order to improve the learning efficiency of existing methods and increase the utilization of renewable energy, we propose the Dyna actiondependent heuristic dynamic programming(Dyna-ADHDP)method, which incorporates the ideas of learning and planning from the Dyna framework in action-dependent heuristic dynamic programming. This method defines a continuous action space for precise control of an energy storage system and allows online optimization of algorithm performance during the real-time operation of the residential energy model. Meanwhile, the target network is introduced during the training process to make the training smoother and more efficient. We conducted experimental comparisons with the benchmark method using simulated and real data to verify its applicability and performance. The results confirm the method's excellent performance and generalization capabilities, as well as its excellence in increasing renewable energy utilization and extending equipment life.展开更多
To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and en...To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and environmental issues of ships,this study aims to improve the transportation efficiency of ships by providing a ship route induction method.Ship data from a certain bay during a defined period are collected,and an improved backpropagation neural network algorithm is used to forecast ship traffic.On the basis of the forecasted data and ship route induction objectives,dynamic programming of ship routes is performed.Experimental results show that the routes planned using this induction method reduce the combined cost by 17.55%compared with statically induced routes.This method has promising engineering applications in improving ship navigation efficiency,promoting energy conservation,and reducing emissions.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
In this paper,a distributed adaptive dynamic programming(ADP)framework based on value iteration is proposed for multi-player differential games.In the game setting,players have no access to the information of others&#...In this paper,a distributed adaptive dynamic programming(ADP)framework based on value iteration is proposed for multi-player differential games.In the game setting,players have no access to the information of others'system parameters or control laws.Each player adopts an on-policy value iteration algorithm as the basic learning framework.To deal with the incomplete information structure,players collect a period of system trajectory data to compensate for the lack of information.The policy updating step is implemented by a nonlinear optimization problem aiming to search for the proximal admissible policy.Theoretical analysis shows that by adopting proximal policy searching rules,the approximated policies can converge to a neighborhood of equilibrium policies.The efficacy of our method is illustrated by three examples,which also demonstrate that the proposed method can accelerate the learning process compared with the centralized learning framework.展开更多
In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on t...In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on the output redefinition method and Adaptive Dynamic Programming(ADP).The intelligent FTC scheme consists of two main parts:a basic fault-tolerant and stable controller and an ADP-based supplementary controller.In the basic FTC part,an output redefinition approach is designed to make zero-dynamics stable with respect to the new output.Then,Ideal Internal Dynamic(IID)is obtained using an optimal bounded inversion approach,and a tracking controller is designed for the new output to realize output tracking of the nonminimum phase HSV system.For the ADP-based compensation control part,an ActionDependent Heuristic Dynamic Programming(ADHDP)adopting an actor-critic learning structure is utilized to further optimize the tracking performance of the HSV control system.Finally,simulation results are provided to verify the effectiveness and efficiency of the proposed FTC algorithm.展开更多
Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and ...Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and its applications to various advanced control fields. First, the background of the development of ADP is described, emphasizing the significance of regulation and tracking control problems. Some effective offline and online algorithms for ADP/adaptive critic control are displayed, where the main results towards discrete-time systems and continuous-time systems are surveyed, respectively.Then, the research progress on adaptive critic control based on the event-triggered framework and under uncertain environment is discussed, respectively, where event-based design, robust stabilization, and game design are reviewed. Moreover, the extensions of ADP for addressing control problems under complex environment attract enormous attention. The ADP architecture is revisited under the perspective of data-driven and RL frameworks,showing how they promote ADP formulation significantly.Finally, several typical control applications with respect to RL and ADP are summarized, particularly in the fields of wastewater treatment processes and power systems, followed by some general prospects for future research. Overall, the comprehensive survey on ADP and RL for advanced control applications has d emonstrated its remarkable potential within the artificial intelligence era. In addition, it also plays a vital role in promoting environmental protection and industrial intelligence.展开更多
In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed metho...In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection.展开更多
Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods...Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching solutions.To address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED problem.The proposed algorithm first stores non-dominated optimal solutions found so far into an archive.Then,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index method.This mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant emissions.Moreover,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto solutions.To this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching solutions.The proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance indicators.Also,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED methods.Finally,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs and pollution emissions simultaneously,compared to the latest published DEED solutions.展开更多
The use of dynamic programming(DP)algorithms to learn Bayesian network structures is limited by their high space complexity and difficulty in learning the structure of large-scale networks.Therefore,this study propose...The use of dynamic programming(DP)algorithms to learn Bayesian network structures is limited by their high space complexity and difficulty in learning the structure of large-scale networks.Therefore,this study proposes a DP algorithm based on node block sequence constraints.The proposed algorithm constrains the traversal process of the parent graph by using the M-sequence matrix to considerably reduce the time consumption and space complexity by pruning the traversal process of the order graph using the node block sequence.Experimental results show that compared with existing DP algorithms,the proposed algorithm can obtain learning results more efficiently with less than 1%loss of accuracy,and can be used for learning larger-scale networks.展开更多
The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system perf...The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.展开更多
Airborne pulse radar and communication systems are essential for precise detection and collision avoidance,ensuring that aircraft operate safely and efficiently.A major challenge in spectrum sharing is the allocation ...Airborne pulse radar and communication systems are essential for precise detection and collision avoidance,ensuring that aircraft operate safely and efficiently.A major challenge in spectrum sharing is the allocation of resources in both the time and frequency domains,aiming to minimize inter-system interference as the available spectrum fluctuates over time.In this paper,regarding maximization of detection probability and spectrum utilization efficiency as two fundamental objectives,a novel Dynamic Spectrum and Power Allocation based on Genetic Algorithm(GA-DSPA)model is proposed,which dynamically allocates communication channel frequency and power under the constraints of pulse radar detection probability and signal-to-interferenceplus-noise ratio of communication.To solve this bi-objective model,a non-dominated sortingbased multi-objective genetic algorithm is developed.A novel environment perception strategy and offspring sorting technique based on radar echoes are integrated into the optimization framework.Simulation results indicate that by integrating environmental monitoring mechanisms and dynamic adaptation strategies,the proposed method effectively tracks the evolving Paretooptimal Fronts(Po Fs),thereby ensuring optimal performance for both co-located pulse radar and communication systems.Hardware test results confirm that within the GA-DSPA framework,the pulse radar achieves higher detection probabilities under identical conditions,while the communication system realizes increased average throughput.展开更多
Purpose-With the rapid advancement of China’s high-speed rail network,the density of train operations is on the rise.To address the challenge of shortening train tracking intervals while enhancing transportation effi...Purpose-With the rapid advancement of China’s high-speed rail network,the density of train operations is on the rise.To address the challenge of shortening train tracking intervals while enhancing transportation efficiency,the multi-objective dynamic optimization of the train operation process has emerged as a critical issue.Design/methodology/approach-Train dynamic model is established by analyzing the force of the train in the process of tracing operation.The train tracing operation model is established according to the dynamic mechanical model of the train tracking process,and the dynamic optimization analysis is carried out with comfort,energy saving and punctuality as optimization objectives.To achieve multi-objective dynamic optimization,a novel train tracking operation calculation method is proposed,utilizing the improved grey wolf optimization algorithm(MOGWO).The proposed method is simulated and verified based on the train characteristics and line data of CR400AF electric multiple units.Findings-The simulation results prove that the optimized MOGWO algorithm can be computed quickly during train tracks,the optimum results can be given within 5s and the algorithm can converge effectively in different optimization target directions.The optimized speed profile of the MOGWO algorithm is smoother and more stable and meets the target requirements of energy saving,punctuality and comfort while maximally respecting the speed limit profile.Originality/value-The MOGWO train tracking interval optimization method enhances the tracking process while ensuring a safe tracking interval.This approach enables the trailing train to operate more comfortably,energy-efficiently and punctually,aligning with passenger needs and industry trends.The method offers valuable insights for optimizing the high-speed train tracking process.展开更多
This paper deals with reduction of losses in electric power distribution system through a dynamic reconfiguration case study of a grid in the city of Mostar,Bosnia and Herzegovina.The proposed solution is based on a n...This paper deals with reduction of losses in electric power distribution system through a dynamic reconfiguration case study of a grid in the city of Mostar,Bosnia and Herzegovina.The proposed solution is based on a nonlinear model predictive control algorithm which determines the optimal switching operations of the distribution system.The goal of the control algorithm is to find the optimal radial network topology which minimizes cumulative active power losses and maximizes voltages across the network while simultaneously satisfying all system constraints.The optimization results are validated through multiple simulations(using real power demand data collected for a few characteristic days during winter and summer)which demonstrate the efficiency and usefulness of the developed control algorithm in reducing the grid losses by up to 14%.展开更多
Investors are always willing to receive more data.This has become especially true for the application of modern portfolio theory to the institutional asset allocation process,which requires quantitative estimates of r...Investors are always willing to receive more data.This has become especially true for the application of modern portfolio theory to the institutional asset allocation process,which requires quantitative estimates of risk and return.When long-term data series are unavailable for analysis,it has become common practice to use recent data only.The danger is that these data may not be representative of future performance.Although longer data series are of poorer quality,are difficult to obtain,and may reflect various political and economic regimes,they often paint a very different picture of emerging market performance.This paper presents an application of a stochastic non-linear optimization model of portfolios including transaction costs in the Brazilian financial market.In order to have that,portfolio theory and optimal control were used as theoretical basis.The first strategy tries to allocate the whole available wealth,not considering the risk associated to portfolio(deterministic result).In this case the investor obtained profits of 7.23%a month,taking into account the three risk aversion levels during the whole planning period.On the contrary,the results from the stochastic algorithm obtain profits of 1.34%a month and 18.06%a year,if the investor has low risk aversion.The profits would be 0.88%a month and 11.02%a year for a medium risk aversion investor.And with high risk aversion,the investor obtains 0.62%a month and 7.68%a year.展开更多
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.展开更多
From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are ...From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are not objects, etc. So, this paper designs a programming language, Shrek, which integrates many language features and constructions in a compact and consistent model. The Shrek language is a class-based purely object-oriented language. It has a dynamical strong type system, and adopts a single-inheritance mechanism with Mixin as its complement. It has a consistent class instantiation and inheritance structure, and the ability of intercessive structural computational reflection, which enables it to support safe metaclass programming. It also supports multi-thread programming and automatic garbage collection, and enforces its expressive power by adopting a native method mechanism. The prototype system of the Shrek language is implemented and anticipated design goals are achieved.展开更多
The residential energy scheduling of solar energy is an important research area of smart grid. On the demand side, factors such as household loads, storage batteries, the outside public utility grid and renewable ener...The residential energy scheduling of solar energy is an important research area of smart grid. On the demand side, factors such as household loads, storage batteries, the outside public utility grid and renewable energy resources, are combined together as a nonlinear, time-varying, indefinite and complex system, which is difficult to manage or optimize. Many nations have already applied the residential real-time pricing to balance the burden on their grid. In order to enhance electricity efficiency of the residential micro grid, this paper presents an action dependent heuristic dynamic programming(ADHDP) method to solve the residential energy scheduling problem. The highlights of this paper are listed below. First,the weather-type classification is adopted to establish three types of programming models based on the features of the solar energy. In addition, the priorities of different energy resources are set to reduce the loss of electrical energy transmissions.Second, three ADHDP-based neural networks, which can update themselves during applications, are designed to manage the flows of electricity. Third, simulation results show that the proposed scheduling method has effectively reduced the total electricity cost and improved load balancing process. The comparison with the particle swarm optimization algorithm further proves that the present method has a promising effect on energy management to save cost.展开更多
This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain e...This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.展开更多
基金supported by the National Key Research and Development Program Project(No.2021YFB3301300).
文摘Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.
基金supported in part by the National Key Research and Development Program of China(2024YFB4709100,2021YFE0206100)the National Natural Science Foundation of China(62073321)+1 种基金the National Defense Basic Scientific Research Program(JCKY2019203C029)the Science and Technology Development Fund,Macao SAR,China(0015/2020/AMJ)
文摘Learning-based methods have become mainstream for solving residential energy scheduling problems. In order to improve the learning efficiency of existing methods and increase the utilization of renewable energy, we propose the Dyna actiondependent heuristic dynamic programming(Dyna-ADHDP)method, which incorporates the ideas of learning and planning from the Dyna framework in action-dependent heuristic dynamic programming. This method defines a continuous action space for precise control of an energy storage system and allows online optimization of algorithm performance during the real-time operation of the residential energy model. Meanwhile, the target network is introduced during the training process to make the training smoother and more efficient. We conducted experimental comparisons with the benchmark method using simulated and real data to verify its applicability and performance. The results confirm the method's excellent performance and generalization capabilities, as well as its excellence in increasing renewable energy utilization and extending equipment life.
基金Supported by the National Key R&D Program of China project (2017YFC0805309)the National Natural Science Foundation of China (60602020)。
文摘To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and environmental issues of ships,this study aims to improve the transportation efficiency of ships by providing a ship route induction method.Ship data from a certain bay during a defined period are collected,and an improved backpropagation neural network algorithm is used to forecast ship traffic.On the basis of the forecasted data and ship route induction objectives,dynamic programming of ship routes is performed.Experimental results show that the routes planned using this induction method reduce the combined cost by 17.55%compared with statically induced routes.This method has promising engineering applications in improving ship navigation efficiency,promoting energy conservation,and reducing emissions.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
基金supported by the Aeronautical Science Foundation of China(20220001057001)an Open Project of the National Key Laboratory of Air-based Information Perception and Fusion(202437)
文摘In this paper,a distributed adaptive dynamic programming(ADP)framework based on value iteration is proposed for multi-player differential games.In the game setting,players have no access to the information of others'system parameters or control laws.Each player adopts an on-policy value iteration algorithm as the basic learning framework.To deal with the incomplete information structure,players collect a period of system trajectory data to compensate for the lack of information.The policy updating step is implemented by a nonlinear optimization problem aiming to search for the proximal admissible policy.Theoretical analysis shows that by adopting proximal policy searching rules,the approximated policies can converge to a neighborhood of equilibrium policies.The efficacy of our method is illustrated by three examples,which also demonstrate that the proposed method can accelerate the learning process compared with the centralized learning framework.
基金supported in part by the Science Center Program of National Natural Science Foundation of China(62373189,62188101,62020106003)the Research Fund of State Key Laboratory of Mechanics and Control for Aerospace Structures,China。
文摘In this paper,a novel adaptive Fault-Tolerant Control(FTC)strategy is proposed for non-minimum phase Hypersonic Vehicles(HSVs)that are affected by actuator faults and parameter uncertainties.The strategy is based on the output redefinition method and Adaptive Dynamic Programming(ADP).The intelligent FTC scheme consists of two main parts:a basic fault-tolerant and stable controller and an ADP-based supplementary controller.In the basic FTC part,an output redefinition approach is designed to make zero-dynamics stable with respect to the new output.Then,Ideal Internal Dynamic(IID)is obtained using an optimal bounded inversion approach,and a tracking controller is designed for the new output to realize output tracking of the nonminimum phase HSV system.For the ADP-based compensation control part,an ActionDependent Heuristic Dynamic Programming(ADHDP)adopting an actor-critic learning structure is utilized to further optimize the tracking performance of the HSV control system.Finally,simulation results are provided to verify the effectiveness and efficiency of the proposed FTC algorithm.
基金supported in part by the National Natural Science Foundation of China(62222301, 62073085, 62073158, 61890930-5, 62021003)the National Key Research and Development Program of China (2021ZD0112302, 2021ZD0112301, 2018YFC1900800-5)Beijing Natural Science Foundation (JQ19013)。
文摘Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and its applications to various advanced control fields. First, the background of the development of ADP is described, emphasizing the significance of regulation and tracking control problems. Some effective offline and online algorithms for ADP/adaptive critic control are displayed, where the main results towards discrete-time systems and continuous-time systems are surveyed, respectively.Then, the research progress on adaptive critic control based on the event-triggered framework and under uncertain environment is discussed, respectively, where event-based design, robust stabilization, and game design are reviewed. Moreover, the extensions of ADP for addressing control problems under complex environment attract enormous attention. The ADP architecture is revisited under the perspective of data-driven and RL frameworks,showing how they promote ADP formulation significantly.Finally, several typical control applications with respect to RL and ADP are summarized, particularly in the fields of wastewater treatment processes and power systems, followed by some general prospects for future research. Overall, the comprehensive survey on ADP and RL for advanced control applications has d emonstrated its remarkable potential within the artificial intelligence era. In addition, it also plays a vital role in promoting environmental protection and industrial intelligence.
基金supported by the National Science Fund for Distinguished Young Scholars (62225303)the Fundamental Research Funds for the Central Universities (buctrc202201)+1 种基金China Scholarship Council,and High Performance Computing PlatformCollege of Information Science and Technology,Beijing University of Chemical Technology。
文摘In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection.
基金supported by the National Natural Science Foundation of China under Grant No.61802328,61972333,and 61771415.
文摘Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching solutions.To address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED problem.The proposed algorithm first stores non-dominated optimal solutions found so far into an archive.Then,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index method.This mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant emissions.Moreover,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto solutions.To this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching solutions.The proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance indicators.Also,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED methods.Finally,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs and pollution emissions simultaneously,compared to the latest published DEED solutions.
基金Shaanxi Science Fund for Distinguished Young Scholars,Grant/Award Number:2024JC-JCQN-57Xi’an Science and Technology Plan Project,Grant/Award Number:2023JH-QCYJQ-0086+2 种基金Scientific Research Program Funded by Education Department of Shaanxi Provincial Government,Grant/Award Number:P23JP071Engineering Technology Research Center of Shaanxi Province for Intelligent Testing and Reliability Evaluation of Electronic Equipments,Grant/Award Number:2023-ZC-GCZX-00472022 Shaanxi University Youth Innovation Team Project。
文摘The use of dynamic programming(DP)algorithms to learn Bayesian network structures is limited by their high space complexity and difficulty in learning the structure of large-scale networks.Therefore,this study proposes a DP algorithm based on node block sequence constraints.The proposed algorithm constrains the traversal process of the parent graph by using the M-sequence matrix to considerably reduce the time consumption and space complexity by pruning the traversal process of the order graph using the node block sequence.Experimental results show that compared with existing DP algorithms,the proposed algorithm can obtain learning results more efficiently with less than 1%loss of accuracy,and can be used for learning larger-scale networks.
文摘The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.
基金co-supported by the National Natural Science Foundation of China(No.62293495)the National Key Research and Development Program of China(No.2023YFB3306900)the Academic Excellence Foundation of BUAA for ph.D Students,China。
文摘Airborne pulse radar and communication systems are essential for precise detection and collision avoidance,ensuring that aircraft operate safely and efficiently.A major challenge in spectrum sharing is the allocation of resources in both the time and frequency domains,aiming to minimize inter-system interference as the available spectrum fluctuates over time.In this paper,regarding maximization of detection probability and spectrum utilization efficiency as two fundamental objectives,a novel Dynamic Spectrum and Power Allocation based on Genetic Algorithm(GA-DSPA)model is proposed,which dynamically allocates communication channel frequency and power under the constraints of pulse radar detection probability and signal-to-interferenceplus-noise ratio of communication.To solve this bi-objective model,a non-dominated sortingbased multi-objective genetic algorithm is developed.A novel environment perception strategy and offspring sorting technique based on radar echoes are integrated into the optimization framework.Simulation results indicate that by integrating environmental monitoring mechanisms and dynamic adaptation strategies,the proposed method effectively tracks the evolving Paretooptimal Fronts(Po Fs),thereby ensuring optimal performance for both co-located pulse radar and communication systems.Hardware test results confirm that within the GA-DSPA framework,the pulse radar achieves higher detection probabilities under identical conditions,while the communication system realizes increased average throughput.
基金funded by the China Academy of Railway Sciences Corporation Limited Scientific Research Project(No:2023YJ080).
文摘Purpose-With the rapid advancement of China’s high-speed rail network,the density of train operations is on the rise.To address the challenge of shortening train tracking intervals while enhancing transportation efficiency,the multi-objective dynamic optimization of the train operation process has emerged as a critical issue.Design/methodology/approach-Train dynamic model is established by analyzing the force of the train in the process of tracing operation.The train tracing operation model is established according to the dynamic mechanical model of the train tracking process,and the dynamic optimization analysis is carried out with comfort,energy saving and punctuality as optimization objectives.To achieve multi-objective dynamic optimization,a novel train tracking operation calculation method is proposed,utilizing the improved grey wolf optimization algorithm(MOGWO).The proposed method is simulated and verified based on the train characteristics and line data of CR400AF electric multiple units.Findings-The simulation results prove that the optimized MOGWO algorithm can be computed quickly during train tracks,the optimum results can be given within 5s and the algorithm can converge effectively in different optimization target directions.The optimized speed profile of the MOGWO algorithm is smoother and more stable and meets the target requirements of energy saving,punctuality and comfort while maximally respecting the speed limit profile.Originality/value-The MOGWO train tracking interval optimization method enhances the tracking process while ensuring a safe tracking interval.This approach enables the trailing train to operate more comfortably,energy-efficiently and punctually,aligning with passenger needs and industry trends.The method offers valuable insights for optimizing the high-speed train tracking process.
基金supported in part by the European Regional Development Fund under Grant KK.01.1.1.01.0009(DATACROSS).
文摘This paper deals with reduction of losses in electric power distribution system through a dynamic reconfiguration case study of a grid in the city of Mostar,Bosnia and Herzegovina.The proposed solution is based on a nonlinear model predictive control algorithm which determines the optimal switching operations of the distribution system.The goal of the control algorithm is to find the optimal radial network topology which minimizes cumulative active power losses and maximizes voltages across the network while simultaneously satisfying all system constraints.The optimization results are validated through multiple simulations(using real power demand data collected for a few characteristic days during winter and summer)which demonstrate the efficiency and usefulness of the developed control algorithm in reducing the grid losses by up to 14%.
文摘Investors are always willing to receive more data.This has become especially true for the application of modern portfolio theory to the institutional asset allocation process,which requires quantitative estimates of risk and return.When long-term data series are unavailable for analysis,it has become common practice to use recent data only.The danger is that these data may not be representative of future performance.Although longer data series are of poorer quality,are difficult to obtain,and may reflect various political and economic regimes,they often paint a very different picture of emerging market performance.This paper presents an application of a stochastic non-linear optimization model of portfolios including transaction costs in the Brazilian financial market.In order to have that,portfolio theory and optimal control were used as theoretical basis.The first strategy tries to allocate the whole available wealth,not considering the risk associated to portfolio(deterministic result).In this case the investor obtained profits of 7.23%a month,taking into account the three risk aversion levels during the whole planning period.On the contrary,the results from the stochastic algorithm obtain profits of 1.34%a month and 18.06%a year,if the investor has low risk aversion.The profits would be 0.88%a month and 11.02%a year for a medium risk aversion investor.And with high risk aversion,the investor obtains 0.62%a month and 7.68%a year.
基金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.
基金The National Science Fund for Distinguished Young Scholars (No.60425206)the National Natural Science Foundation of China (No.60633010)the Natural Science Foundation of Jiangsu Province(No.BK2006094)
文摘From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are not objects, etc. So, this paper designs a programming language, Shrek, which integrates many language features and constructions in a compact and consistent model. The Shrek language is a class-based purely object-oriented language. It has a dynamical strong type system, and adopts a single-inheritance mechanism with Mixin as its complement. It has a consistent class instantiation and inheritance structure, and the ability of intercessive structural computational reflection, which enables it to support safe metaclass programming. It also supports multi-thread programming and automatic garbage collection, and enforces its expressive power by adopting a native method mechanism. The prototype system of the Shrek language is implemented and anticipated design goals are achieved.
基金supported in part by the National Natural Science Foundation of China(61533017,U1501251,61374105,61722312)
文摘The residential energy scheduling of solar energy is an important research area of smart grid. On the demand side, factors such as household loads, storage batteries, the outside public utility grid and renewable energy resources, are combined together as a nonlinear, time-varying, indefinite and complex system, which is difficult to manage or optimize. Many nations have already applied the residential real-time pricing to balance the burden on their grid. In order to enhance electricity efficiency of the residential micro grid, this paper presents an action dependent heuristic dynamic programming(ADHDP) method to solve the residential energy scheduling problem. The highlights of this paper are listed below. First,the weather-type classification is adopted to establish three types of programming models based on the features of the solar energy. In addition, the priorities of different energy resources are set to reduce the loss of electrical energy transmissions.Second, three ADHDP-based neural networks, which can update themselves during applications, are designed to manage the flows of electricity. Third, simulation results show that the proposed scheduling method has effectively reduced the total electricity cost and improved load balancing process. The comparison with the particle swarm optimization algorithm further proves that the present method has a promising effect on energy management to save cost.
基金supported by the National Natural Science Foundation of China(6157328561305133)
文摘This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.
