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.展开更多
Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicabi...Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming(DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm.Based on the analysis of DP, this paper proposes a hierarchical directional DP(DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity.展开更多
A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the ...A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.展开更多
Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are co...Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are constructed with sequential conditional probability in HSI color space. Then, dynamic programming is used to seek the best color mapping relation with the minimum cost path between target image histogram and source image histogram. Finally, video tracking technique is performed to correct multi-view video. Experimental results show that the proposed method can obtain better subjective and objective performance in color correction.展开更多
Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccura...Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccurate in some actual systems. To address such problem, a novel algorithm is proposed based on dynamic programming to manage the number and distribution of replicas in different nodes. By using Markov model, replicas management is organized as a multi-phase process, and the recursion equations are provided. In this algorithm, the heterogeneity of nodes, the expense for maintaining replicas and the engaged space have been considered. Under these restricted conditions, this algorithm realizes high data reliability in a distributed system. The results of case analysis prove the feasibility of the algorithm.展开更多
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV...Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.展开更多
As valuable energy in iron-and steel-making process,by-product gas is widely used in heating and technical processes in steel plant.After being used according to the technical requirements,the surplus by-product gas i...As valuable energy in iron-and steel-making process,by-product gas is widely used in heating and technical processes in steel plant.After being used according to the technical requirements,the surplus by-product gas is usually used for buffer boilers to produce steam.With the rapid development of energy conservation technology and energy consumption level,surplus gas in steel plant continues to get larger.Therefore,it is significant to organize surplus gas among buffer boilers.A dynamic programming model of that issue was established in this work,considering the ramp rate constraint of boilers and the influences of setting gasholders.Then a case study was done.It is shown that dynamic programming dispatch gets more steam generation and less specific gas consumption compared with current proportionate dispatch depending on nominal capacities of boilers.The ignored boiler ramp rate constraint was considered and its contribution to the result validity was pointed out.Finally,the significance of setting gasholders was studied.展开更多
This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering...This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.展开更多
For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning...For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.展开更多
A new method is proposed for synthesizing intermediate views from a pair of stereoscopic images. In order to synthesize high-quality intermediate views, the block matching method together with a simplified multi-windo...A new method is proposed for synthesizing intermediate views from a pair of stereoscopic images. In order to synthesize high-quality intermediate views, the block matching method together with a simplified multi-window technique and dynamic programming is used in the process of disparity estimation. Then occlusion detection is performed to locate occluded regions and their disparities are compensated. After the projecton of the left-to-right and right-to-left disparities onto the intermediate image, intermediate view is synthesized considering occluded regions. Experimental results show that our synthesis method can obtain intermediate views with higher quality.展开更多
The control problem of trajectory based path following for passenger vehicles is studied. Comprehensive nonlinear vehicle model is utilized for simulation vehicle response during various maneuvers in MATLAB/Simulink. ...The control problem of trajectory based path following for passenger vehicles is studied. Comprehensive nonlinear vehicle model is utilized for simulation vehicle response during various maneuvers in MATLAB/Simulink. In order to follow desired path, a driver model is developed to enhance closed loop driver/vehicle model. Then, linear quadratic regulator(LQR) controller is developed which regulates direct yaw moment and corrective steering angle on wheels. Particle swam optimization(PSO) method is utilized to optimize the LQR controller for various dynamic conditions. Simulation results indicate that, over various maneuvers, side slip angle and lateral acceleration can be reduced by 10% and 15%, respectively, which sustain the vehicle stable. Also, anti-lock brake system is designed for longitudinal dynamics of vehicle to achieve desired slip during braking and accelerating. Proposed comprehensive controller demonstrates that vehicle steerability can increase by about 15% during severe braking by preventing wheel from locking and reducing stopping distance.展开更多
The problem of stochastically allocating redundant com- ponents to increase the system lifetime is an important topic of reliability. An optimal redundancy allocation is proposed, which maximizes the expected lifetime...The problem of stochastically allocating redundant com- ponents to increase the system lifetime is an important topic of reliability. An optimal redundancy allocation is proposed, which maximizes the expected lifetime of a reliability system with sub- systems consisting of components in parallel. The constraints are minimizing the total resources and the sizes of subsystems. In this system, each switching is independent with each other and works with probability p. Two optimization problems are studied by an incremental algorithm and dynamic programming technique respectively. The incremental algorithm proposed could obtain an approximate optimal solution, and the dynamic programming method could generate the optimal solution,展开更多
Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challe...Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.展开更多
An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The...An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The maximal positively invariant terminal set, which is feasible and invariant with respect to a feedback control law, is computed as terminal target set and an associated Lyapunov function is chosen as terminal cost. The combination of these two components guarantees constraint satisfaction and closed-loop stability for all time. The proposed algorithm combines a dynamic programming strategy with a multi-parametric quadratic programming solver and basic polyhedral manipulation. A numerical example shows that a larger stabilizable set of states can be obtained by the proposed algorithm than precious work.展开更多
This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.U...This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.Upon each arrival, an admission/routing decision is made, and the accepted job is routed to one of the two servers with each being associated with a queue.After each service completion, the servers have an option of serving a job from its own queue, serving a jockeying job from another queue, or staying idle.The system performance is inclusive of the revenues from accepted jobs, the costs of holding jobs in queues, the service costs and the job jockeying costs.To maximize the total expected discounted return, we formulate a Markov decision process(MDP) model for this system.The value iteration method is employed to characterize the optimal policy as a hedging point policy.Numerical studies verify the structure of the hedging point policy which is convenient for implementing control actions in practice.展开更多
Job planning (JP) systems shop oriented provide a basis for job shop scheduling and control in organizing short term production activities. This paper presents a method based on timed Petri net (TPN) method that is ...Job planning (JP) systems shop oriented provide a basis for job shop scheduling and control in organizing short term production activities. This paper presents a method based on timed Petri net (TPN) method that is used to program optimal JP for assembly shop. It includes three parts further. Firstly, an architecture of solutions to JP problems for any kind of shop oriented is presented to define a particular JP for a designated JP problem. Secondly, Petri net model is specified for aircraft part assembly processes. Finally, algorithms for optimizing generation of dynamic mechanism and a simulating case are then discussed. In comparison with traditional methods such as PERT or CPM, it is obviously convenient for planners or schedulers to schedule and manage assembly processes.展开更多
In this paper, a deterministic lot-sizing model is developed for an item during its lifeperiod. A demand for the item is approximated by a special polynomial function. And shortages areallowed to occur in the proposed...In this paper, a deterministic lot-sizing model is developed for an item during its lifeperiod. A demand for the item is approximated by a special polynomial function. And shortages areallowed to occur in the proposed model. A simple dynamic programming method is presented forgenerating the optimal replenishment policy. A numerical example is used to illustrate the solutionprocedure for the special case with quadric demand. Sensitivity analysis for parameters is alsoincluded.展开更多
基金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.
基金supported by the National Natural Science Foundation of China(91648204 61601486)+1 种基金State Key Laboratory of High Performance Computing Project Fund(1502-02)Research Programs of National University of Defense Technology(ZDYYJCYJ140601)
文摘Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming(DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm.Based on the analysis of DP, this paper proposes a hierarchical directional DP(DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity.
基金supported by the National Natural Science Foundation of China (60904059 60975049)+1 种基金the Philosophy and Social Science Foundation of Hunan Province (2010YBA104)the National High Technology Research and Development Program of China (863 Program)(2009AA04Z107)
文摘A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.
基金supported by the National Natural Science Foundation of China (60672073)the Program for New Century Excellent Talents in University (NCET-06-0537)+1 种基金the Natural Science Foundation of Ningbo (2008A610016)the K.C.Wong Magna Fund in Ningbo University.
文摘Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are constructed with sequential conditional probability in HSI color space. Then, dynamic programming is used to seek the best color mapping relation with the minimum cost path between target image histogram and source image histogram. Finally, video tracking technique is performed to correct multi-view video. Experimental results show that the proposed method can obtain better subjective and objective performance in color correction.
文摘Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccurate in some actual systems. To address such problem, a novel algorithm is proposed based on dynamic programming to manage the number and distribution of replicas in different nodes. By using Markov model, replicas management is organized as a multi-phase process, and the recursion equations are provided. In this algorithm, the heterogeneity of nodes, the expense for maintaining replicas and the engaged space have been considered. Under these restricted conditions, this algorithm realizes high data reliability in a distributed system. The results of case analysis prove the feasibility of the algorithm.
基金National Natural Science Foundation of China(Grant No.52472417)to provide fund for conducting experiments.
文摘Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.
基金Project(L2012082)supported by the Science and Technology Research Funds of Liaoning Provincial Education Department,China
文摘As valuable energy in iron-and steel-making process,by-product gas is widely used in heating and technical processes in steel plant.After being used according to the technical requirements,the surplus by-product gas is usually used for buffer boilers to produce steam.With the rapid development of energy conservation technology and energy consumption level,surplus gas in steel plant continues to get larger.Therefore,it is significant to organize surplus gas among buffer boilers.A dynamic programming model of that issue was established in this work,considering the ramp rate constraint of boilers and the influences of setting gasholders.Then a case study was done.It is shown that dynamic programming dispatch gets more steam generation and less specific gas consumption compared with current proportionate dispatch depending on nominal capacities of boilers.The ignored boiler ramp rate constraint was considered and its contribution to the result validity was pointed out.Finally,the significance of setting gasholders was studied.
文摘This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.
基金supported by the National Natural Science Foundation of China(5110917951179156+2 种基金5137917661473233)the Natural Science Basic Research Plan in Shaanxi Province of China(2014JQ8330)
文摘For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.
文摘A new method is proposed for synthesizing intermediate views from a pair of stereoscopic images. In order to synthesize high-quality intermediate views, the block matching method together with a simplified multi-window technique and dynamic programming is used in the process of disparity estimation. Then occlusion detection is performed to locate occluded regions and their disparities are compensated. After the projecton of the left-to-right and right-to-left disparities onto the intermediate image, intermediate view is synthesized considering occluded regions. Experimental results show that our synthesis method can obtain intermediate views with higher quality.
文摘The control problem of trajectory based path following for passenger vehicles is studied. Comprehensive nonlinear vehicle model is utilized for simulation vehicle response during various maneuvers in MATLAB/Simulink. In order to follow desired path, a driver model is developed to enhance closed loop driver/vehicle model. Then, linear quadratic regulator(LQR) controller is developed which regulates direct yaw moment and corrective steering angle on wheels. Particle swam optimization(PSO) method is utilized to optimize the LQR controller for various dynamic conditions. Simulation results indicate that, over various maneuvers, side slip angle and lateral acceleration can be reduced by 10% and 15%, respectively, which sustain the vehicle stable. Also, anti-lock brake system is designed for longitudinal dynamics of vehicle to achieve desired slip during braking and accelerating. Proposed comprehensive controller demonstrates that vehicle steerability can increase by about 15% during severe braking by preventing wheel from locking and reducing stopping distance.
基金supported by the National Natural Science Foundation of China(7117217271101158+3 种基金71272058)the Program for New Century Excellent Talents in University(NCET-10-0043)the Key Project Cultivation Fund of the Scientific and Technical Innovation Program of Beijing Institute of Technology(2011CX01001)the Special Fund of International Science and Technology Cooperation Program of Beijing Institute of Technology(GZ2014215101)
文摘The problem of stochastically allocating redundant com- ponents to increase the system lifetime is an important topic of reliability. An optimal redundancy allocation is proposed, which maximizes the expected lifetime of a reliability system with sub- systems consisting of components in parallel. The constraints are minimizing the total resources and the sizes of subsystems. In this system, each switching is independent with each other and works with probability p. Two optimization problems are studied by an incremental algorithm and dynamic programming technique respectively. The incremental algorithm proposed could obtain an approximate optimal solution, and the dynamic programming method could generate the optimal solution,
基金supported by the National Natural Science Foundation of China(6102100161133015+4 种基金61171065)the National Natural Science Foundation of China(973 Program)(2013CB329001)the National High Technology ResearchDevelopment Program(863 Program)(2013AA0106052013AA013500)
文摘Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.
基金supported by the National Natural Science Foundation of China (60702033)Natural Science Foundation of Zhe-jiang Province (Y107440)
文摘An efficient algorithm is proposed for computing the solution to the constrained finite time optimal control （CFTOC） problem for discrete-time piecewise affine （PWA） systems with a quadratic performance index. The maximal positively invariant terminal set, which is feasible and invariant with respect to a feedback control law, is computed as terminal target set and an associated Lyapunov function is chosen as terminal cost. The combination of these two components guarantees constraint satisfaction and closed-loop stability for all time. The proposed algorithm combines a dynamic programming strategy with a multi-parametric quadratic programming solver and basic polyhedral manipulation. A numerical example shows that a larger stabilizable set of states can be obtained by the proposed algorithm than precious work.
基金supported by the National Social Science Fund of China (19BGL100)。
文摘This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.Upon each arrival, an admission/routing decision is made, and the accepted job is routed to one of the two servers with each being associated with a queue.After each service completion, the servers have an option of serving a job from its own queue, serving a jockeying job from another queue, or staying idle.The system performance is inclusive of the revenues from accepted jobs, the costs of holding jobs in queues, the service costs and the job jockeying costs.To maximize the total expected discounted return, we formulate a Markov decision process(MDP) model for this system.The value iteration method is employed to characterize the optimal policy as a hedging point policy.Numerical studies verify the structure of the hedging point policy which is convenient for implementing control actions in practice.
文摘Job planning (JP) systems shop oriented provide a basis for job shop scheduling and control in organizing short term production activities. This paper presents a method based on timed Petri net (TPN) method that is used to program optimal JP for assembly shop. It includes three parts further. Firstly, an architecture of solutions to JP problems for any kind of shop oriented is presented to define a particular JP for a designated JP problem. Secondly, Petri net model is specified for aircraft part assembly processes. Finally, algorithms for optimizing generation of dynamic mechanism and a simulating case are then discussed. In comparison with traditional methods such as PERT or CPM, it is obviously convenient for planners or schedulers to schedule and manage assembly processes.
文摘In this paper, a deterministic lot-sizing model is developed for an item during its lifeperiod. A demand for the item is approximated by a special polynomial function. And shortages areallowed to occur in the proposed model. A simple dynamic programming method is presented forgenerating the optimal replenishment policy. A numerical example is used to illustrate the solutionprocedure for the special case with quadric demand. Sensitivity analysis for parameters is alsoincluded.
