Path Planning for Batch Picking of Warehousing and Logistics Robots Based on Modified A* Algorithm
DOI:
https://doi.org/10.3991/ijoe.v14i11.9527Keywords:
warehousing and logistics robot, A* algorithm, path planning, batch pickingAbstract
To make the picking path planning of warehousing and logistics robot in warehouse more efficient and real-time, a path planning for batch picking of warehousing and logistics robots based on the modified A* algorithm was put forward. First of all, the path planning of the single robot batch picking was realized. Then, the time cost was introduced to further improve the A* algorithm to realize the batch picking path planning of the multi-warehouse logistics robots. Finally, according to the algorithm proposed, .Net visual programming technology was applied to build a complete warehouse logistics robot picking path planning simulation system to verify the effectiveness of the algorithm proposed. The research results showed that the algorithm proposed could meet the needs of efficient and real-time path planning in the process of completing batch picking tasks. To sum up, it lays a solid foundation for the realization of intelligent and fully automated warehouse management.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.