English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Path planning problem in multiple automated guided vehicle (AGV) system has been proven to be NP-Hard problem by many researchers. This complex task is being done using various mathematical techniques traditionally. This paper proposes an optimal path planning method for the multiple AGV system based on genetic algorithm. The constraint in the optimization task is that, each AGV starts and returns to transfer center, travelling to a unique set of pick-up stations, each pick-up station is visited by exactly one AGV for goods picking up. The Cost Function is to search for the shortest path i.e. the least distance needed for each AGV to travel from the start location to individual points and back to the original starting place. The experimental results shows the solution in this paper is effective which provide a reference for practical applications. Keywords—pathing planning; genetic algorithm; multiple AGV; optimization; warehouse

Path Planning for Multiple AGV Systems Using Genetic Algorithm in Warehouse