The Algebraic Algorithm for Path Planning Problem of AGV in Flexible Manufacturing System

With the rapid development of computer technology and automation technology, Flexible Manufacturing System (FMS) as a modern advanced manufacturing mode is getting more and more attention by enterprises. Automated Guided Vehicle (AGV) is the main loading and unloading, and transportation instrument with its advantages of intelligent and flexible in the system. AGV has played an important role in the realization of logistics informatization, reduce logistics cost, improve the efficiency of the enterprise. Scheduling and route planning of these tasks from the system were made based on the proposed path planning methods in the empowerment directed acyclic graph. In this paper, an algebraic algorithm is proposed for a simple weighted path planning problem. Based on algebraic algorithm, the shortest path and its minimum iteration steps are calculated through direct distance matrix. The experimental results show that using this algorithm, the shortest path and its length can be obtained quickly. At the same time, compared with the traditional Dijkstra algorithm, the performance of the proposed algorithm is improved.