According to low earth orbit（LEO） satellite systems with users of different levels, a dynamic channel reservation scheme based on priorities is proposed. Dynamic calculation of the thresholds for reserved channels i...According to low earth orbit（LEO） satellite systems with users of different levels, a dynamic channel reservation scheme based on priorities is proposed. Dynamic calculation of the thresholds for reserved channels is the key of this strategy. In order to obtain the optimal thresholds, the traffic is predicted based on the high-speed deterministic movement property of LEO satellites firstly. Then, a channel allocation model based on Markov is established. Finally, the solution of the model is obtained based on the genetic algorithm. Without user location, this strategy effectively reduces handover failures and improves channel utilization by adjusting dynamically the thresholds according to traffic conditions. The simulation results show that the system＇s overall quality of service can be improved by this strategy.展开更多
As the exploration and exploitation of oil and gas proliferate throughout deepwater area, the requirements on the reliability of dynamic positioning system become increasingly stringent. The control objective ensuring...As the exploration and exploitation of oil and gas proliferate throughout deepwater area, the requirements on the reliability of dynamic positioning system become increasingly stringent. The control objective ensuring safety operation at deep water will not be met by a single controller for dynamic positioning. In order to increase the availability and reliability of dynamic positioning control system, the triple redundancy hardware and software control architectures were designed and developed according to the safe specifications of DP-3 classification notation for dynamically positioned ships and rigs. The hardware redundant configuration takes the form of triple-redundant hot standby configuration including three identical operator stations and three real-time control computers which connect each other through dual networks. The function of motion control and redundancy management of control computers were implemented by software on the real-time operating system VxWorks. The software realization of task loose synchronization, majority voting and fault detection were presented in details. A hierarchical software architecture was planed during the development of software, consisting of application layer, real-time layer and physical layer. The behavior of the DP-3 dynamic positioning control system was modeled by a Markov model to analyze its reliability. The effects of variation in parameters on the reliability measures were investigated. The time domain dynamic simulation was carried out on a deepwater drilling rig to prove the feasibility of the proposed control architecture展开更多
The specific features of the CAN bus is analyzed and the functional performances in the Controller Area Network (CAN) bus system of Wire Harness Assembly Machine (WHAM) is discussed. A reasonable definition of applica...The specific features of the CAN bus is analyzed and the functional performances in the Controller Area Network (CAN) bus system of Wire Harness Assembly Machine (WHAM) is discussed. A reasonable definition of application layer which is not defined in the CAN specification is given for the control system of WHAM. So application layer planning of CAN bus for dynamic priority is presented. With the mechanism of dynamic priority,it becomes easily to find out the error nodes in the CAN bus system of WHAM and realize multi-mode operation.展开更多
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.展开更多
One problem with the existing dynamic exclusive bus lane strategies is that bus signal priority strategies with multi-phase priority request at intersections are not adequately considered.The principle of bus signal p...One problem with the existing dynamic exclusive bus lane strategies is that bus signal priority strategies with multi-phase priority request at intersections are not adequately considered.The principle of bus signal priority level was designed based on the isolated multi-phase structure principle consideration of the bus signal priority,and a new priority approach for the dynamic exclusive bus lane was proposed.Two types of priority strategies,green extension and red truncation,were proposed for current phase and next phase buses,respectively.The control parameters including minimum green time,green extension time,maximum green time and bus arrival time are calculated.The case studies for this paper were carried out using four consecutive intersections of Huaide Middle Road in Changzhou City.The signal control scheme was designed using the conventional,exclusive bus lane method,the dynamic exclusive bus lane without signal priority method,and the proposed approach,respectively.The authors used the VISSIM simulation platform to evaluate the efficiency of each approach.Results showed that the method of approach can significantly decrease delays caused by social and conventional buses and make up for the negative impact social buses have on the bus rapid transit(BRT)operation,which allows the method to complement the dynamic,exclusive bus lane design.展开更多
In order to deal with the dynamic positioning system control problems of dredgers working under strong dredging reaction or harsh environments,an adaptive backstepping method is proposed.Disturbances are estimated and...In order to deal with the dynamic positioning system control problems of dredgers working under strong dredging reaction or harsh environments,an adaptive backstepping method is proposed.Disturbances are estimated and compensated for by the adaptive method without extra sensors on dredging equipment,and the control mechanism is simplified.Adaptive control is used to compensate for the reaction and environmental disturbances on the dredger,so the dredger can maintain the desired position with a minimum error and shock.The proposed adaptive robust controller guarantees the global asymptotic stability of the closed-loop system and rapid position tracking of the dredger.The simulation results show that the proposed controller has superior performance in position tracking and robustness to large disturbances.展开更多
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.展开更多
With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrat...With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrate resources.In this paper,a dynamic network slicing mechanism including virtual network(VN)mapping and VN reconfiguration is proposed to provide network slices for services.Firstly,a service priority model is defined to create queue for resource allocation.Then a slice including Virtual Network Function(VNF)placement and routing with optimal cost is generated by VN mapping.Next,considering temporal variations of service resource requirements,the size of network slice is adjusted dynamically to guarantee resource utilization in VN reconfiguration.Additionally,load balancing factors are designed to make traffic balanced.Simulation results show that dynamic slicing mechanism not only saves 22%and 31%cost than static slicing mechanism with extending shortest path(SS_ESP)and dynamic slicing mechanism with embedding single path(DS_ESP),but also maintains high service acceptance rate.展开更多
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.展开更多
Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to t...Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well.展开更多
基金supported by the National Natural Science Foundation of China(7130108161373137)+1 种基金the Natural Science Foundation of Jiangsu Province(BK20130877BK2012833)
文摘According to low earth orbit（LEO） satellite systems with users of different levels, a dynamic channel reservation scheme based on priorities is proposed. Dynamic calculation of the thresholds for reserved channels is the key of this strategy. In order to obtain the optimal thresholds, the traffic is predicted based on the high-speed deterministic movement property of LEO satellites firstly. Then, a channel allocation model based on Markov is established. Finally, the solution of the model is obtained based on the genetic algorithm. Without user location, this strategy effectively reduces handover failures and improves channel utilization by adjusting dynamically the thresholds according to traffic conditions. The simulation results show that the system＇s overall quality of service can be improved by this strategy.
基金supported by the National Natural Science Foundation of China (Grant No. 50909025)the National High Technology Development Program of China (Grant No. 2008AA092301)
文摘As the exploration and exploitation of oil and gas proliferate throughout deepwater area, the requirements on the reliability of dynamic positioning system become increasingly stringent. The control objective ensuring safety operation at deep water will not be met by a single controller for dynamic positioning. In order to increase the availability and reliability of dynamic positioning control system, the triple redundancy hardware and software control architectures were designed and developed according to the safe specifications of DP-3 classification notation for dynamically positioned ships and rigs. The hardware redundant configuration takes the form of triple-redundant hot standby configuration including three identical operator stations and three real-time control computers which connect each other through dual networks. The function of motion control and redundancy management of control computers were implemented by software on the real-time operating system VxWorks. The software realization of task loose synchronization, majority voting and fault detection were presented in details. A hierarchical software architecture was planed during the development of software, consisting of application layer, real-time layer and physical layer. The behavior of the DP-3 dynamic positioning control system was modeled by a Markov model to analyze its reliability. The effects of variation in parameters on the reliability measures were investigated. The time domain dynamic simulation was carried out on a deepwater drilling rig to prove the feasibility of the proposed control architecture
文摘The specific features of the CAN bus is analyzed and the functional performances in the Controller Area Network (CAN) bus system of Wire Harness Assembly Machine (WHAM) is discussed. A reasonable definition of application layer which is not defined in the CAN specification is given for the control system of WHAM. So application layer planning of CAN bus for dynamic priority is presented. With the mechanism of dynamic priority,it becomes easily to find out the error nodes in the CAN bus system of WHAM and realize multi-mode operation.
基金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.
基金This research was funded by National Natural Science Foundation of China(NSFC),grant number 51678076Hunan Provincial Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems,grant number 2017TP1016.
文摘One problem with the existing dynamic exclusive bus lane strategies is that bus signal priority strategies with multi-phase priority request at intersections are not adequately considered.The principle of bus signal priority level was designed based on the isolated multi-phase structure principle consideration of the bus signal priority,and a new priority approach for the dynamic exclusive bus lane was proposed.Two types of priority strategies,green extension and red truncation,were proposed for current phase and next phase buses,respectively.The control parameters including minimum green time,green extension time,maximum green time and bus arrival time are calculated.The case studies for this paper were carried out using four consecutive intersections of Huaide Middle Road in Changzhou City.The signal control scheme was designed using the conventional,exclusive bus lane method,the dynamic exclusive bus lane without signal priority method,and the proposed approach,respectively.The authors used the VISSIM simulation platform to evaluate the efficiency of each approach.Results showed that the method of approach can significantly decrease delays caused by social and conventional buses and make up for the negative impact social buses have on the bus rapid transit(BRT)operation,which allows the method to complement the dynamic,exclusive bus lane design.
基金The National Basic Research Program of China (973 Program) (No. 2005CB221505)Open Fund of Provincial Open Laboratory for Control Engineering Key Disciplines (No. KG2009-02)
文摘In order to deal with the dynamic positioning system control problems of dredgers working under strong dredging reaction or harsh environments,an adaptive backstepping method is proposed.Disturbances are estimated and compensated for by the adaptive method without extra sensors on dredging equipment,and the control mechanism is simplified.Adaptive control is used to compensate for the reaction and environmental disturbances on the dredger,so the dredger can maintain the desired position with a minimum error and shock.The proposed adaptive robust controller guarantees the global asymptotic stability of the closed-loop system and rapid position tracking of the dredger.The simulation results show that the proposed controller has superior performance in position tracking and robustness to large disturbances.
基金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.
基金This work is supported by National Natural Science Foundation of China(No.61702048).
文摘With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrate resources.In this paper,a dynamic network slicing mechanism including virtual network(VN)mapping and VN reconfiguration is proposed to provide network slices for services.Firstly,a service priority model is defined to create queue for resource allocation.Then a slice including Virtual Network Function(VNF)placement and routing with optimal cost is generated by VN mapping.Next,considering temporal variations of service resource requirements,the size of network slice is adjusted dynamically to guarantee resource utilization in VN reconfiguration.Additionally,load balancing factors are designed to make traffic balanced.Simulation results show that dynamic slicing mechanism not only saves 22%and 31%cost than static slicing mechanism with extending shortest path(SS_ESP)and dynamic slicing mechanism with embedding single path(DS_ESP),but also maintains high service acceptance rate.
文摘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.
文摘Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well.
