机器人
任务(项目管理)
预订
计算机科学
运动规划
路径(计算)
共同价值拍卖
最短路径问题
实时计算
数学优化
运筹学
分布式计算
人工智能
工程类
计算机网络
理论计算机科学
系统工程
数学
图形
统计
作者
Yunfeng Fan,Fang Deng,Xiang Shi
标识
DOI:10.23919/ccc50068.2020.9188762
摘要
This paper studies the task allocation and path planning of multi-robot system in a two-dimensional warehouse logistics environment. A task allocation algorithm based on market auctions is used, and an improved Astar algorithm is proposed to implement multi-robot path planning. During the task assignment, robots make bids in conjunction with the cost of the task itself and the associated cost between tasks, in order to optimize the two performance indicators of the total distance of all robots and the total running time of the robots. Compared with the traditional Astar algorithm, the improved Astar algorithm is combined with traffic rules and reservation tables to obtain the shortest path while avoiding problems such as collisions. The simulation results show that the system can effectively implement the tasks of multi-robot task allocation and path planning in a two-dimensional warehouse logistics environment.
科研通智能强力驱动
Strongly Powered by AbleSci AI