Heuristic dynamic programming algorithm for task sequencing and scheduling of single machine with time D-subsets

2010 ◽  
Author(s):  
Yanping Li ◽  
Junwei Zhu ◽  
Xinling Yang ◽  
Na Zhang
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Task Sequencing ◽  
Sequencing And Scheduling ◽  
Heuristic Dynamic Programming

Globalized Dual Heuristic Dynamic Programming in Control of Robotic Manipulator

2016 ◽  
Vol 817 ◽  
pp. 150-161 ◽  
Author(s):  
Marcin Szuster ◽  
Piotr Gierlak
Keyword(s):  
Neural Networks ◽  
Dynamic Programming ◽  
Control System ◽  
Degrees Of Freedom ◽  
Dynamic Programming Algorithm ◽  
Robotic Manipulator ◽  
Iteration Step ◽  
Programming Algorithm ◽  
Heuristic Dynamic Programming ◽  
The Stability

The article focuses on the implementation of the globalized dual-heuristic dynamic programming algorithm in the discrete tracking control system of the three degrees of freedom robotic manipulator. The globalized dual-heuristic dynamic programming algorithm is included in the approximate dynamic programming algorithms family, that bases on the Bellman’s dynamic programming idea. These algorithms generally consist of the actor and the critic structures realized in a form of artificial neural networks. Moreover, the control system includes the PD controller, the supervisory term and an additional control signal. The structure of the supervisory term derives from the stability analysis, which was realized using the Lyapunov stability theorem. The control system works on-line and the neural networks’ weight adaptation process is realized in every iteration step. A series of computer simulations was realized in Matlab/Simulink software to confirm performance of the control system.

scholarly journals Discrete Globalised Dual Heuristic Dynamic Programming in Control of the Two-Wheeled Mobile Robot

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Marcin Szuster ◽  
Zenon Hendzel
Keyword(s):  
Neural Networks ◽  
Dynamic Programming ◽  
Control System ◽  
Mobile Robot ◽  
Tracking Control ◽  
Dynamic Programming Algorithm ◽  
Wheeled Mobile Robot ◽  
Programming Algorithm ◽  
The Neural Networks ◽  
Heuristic Dynamic Programming

Network-based control systems have been emerging technologies in the control of nonlinear systems over the past few years. This paper focuses on the implementation of the approximate dynamic programming algorithm in the network-based tracking control system of the two-wheeled mobile robot, Pioneer 2-DX. The proposed discrete tracking control system consists of the globalised dual heuristic dynamic programming algorithm, the PD controller, the supervisory term, and an additional control signal. The structure of the supervisory term derives from the stability analysis realised using the Lyapunov stability theorem. The globalised dual heuristic dynamic programming algorithm consists of two structures: the actor and the critic, realised in a form of neural networks. The actor generates the suboptimal control law, while the critic evaluates the realised control strategy by approximation of value function from the Bellman’s equation. The presented discrete tracking control system works online, the neural networks’ weights adaptation process is realised in every iteration step, and the neural networks preliminary learning procedure is not required. The performance of the proposed control system was verified by a series of computer simulations and experiments realised using the wheeled mobile robot Pioneer 2-DX.

scholarly journals Batch Scheduling on a Single Machine with Maintenance Interval

2020 ◽  
Author(s):  
Zhang Honglin ◽  
Bin Qian ◽  
Yaohua Wu
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Manufacturing Industry ◽  
Dynamic Programming Algorithm ◽  
Batch Scheduling ◽  
Programming Algorithm ◽  
Small Scale ◽  
Field Representation ◽  
Machine Failure ◽  
Delivery Costs

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

Sign in / Sign up

Export Citation Format

Share Document