-
101
Production Scheduling considering Outsourcing Options and Carrier Costs
Published 2020-01-01“…Due to the high complexity of the dynamic programming, we developed heuristics and verified their performance through numerical experiments.…”
Get full text
Article -
102
Hybrid Transshipment Policy and Ordering Model for Multiple Periods with Customer Switching Behaviour
Published 2021-01-01“…To cope with this problem, a discrete-time dynamic programming model framework with customer switching behaviour is developed. …”
Get full text
Article -
103
Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates
Published 2024-11-01“…Our approach illuminates shared components and differences between gradient descent, Gauss–Newton, Newton, and differential dynamic programming methods in the context of discrete time nonlinear control. …”
Get full text
Article -
104
3D gesture recognition based on dynamic template matching algorithm for intelligent wearable devices
Published 2019-03-01“…With the popularity of Internet of things equipment,the smart wearing equipment industry develops rapidly,in which wristband smart bracelets and watches are the mainstream.Intelligent wearable devices have abundant sensors and certain computing power.As human-computer interaction for itself and other devices of the Internet of things through gesture recognition,they have a wide range of needs.A 3D gesture recognition system based on dynamic template matching algorithm was proposed.The gesture meaning was judged by collecting user’s specific gesture from hand-held smart devices,and the control of smart devices was realized by using more natural human-computer interaction technology.The motion sensor of intelligent devices was used to read the corresponding 3D gesture data,and the optimized dynamic time warping algorithm was used to recognize gesture.Based on the characteristics of mobile devices and dynamic programming,the curve path was defined by slope.At the same time,the calculation of template matching and the cost of gesture recognition were reduced by pre-storage distortion threshold.The test is carried out on mobile phones,compared with the traditional algorithm,the proposed algorithm takes less time,has higher recognition efficiency and accuracy,and can bring better human-computer interaction experience.…”
Get full text
Article -
105
Model and Algorithm for Human Resource-Constrained R&D Program Scheduling Optimization
Published 2019-01-01“…To solve the model, according to the assumptions and constraints of the model, the initial network diagram of multiple projects is determined, the enumeration algorithm satisfying constraint conditions provides the feasible solution sets, and the algorithm based on dynamic programming is designed for phased optimization. …”
Get full text
Article -
106
SDP-Based Quality Adaptation and Performance Prediction in Adaptive Streaming of VBR Videos
Published 2017-01-01“…In this paper, we propose a new adaptation method for streaming variable bitrate (VBR) videos using stochastic dynamic programming (SDP). With this approach, the system should have a probabilistic characterization along with the definition of a cost function that is minimized by a control strategy. …”
Get full text
Article -
107
Cost-Effective Resource Provisioning for Real-Time Workflow in Cloud
Published 2020-01-01“…In order to address the challenge of cost-effective resource provisioning while meeting the real-time requirements of workflow execution, a resource provisioning strategy based on dynamic programming is proposed to achieve cost-effectiveness of workflow execution in clouds and a critical-path based workflow partition algorithm is presented to guarantee that the workflow can be completed before deadline. …”
Get full text
Article -
108
Spatiotemporally Combined Dimensionality Reduction Algorithm for Optimizing Long-term Operation of Multi-reservoir Systems
Published 2023-01-01“…To alleviate the “curse of dimensionality” and improve the solution efficiency while ensuring the quality of solutions in optimizing the operation of multi-reservoir systems,this paper proposes a spatiotemporally combined dimensionality reduction algorithm which integrates and improves the dynamic programming with successive approximation (DPSA) and the progressive optimality algorithm (POA).First,a chain-based successive approximation strategy is proposed to expand the DPSA's optimization mode from “single reservoir alternation” to “cascade reservoir chain alternation”,which makes up for the DPSA's shortcomings in dealing with the hydraulic coupling relationships among cascade reservoirs.Then,a dynamic variable decoupling strategy and perturbation mechanism are proposed to deal with the POA's blind search problem and dimensionality problem.Finally,the two improved algorithms are combined,in which the improved POA is applied to solving the optimization problems of cascade reservoir chains under the framework of the improved DPSA.The power generation operation problem of the cascade reservoirs in the Yuan River Basin of Hunan Province and the classical ten-reservoir problem are utilized to test the performance of the proposed algorithm.The proposed algorithm outperforms seven existing alternatives in terms of solution quality and efficiency.The results indicate that the proposed algorithm can effectively alleviate the “curse of dimensionality” in optimizing the operation of multi-reservoir systems,improve the efficiency while ensuring the quality of solutions and has potential to be applied to optimizing the operation of complex large-scale multi-reservoir systems.…”
Get full text
Article -
109
Electric Vehicle Charging Route Planning for Shortest Travel Time Based on Improved Ant Colony Optimization
Published 2024-12-01“…To further enhance charging strategies, we develop a discrete electricity dynamic programming (DE-DP) algorithm to determine charging times at efficiently chosen stations. …”
Get full text
Article -
110
An optimal path threshold method for rigorously identifying extreme climate events
Published 2025-01-01“…Here we introduce the Optimal Path Threshold (OPT) method, a dynamic programming-based approach that adaptively determines optimal thresholds for defining extreme events at specific severity levels. …”
Get full text
Article -
111
A Review of Fuzzy Logic and Neural Network Based Intelligent Control Design for Discrete-Time Systems
Published 2016-01-01“…Techniques for NN-based intelligent control for discrete-time systems, such as adaptive methods and adaptive dynamic programming approaches, are also reviewed. Overall, this paper is devoted to make a brief summary for recent progresses in FLC and NN-based intelligent control design for discrete-time systems as well as to present our thoughts and considerations of recent trends and potential research directions in this area.…”
Get full text
Article -
112
Study on Energy-Saving Train Trajectory Optimization Based on Coasting Control in Metro Lines
Published 2023-01-01“…The results show that, for the single-section train control problem, the proposed coasting control algorithm can achieve significant energy-saving effects compared to the practical trajectory and calculate energy-saving trajectory in shorter computation times compared to the dynamic programming method. Meanwhile, for the multisection train control problem, energy consumption can be further reduced by optimizing trajectories and running times integratedly.…”
Get full text
Article -
113
Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine
Published 2014-01-01“…The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. …”
Get full text
Article -
114
Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
Published 2015-01-01“…The optimal lifetime and optimal policy are obtained by Bellman equation in dynamic programming. The proposed algorithm defines the limiting performance in WBAN lifetime under different degrees of fairness constraints. …”
Get full text
Article -
115
Hamilton-Jacobi Reachability in Reinforcement Learning: A Survey
Published 2024-01-01“…Previously, HJ reachability was restricted to verifying low-dimensional dynamical systems primarily because the computational complexity of the dynamic programming approach it relied on grows exponentially with the number of system states. …”
Get full text
Article -
116
Optimal Electric Bus Scheduling under Travel Time Uncertainty: A Robust Model and Solution Method
Published 2021-01-01“…The model is developed based on the dynamic programming equations that we formulated for trip chain robustness checking. …”
Get full text
Article -
117
A Two-Level Model for Traffic Signal Timing and Trajectories Planning of Multiple CAVs in a Random Environment
Published 2021-01-01“…The latter designs multiple CAVs trajectories considering average gasoline consumption. The dynamic programming (DP) and the General Pseudospectral Optimal Control Software (GPOPS) are applied to solve the two-level optimization problem. …”
Get full text
Article -
118
A Novel User Selection Strategy with Incentive Mechanism Based on Time Window in Mobile Crowdsensing
Published 2020-01-01“…In the PS-TWDT, we design a participant selection method based on dynamic programming algorithm. The goal is to maximize the data benefit while the sensing time of the selected participants covers the task time period. …”
Get full text
Article -
119
Nonlinear Stochastic Optimal Control Using Piezoelectric Stack Inertial Actuator
Published 2020-01-01“…The optimal control law is determined by establishing and solving the dynamic programming equation. The proposed control law is analytical and can be fully executed by a piezoelectric stack inertial actuator. …”
Get full text
Article -
120
Deployment optimization for a long-distance wireless backhaul network in industrial cyber physical systems
Published 2017-11-01“…For small networks, we propose a hierarchical traversal method to obtain the optimal solution, whereas for a large network, we used a hierarchical heuristic method to obtain an approximate solution, and for extremely large networks, we used a parallel interactive local search algorithm based on dynamic programming. Then, if the original network layout cannot meet the transmission demands due to traffic bursts, we propose a network bandwidth recovery method based on the Steiner tree to recover the network’s performance. …”
Get full text
Article