An Improved Heuristic-Dynamic Programming Algorithm for Rectangular Cutting Problem

2020 ◽  
pp. 221-233
Author(s):  
Aihua Yin ◽  
Chong Chen ◽  
Dongping Hu ◽  
Jianghai Huang ◽  
Fan Yang
Keyword(s):  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Heuristic Dynamic Programming ◽  
Cutting Problem

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 An improved heuristic-dynamic programming algorithm for rectangular cutting problem

2020 ◽  
Vol 17 (3) ◽  
pp. 717-735
Author(s):  
Aihua Yin ◽  
Chong Chen ◽  
Dongping Hu ◽  
Jianghai Huang ◽  
Fan Yang
Keyword(s):  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Optimal Solution ◽  
Computation Time ◽  
Programming Algorithm ◽  
Recursive Method ◽  
Two Dimensional ◽  
One Dimensional ◽  
Block Width ◽  
Cutting Problem

In this paper, the two-dimensional cutting problem with defects is discussed. The objective is to cut some rectangles in a given shape and direction without overlapping the defects from the rectangular plate and maximize some profit associated. An Improved Heuristic-Dynamic Program (IHDP) is presented to solve the problem. In this algorithm, the discrete set contains not only the solution of one-dimensional knapsack problem with small rectangular block width and height, but also the cutting positions of one unit outside four boundaries of each defect. In addition, the denormalization recursive method is used to further decompose the sub problem with defects. The algorithm computes thousands of typical instances. The computational experimental results show that IHDP obtains most of the optimal solution of these instances, and its computation time is less than that of the latest literature algorithms.

Sign in / Sign up

Export Citation Format

Share Document