Research on unmanned transfer vehicle path planning for raw grain warehousing

A large number of grain machinery and vehicle equipment are usually required in the raw grain storage phase, and these objects together form the path planning map environment for the unmanned grain transfer vehicle. After using LiDAR to build a map of the environment for path planning, these dense and cluttered obstacles tend to affect the path planning effect making the unmanned transfer vehicle create a crossing from the impenetrable dense obstacles. To address this problem, this paper firstly deals with obstacles by fusing the DBSCAN clustering algorithm and K-means clustering algorithm, clustering obstacles, and extracting the cluster centroid and boundary points of each obstacle class to avoid the above situation. Secondly, the specific A* algorithm is improved, the search field way of the A* algorithm is optimized, and the optimized 5×5 field search way is used instead of the traditional 3×3 field search way of A* to improve the node search efficiency of the algorithm. Finally, the repulsion function of the artificial potential field algorithm is added to the A* heuristic function as a safety function to increase the obstacle avoidance capability of the A* algorithm. After verification, the improvement can operate better in the dense and cluttered obstacle environment.

[1]  Ziyu Xu,et al.  A Fuzzy Logic Path Planning Algorithm Based on Geometric Landmarks and Kinetic Constraints , 2022, Inf. Technol. Control..

[2]  T. Allahviranloo,et al.  Optimal data transmission and pathfinding for WSN and decentralized IoT systems using I-GWO and Ex-GWO algorithms , 2022, Alexandria Engineering Journal.

[3]  Thanh Sang-To,et al.  A new metaheuristic optimization based on K-means clustering algorithm and its application to structural damage identification , 2022, Knowl. Based Syst..

[4]  Yu Zhang,et al.  Path Planning Algorithm for Unmanned Surface Vehicle Based on Optimized Ant Colony Algorithm , 2022, IEEJ Transactions on Electrical and Electronic Engineering.

[5]  Tieming Liu,et al.  The EBS-A* algorithm: An improved A* algorithm for path planning , 2022, PloS one.

[6]  D. Stanujkić,et al.  Enhanced multimodal biometric recognition approach for smart cities based on an optimized fuzzy genetic algorithm , 2022, Scientific Reports.

[7]  M. Zivkovic,et al.  Energy Efficient Clustering in Wireless Sensor Networks by Opposition-Based Initialization Bat Algorithm , 2021, Computer Networks and Inventive Communication Technologies.

[8]  Robertas Damaševičius,et al.  Design and Implementation of Autonomous Path Planning for Intelligent Vehicle , 2021, 網際網路技術學刊.

[9]  Nebojsa Bacanin,et al.  Hybrid Fruit-Fly Optimization Algorithm with K-Means for Text Document Clustering , 2021, Mathematics.

[10]  Xin Lai,et al.  Enhanced Center Constraint Weighted A* Algorithm for Path Planning of Petrochemical Inspection Robot , 2021, Journal of Intelligent & Robotic Systems.

[11]  Rytis Maskeliūnas,et al.  A hybrid tactile sensor-based obstacle overcoming method for hexapod walking robots , 2020, Intelligent Service Robotics.

[12]  Zhanying Li,et al.  Optimal search and rescue route design using an improved ant colony optimization , 2020, Inf. Technol. Control..

[13]  Yigao Ning,et al.  WIP Vehicle Control Method Based on Improved Artificial Potential Field Subject to Multi-obstacle Environment , 2020, Inf. Technol. Control..

[14]  Jun Tian,et al.  Hybrid Path Planning Based on Safe A* Algorithm and Adaptive Window Approach for Mobile Robot in Large-Scale Dynamic Environment , 2020, J. Intell. Robotic Syst..

[15]  Daniel Aloise,et al.  Convex fuzzy k-medoids clustering , 2019, Fuzzy Sets Syst..

[16]  Aybeyan Selimi,et al.  Generation of Cryptographic Keys with Algorithm of Polygon Triangulation and Catalan numbers , 2018, Comput. Sci..

[17]  Ferhat Karataş,et al.  Big Data: Controlling Fraud by Using Machine Learning Libraries on Spark , 2018 .

[18]  Yoonho Seo,et al.  Mobile robot path planning with surrounding point set and path improvement , 2017, Appl. Soft Comput..

[19]  Somjit Arch-int,et al.  Determination of the appropriate parameters for K‐means clustering using selection of region clusters based on density DBSCAN (SRCD‐DBSCAN) , 2017, Expert Syst. J. Knowl. Eng..

[20]  Mohd Shahrizal Sunar,et al.  A new weighted pathfinding algorithms to reduce the search time on grid maps , 2017, Expert Syst. Appl..

[21]  Anis Koubâa,et al.  Design and performance analysis of global path planning techniques for autonomous mobile robots in grid environments , 2017 .

[22]  A. Rama Mohan Reddy,et al.  A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method , 2016, Pattern Recognit..

[23]  Sven Koenig,et al.  Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids , 2013, ICAPS.

[24]  Alban Grastien,et al.  Online Graph Pruning for Pathfinding On Grid Maps , 2011, AAAI.

[25]  Sebastian Thrun,et al.  Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments , 2010, Int. J. Robotics Res..

[26]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[27]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[28]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[29]  Taner Çevik,et al.  Adaptive Metaheuristic-Based Methods for Autonomous Robot Path Planning: Sustainable Agricultural Applications , 2022, Applied Sciences.

[30]  Dragan Pamucar,et al.  Cloud-Based Multi-Robot Path Planning in Complex and Crowded Environment Using Fuzzy Logic and Online Learning , 2021, Inf. Technol. Control..

[31]  Weiliang Xu,et al.  Energy Efficient Dynamic Window Approach for Local Path Planning in Mobile Service Robotics , 2016 .

[32]  Wang Peng,et al.  Research on Adaptive Parameters Determination in DBSCAN Algorithm , 2012 .

[33]  Anthony Stentz,et al.  Field D*: An Interpolation-Based Path Planner and Replanner , 2005, ISRR.