Research on Path Planning Algorithm for Two-Dimensional Code Guidance Model of Automated Guided Vehicle

2019 ◽  
pp. 355-365
Author(s):  
Wei-Dong Zheng ◽  
Ben Yan ◽  
Zhi-Xian Li ◽  
Hua-Ping Yao ◽  
Li-Li Wei ◽  
...  
Keyword(s):  
Path Planning ◽  
Automated Guided Vehicle ◽  
Two Dimensional ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Guidance Model

scholarly journals A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 80347-80357 ◽  
Author(s):  
Bo Yang ◽  
Wentao Li ◽  
Jianrong Wang ◽  
Jingjie Yang ◽  
Tiantian Wang ◽  
...  
Keyword(s):  
Path Planning ◽  
Two Dimensional ◽  
Grid Model ◽  
Planning Algorithm ◽  
Path Planning Algorithm

Guidance Model Representing an Ice Field for Path-Planning in Ice Management

2020 ◽  
Author(s):  
Jon Bjørnø ◽  
Mathias Marley ◽  
Roger Skjetne
Keyword(s):  
Path Planning ◽  
Breaking Effect ◽  
B Splines ◽  
Planning Algorithm ◽  
Broken Ice ◽  
Ice Field ◽  
Ice Floes ◽  
Path Planning Algorithm ◽  
Guidance Information ◽  
Guidance Model

Abstract In the work presented in this paper, the problem on how to represent a simplified ice field in a guidance model, enabling path and maneuver planning for IM operation, has been studied. The use of B-splines and other basis functions are considered to represent relevant guidance information over the 2D drifting ice field. A weight value is computed and updated at locations that represents broken ice (visited by an icebreaker) versus unbroken ice. The guidance model will ensure that there is a continuous representation of the state of the ice field during the operations. The drifting behavior of the ice field is incorporated into the guidance model. The model will be updated with new (solid) ice that is formed at the beginning of the ice field, and it will continuously be updated in the path where the icebreaker moves. To simulate the maneuvers of the icebreaker, a dynamic model is used, and the ice breaking effect where the ice field is continuously broken into smaller ice floes is included in the model. This representation of an ice field can be used in a path-planning algorithm to determine the icebreaker path in a moving ice environment in order to reduce the ice field into small enough ice floes and reduce the load on the protected structure.

scholarly journals Two Dimensional Path Planning with Static Polygon Obstacles Avoidance

2020 ◽  
Vol sceeer (3d) ◽  
pp. 65-72
Author(s):  
Duaa Ramadhan ◽  
Abdulmuttalib Rashid ◽  
Osama Rashid
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Binary Tree ◽  
The Other ◽  
Planning System ◽  
Time Of Arrival ◽  
Two Dimensional ◽  
Differential Drive ◽  
Planning Algorithm ◽  
Path Planning Algorithm

This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm has better performance than the other algorithms and get less time of arrival and shortest path with free collision.

scholarly journals Two Dimensional Path Planning with Static Polygon Obstacles Avoidance

2020 ◽  
Vol sceeer (3d) ◽  
pp. 65-72
Author(s):  
Duaa Ramadhan ◽  
Abdulmuttalib Rashid ◽  
Osama Rashid
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Binary Tree ◽  
The Other ◽  
Planning System ◽  
Time Of Arrival ◽  
Two Dimensional ◽  
Differential Drive ◽  
Planning Algorithm ◽  
Path Planning Algorithm

This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm has better performance than the other algorithms and get less time of arrival and shortest path with free collision.

Toward the Accurate Coverage of Aspheric Surfaces Using Two-Dimensional Scanning Paths for Minimizing Regular Errors

2007 ◽  
Vol 364-366 ◽  
pp. 64-68
Author(s):  
Hao Bo Cheng ◽  
Jing Feng Zhi ◽  
Yong Tian Wang ◽  
Jing Bian
Keyword(s):  
Path Planning ◽  
Material Removal ◽  
Tool Path ◽  
Two Dimensional ◽  
Tool Path Planning ◽  
Aspheric Surfaces ◽  
Neuro Fuzzy ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Error Removal

This paper describes a two-dimensional tool-path planning model for minimizing the regularly distributed errors or mid-frequency errors during computer controlled optical surfacing (CCOS) by optimally connecting different tool-path segments. The model was established based on a neuro-fuzzy algorithm, a path neighborhood function which is defined as a victorious output element calculated in a self-organization way, then, the optimum material removal function with a modified weight was derived. The material removal function was studied theoretically and the results of simulation present a Gaussian distribution feature. Discrete removal points and optimized tool-path grid were simulated. Finally, an experiment involving a parabolic mirror was performed for residual error removal and the two-dimensional tool-path planning algorithm was found to be valid.

Sign in / Sign up

Export Citation Format

Share Document