Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing probl...Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.展开更多
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 stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource...A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.展开更多
Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made availabl...Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.展开更多
Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v a...Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.展开更多
In the present electricity market, where renewable energy power plants have been included in the power systems, there is a lot of unpredictability in the demand and generation. There are many conventional and evolutio...In the present electricity market, where renewable energy power plants have been included in the power systems, there is a lot of unpredictability in the demand and generation. There are many conventional and evolutionary programming techniques used for solving the unit commitment （UC） problem. Dynamic programming （DP） is a conventional algorithm used to solve the deterministic problem. In this paper DP is used to solve the stochastic model of UC problem. The stochastic modeling for load and generation side has been formulated using an approximate state decision approach. The programs were developed in a MATLAB environment and were exten- sively tested for a four-unit eight-hour system. The results obtained from these techniques were validated with the available literature and outcome was good. The commitment is in such a way that the total cost is minimal. The novelty of this paper lies in the fact that DP is used for solving the stochastic UC problem.展开更多
The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is la...The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is lacking in the global optimization property, while the global optimization algorithms have an unacceptable computation complexity for real-time application. Therefore, a novel hybrid dynamic programming-rule based(DPRB) algorithm is brought forward to solve the global energy optimization problem in a real-time controller of PHEB. Firstly, a control grid is built up for a given typical city bus route, according to the station locations and discrete levels of battery state of charge(SOC). Moreover, the decision variables for the energy optimization at each point of the control grid might be deduced from an off-line dynamic programming(DP) with the historical running information of the driving cycle. Meanwhile, the genetic algorithm(GA) is adopted to replace the quantization process of DP permissible control set to reduce the computation burden. Secondly, with the optimized decision variables as control parameters according to the position and battery SOC of a PHEB, a RB control is used as an implementable controller for the energy management. Simulation results demonstrate that the proposed DPRB might distribute electric energy more reasonably throughout the bus route, compared with the optimized RB. The proposed hybrid algorithm might give a practicable solution, which is a tradeoff between the applicability of RB and the global optimization property of DP.展开更多
在多无人机(Multi-unmanned aerial vehicles,Multi-UAVs)协同执行高层消防救援任务的场景中,室内复杂火场环境下路径规划是亟待解决难题之一.针对快速搜索随机树算法(Rapidly-exploring random tree,RRT)搜索区域受限、耗时较长、结果...在多无人机(Multi-unmanned aerial vehicles,Multi-UAVs)协同执行高层消防救援任务的场景中,室内复杂火场环境下路径规划是亟待解决难题之一.针对快速搜索随机树算法(Rapidly-exploring random tree,RRT)搜索区域受限、耗时较长、结果可行性差等问题,提出RRT森林算法.通过随机选取根节点、生成随机树、连接合并随机树,使高层消防多无人机在复杂室内环境下协同路径规划效率显著提高.此外,采用两次动态规划(Dynamic programming,DP)以及改进障碍物接近检测方法,进一步提高路径的可行性.最终,通过仿真验证算法的有效性.展开更多
文摘Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.
基金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.
文摘A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.
文摘Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.
文摘Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.
文摘In the present electricity market, where renewable energy power plants have been included in the power systems, there is a lot of unpredictability in the demand and generation. There are many conventional and evolutionary programming techniques used for solving the unit commitment （UC） problem. Dynamic programming （DP） is a conventional algorithm used to solve the deterministic problem. In this paper DP is used to solve the stochastic model of UC problem. The stochastic modeling for load and generation side has been formulated using an approximate state decision approach. The programs were developed in a MATLAB environment and were exten- sively tested for a four-unit eight-hour system. The results obtained from these techniques were validated with the available literature and outcome was good. The commitment is in such a way that the total cost is minimal. The novelty of this paper lies in the fact that DP is used for solving the stochastic UC problem.
基金supported by the National Natural Science Foundation of China(Grant No.51275557,5142505)the National Science-Technology Support Plan Projects of China(Grant No.2013BAG14B01)
文摘The optimization of the control strategy of a plug-in hybrid electric bus(PHEB) for the repeatedly driven bus route is a key technique to improve the fuel economy. The widely used rule-based(RB) control strategy is lacking in the global optimization property, while the global optimization algorithms have an unacceptable computation complexity for real-time application. Therefore, a novel hybrid dynamic programming-rule based(DPRB) algorithm is brought forward to solve the global energy optimization problem in a real-time controller of PHEB. Firstly, a control grid is built up for a given typical city bus route, according to the station locations and discrete levels of battery state of charge(SOC). Moreover, the decision variables for the energy optimization at each point of the control grid might be deduced from an off-line dynamic programming(DP) with the historical running information of the driving cycle. Meanwhile, the genetic algorithm(GA) is adopted to replace the quantization process of DP permissible control set to reduce the computation burden. Secondly, with the optimized decision variables as control parameters according to the position and battery SOC of a PHEB, a RB control is used as an implementable controller for the energy management. Simulation results demonstrate that the proposed DPRB might distribute electric energy more reasonably throughout the bus route, compared with the optimized RB. The proposed hybrid algorithm might give a practicable solution, which is a tradeoff between the applicability of RB and the global optimization property of DP.
