A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model
In this paper, the path planning problem of goods transportation is formulated as a traveling salesman problem (TSP). A novel path planning algorithm for warehouse robots based on a two-dimensional (2D) grid model is proposed to solve this type of TSP. Firstly, we simplified the traditional pile typ...
Main Authors: | Bo Yang, Wentao Li, Jianrong Wang, Jingjie Yang, Tiantian Wang, Xin Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9079867/ |
Similar Items
-
Intelligent Warehouse Robot Path Planning Based on Improved Ant Colony Algorithm
by: Yun Chen, et al.
Published: (2023-01-01) -
Mobile Robot Path Optimization Technique Based on Reinforcement Learning Algorithm in Warehouse Environment
by: HyeokSoo Lee, et al.
Published: (2021-01-01) -
An Algorithm of Coverage Path Planning for UAV in Concave Polygon Area
by: Wang Hongxing, Ma Xuejiao, Zhang Changsen
Published: (2021-12-01) -
Two-level vehicle path planning model for multi-warehouse robots with conflict solution strategies and improved ACO
by: Pan Wu, et al.
Published: (2023-06-01) -
An Occupancy Information Grid Model for Path Planning of Intelligent Robots
by: Jinming Zhang, et al.
Published: (2022-03-01)