DPTM: A UAV Message Transmission Path Optimization Method Under Dynamic Programming

Author(s):  
Pingyu Deng ◽  
Qing Zhou ◽  
Kui Li ◽  
Feifei Zhu
2022 ◽  
Vol 73 ◽  
pp. 102245
Author(s):  
Shintaro Iwamura ◽  
Yoshiki Mizukami ◽  
Takahiro Endo ◽  
Fumitoshi Matsuno

2017 ◽  
Vol 96 (11) ◽  
Author(s):  
Yuto Mori ◽  
Kouji Kashiwa ◽  
Akira Ohnishi

2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Xiaomei Hu ◽  
Zhaoren Pan ◽  
Shunke Lv

The design and application of the mushroom picking robot will greatly reduce the labor cost, and it has become one of the research hotspots in the world. Therefore, we independently developed an A. bisporus (a kind of mushroom) picking robot and introduced its functional principle in this paper. At the same time, in order to improve the picking efficiency of the picking robot, a picking path optimization algorithm based on TSP model is proposed. Firstly, based on the TSP model, a picking route model for A. bisporus was established to determine the storage location of each A. bisporus. Then, an improved simulated annealing (I-SA) search algorithm is proposed to find the optimal path sequence. By improving the path initialization module, path generation module, and temperature drop module, the I-SA search algorithm can optimize the picking path in a short time. Finally, in order to improve the stability and reduce the running time of the I-SA search algorithm, a parallel optimization method for global search (“rough exploration”) and local search (“precision exploration”) is proposed. Through simulation experiments, the I-SA search algorithm can search stable and excellent path solution in a relatively short time. Through field experiments on mushroom base, the efficiency of picking A. bisporus can be improved by 14% to 18%, which verifies the effectiveness of the I-SA search algorithm.


Robotica ◽  
2012 ◽  
Vol 31 (4) ◽  
pp. 643-656 ◽  
Author(s):  
M. H. Korayem ◽  
M. Irani ◽  
A. Charesaz ◽  
A. H. Korayem ◽  
A. Hashemi

SUMMARYThis paper presents a solution for optimal trajectory planning problem of robotic manipulators with complicated dynamic equations. The main goal is to find the optimal path with maximum dynamic load carrying capacity (DLCC). Proposed method can be implemented to problems of both motion along a specified path and point-to-point motion. Dynamic Programming (DP) approach is applied to solve optimization problem and find the positions and velocities that minimize a pre-defined performance index. Unlike previous attempts, proposed method increases the speed of convergence by using the sequential quadratic programming (SQP) formulation. This formulation is used for solving problems with nonlinear constraints. Also, this paper proposes a new algorithm to design optimal trajectory with maximum DLCC for both fixed and mobile base mechanical manipulators. Algorithms for DLCC calculations in previous works were based on indirect optimization method or linear programming approach. The proposed trajectory planning method is applied to a linear tracked Puma and the mobile manipulator named Scout. Application of this algorithm is confirmed and simulation results are compared with experimental results for Scout robot. In experimental test, results are obtained using a new stereo vision system to determine the position of the robot end-effector.


2013 ◽  
Vol 756-759 ◽  
pp. 3941-3945 ◽  
Author(s):  
Wei Yang ◽  
Qian Zhang ◽  
Guo Dong Li

The definition of the cold chain logistics and the problem of the agricultural cold chain logistics are introduced. According to the characteristics of cold chain logistics, exploring the cold chain logistics distribution path optimization method. Based on the model of the agricultural products cold chain logistics distribution routing optimization, particle swarm optimization algorithm is constructed to solve the optimization problem. Taking an example, the results have been conducted finally to demonstrate the effectiveness of the algorithm for agricultural products cold chain logistics distribution routing optimization problem.


2016 ◽  
Vol 30 (17-18) ◽  
pp. 1126-1144 ◽  
Author(s):  
Mylène Campana ◽  
Florent Lamiraux ◽  
Jean-Paul Laumond

Sign in / Sign up

Export Citation Format

Share Document