scholarly journals Collision-Free Path-Planning for Six-DOF Serial Harvesting Robot Based on Energy Optimal and Artificial Potential Field

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lufeng Luo ◽  
Hanjin Wen ◽  
Qinghua Lu ◽  
Haojie Huang ◽  
Weilin Chen ◽  
...  
Keyword(s):  
Path Planning ◽  
Potential Field ◽  
Test System ◽  
Planning Method ◽  
Artificial Potential Field ◽  
Optimal Method ◽  
Planning Algorithm ◽  
Six Dof ◽  
Searching Method ◽  
Harvesting Robot

Collision-free autonomous path planning under a dynamic and uncertainty vineyard environment is the most important issue which needs to be resolved firstly in the process of improving robotic harvesting manipulator intelligence. We present and apply energy optimal and artificial potential field to develop a path planning method for six degree of freedom (DOF) serial harvesting robot under dynamic uncertain environment. Firstly, the kinematical model of Six-DOF serial manipulator was constructed by using the Denavit-Hartenberg (D-H) method. The model of obstacles was defined by axis-aligned bounding box, and then the configuration space of harvesting robot was described by combining the obstacles and arm space of robot. Secondly, the harvesting sequence in path planning was computed by energy optimal method, and the anticollision path points were automatically generated based on the artificial potential field and sampling searching method. Finally, to verify and test the proposed path planning algorithm, a virtual test system based on virtual reality was developed. After obtaining the space coordinates of grape picking point and anticollision bounding volume, the path points were drew out by the proposed method. 10 times picking tests for grape anticollision path planning were implemented on the developed simulation system, and the success rate was up to 90%. The results showed that the proposed path planning method can be used to the harvesting robot.

scholarly journals Path Planning Method With Improved Artificial Potential Field—A Reinforcement Learning Perspective

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 135513-135523
Author(s):  
Qingfeng Yao ◽  
Zeyu Zheng ◽  
Liang Qi ◽  
Haitao Yuan ◽  
Xiwang Guo ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Path Planning ◽  
Potential Field ◽  
Planning Method ◽  
Artificial Potential Field

scholarly journals A Path Planning Algorithm for a Dynamic Environment Based on Proper Generalized Decomposition

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2245
Author(s):  
Antonio Falcó ◽  
Lucía Hilario ◽  
Nicolás Montés ◽  
Marta C. Mora ◽  
Enrique Nadal
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Real Time ◽  
Potential Field ◽  
Dynamic Environment ◽  
Artificial Potential Field ◽  
Proper Generalized Decomposition ◽  
Partial Differential ◽  
Planning Algorithm ◽  
Path Planning Algorithm

A necessity in the design of a path planning algorithm is to account for the environment. If the movement of the mobile robot is through a dynamic environment, the algorithm needs to include the main constraint: real-time collision avoidance. This kind of problem has been studied by different researchers suggesting different techniques to solve the problem of how to design a trajectory of a mobile robot avoiding collisions with dynamic obstacles. One of these algorithms is the artificial potential field (APF), proposed by O. Khatib in 1986, where a set of an artificial potential field is generated to attract the mobile robot to the goal and to repel the obstacles. This is one of the best options to obtain the trajectory of a mobile robot in real-time (RT). However, the main disadvantage is the presence of deadlocks. The mobile robot can be trapped in one of the local minima. In 1988, J.F. Canny suggested an alternative solution using harmonic functions satisfying the Laplace partial differential equation. When this article appeared, it was nearly impossible to apply this algorithm to RT applications. Years later a novel technique called proper generalized decomposition (PGD) appeared to solve partial differential equations, including parameters, the main appeal being that the solution is obtained once in life, including all the possible parameters. Our previous work, published in 2018, was the first approach to study the possibility of applying the PGD to designing a path planning alternative to the algorithms that nowadays exist. The target of this work is to improve our first approach while including dynamic obstacles as extra parameters.

Grid Based Path Planning Using CNN & Artificial Potential Field Method

2013 ◽  
Vol 392 ◽  
pp. 830-836 ◽  
Author(s):  
Shamina Akter ◽  
Deok Jin Lee ◽  
Shin Taek Lim ◽  
Kil To Chong
Keyword(s):  
Image Processing ◽  
Path Planning ◽  
Potential Field ◽  
Planning Process ◽  
Vision System ◽  
Field Method ◽  
Planning Method ◽  
Artificial Potential Field ◽  
Field Function ◽  
Potential Value

This proposed path planning method combines cellular neural network (CNN) with artificial potential field approach. The fundamental operation based on CNN gray scale image processing and artificial potential is the additional approach for global path-planning. Every point of the environment has a potential value with respect to start and destination position. In the trajectory planning process, a minimum search of potential value of every surrounding neighbor points around a point is done and the neighbor point with the least minimum value is selected as the next location. This procedure is repeated until the goal point is reached. The advantage of using CNN based image processing with artificial potential field function in a vision system is its effectiveness in robot localization while the use of minimum potential value gives a simple yet efficient path planning method. Their feedback criterion is similar to a procedure in filtering the image and it frequently updates the information about obstacles and free path. The parallel processing properties of CNN makes the proposed method robust for real time application.

scholarly journals Improved Artificial Potential Field Method Applied for AUV Path Planning

2020 ◽  
Vol 2020 ◽  
pp. 1-21 ◽  
Author(s):  
Xiaojing Fan ◽  
Yinjing Guo ◽  
Hui Liu ◽  
Bowen Wei ◽  
Wenhong Lyu
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Potential Field ◽  
Moving Objects ◽  
Dynamic Environment ◽  
Planning Method ◽  
Artificial Potential Field ◽  
Local Minima ◽  
Field Function ◽  
Time Path

With the topics related to the intelligent AUV, control and navigation have become one of the key researching fields. This paper presents a concise and reliable path planning method for AUV based on the improved APF method. AUV can make the decision on obstacle avoidance in terms of the state of itself and the motion of obstacles. The artificial potential field (APF) method has been widely applied in static real-time path planning. In this study, we present the improved APF method to solve some inherent shortcomings, such as the local minima and the inaccessibility of the target. A distance correction factor is added to the repulsive potential field function to solve the GNRON problem. The regular hexagon-guided method is proposed to improve the local minima problem. Meanwhile, the relative velocity method about the moving objects detection and avoidance is proposed for the dynamic environment. This method considers not only the spatial location but also the magnitude and direction of the velocity of the moving objects, which can avoid dynamic obstacles in time. So the proposed path planning method is suitable for both static and dynamic environments. The virtual environment has been built, and the emulation has been in progress in MATLAB. Simulation results show that the proposed method has promising feasibility and efficiency in the AUV real-time path planning. We demonstrate the performance of the proposed method in the real environment. Experimental results show that the proposed method is capable of avoiding the obstacles efficiently and finding an optimized path.

Sign in / Sign up

Export Citation Format

Share Document