返回
A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model
DOI:10.1109/ACCESS.2020.2991076.png)
摘要
En 中文
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 type warehouse as a node-based 2D grid model. Then, a new concept called the largest convex polygon (LCP) is introduced to illustrate the shortest path to traverse all goods locations in an ideal condition. Next, the remaining locations are classified by their relationship with LCP and designed path planning rules separately. Finally, we merged the paths of different types of cargo locations to get the final path. The experimental results show that, compared with ant colony optimization (ACO) and genetic algorithm (GA), our proposed algorithm could effectively reduce the computation time and total path length.
Keyword:
Warehouse robots
path planning
TSP
2D grid model
largest convex polygon
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm基于改进遗传算法的连续环境多目标多机器人路径规划
Trajectory Optimization With Particle Swarm Optimization for Manipulator Motion Planning基于粒子群算法的机械臂运动规划轨迹优化
Reconnaissance Mission Conducted by UAV Swarms Based on Distributed PSO Path Planning Algorithms基于分布式PSO路径规划算法的无人机群侦察任务
IEEE ACCESS
IF3.6
A Self-Heuristic Ant-Based Method for Path Planning of Unmanned Aerial Vehicle in Complex 3-D Space With Dense U-Type Obstacles
IEEE ACCESS
IF3.6
Path planning for mobile robot using self-adaptive learning particle swarm optimization基于自适应学习粒子群算法的移动机器人路径规划
Optimal Path Finding With Beetle Antennae Search Algorithm by Using Ant Colony Optimization Initialization and Different Searching Strategies
IEEE ACCESS
IF3.6

