A method performed by a computing device for controlling a first automated guided vehicle and a second automated guided vehicle, the method comprising: - obtaining information on an area including nodes arranged in a grid pattern; - obtaining information on moving paths (12, 14, 13, 15, 16) each connecting a source node and a destination node existing in the area, wherein each of the moving paths (12, 14, 13, 15, 16) includes a plurality of moving path nodes, the obtaining of the information on the moving paths (12, 14, 13, 15, 16) comprises: - searching for a first moving path (12, 14) from a first source node of the first automated guided vehicle to the destination node; - searching for a second moving path (13, 15, 16) from a second source node of the second automated guided vehicle to the destination node; and - determining a moving path (12, 14, 13, 15, 16) including a smaller number of moving path nodes among the first moving path (12, 14) and the second moving path (13, 15, 16) as a shortest moving path; - reserving at least one of the shortest moving path nodes located between a current node and the destination node by using information on the current node occupied by the automated guided vehicle having the shortest moving path; and - transmitting, to the automated guided vehicle having the shortest moving path, a signal for moving the automated guided vehicle having the shortest moving path along the shortest moving path to the destination node to sequentially visit the reserved at least one of the moving path nodes, wherein the determining of the moving path further comprises: - when the number of moving path nodes included in the first moving path (12, 14) and the number of moving path nodes included in the second moving path (13, 15, 16) are the same, determining which one of the first and second automated guided vehicles (3, 4) can reach the destination node faster, and - determining the moving path of the one of the first and second automated guided vehicles (3, 4) which can reach the destination node faster as the shortest moving path. - obtaining information on an area including nodes arranged in a grid pattern; - obtaining information on moving paths (12, 14, 13, 15, 16) each connecting a source node and a destination node existing in the area, wherein each of the moving paths (12, 14, 13, 15, 16) includes a plurality of moving path nodes, the obtaining of the information on the moving paths (12, 14, 13, 15, 16) comprises: - searching for a first moving path (12, 14) from a first source node of the first automated guided vehicle to the destination node; - searching for a second moving path (13, 15, 16) from a second source node of the second automated guided vehicle to the destination node; and - determining a moving path (12, 14, 13, 15, 16) including a smaller number of moving path nodes among the first moving path (12, 14) and the second moving path (13, 15, 16) as a shortest moving path; - searching for a first moving path (12, 14) from a first source node of the first automated guided vehicle to the destination node; - searching for a second moving path (13, 15, 16) from a second source node of the second automated guided vehicle to the destination node; and - determining a moving path (12, 14, 13, 15, 16) including a smaller number of moving path nodes among the first moving path (12, 14) and the second moving path (13, 15, 16) as a shortest moving path; - reserving at least one of the shortest moving path nodes located between a current node and the destination node by using information on the current node occupied by the automated guided vehicle having the shortest moving path; and - transmitting, to the automated guided vehicle having the shortest moving path, a signal for moving the automated guided vehicle having the shortest moving path along the shortest moving path to the destination node to sequentially visit the reserved at least one of the moving path nodes, - when the number of moving path nodes included in the first moving path (12, 14) and the number of moving path nodes included in the second moving path (13, 15, 16) are the same, determining which one of the first and second automated guided vehicles (3, 4) can reach the destination node faster, and - determining the moving path of the one of the first and second automated guided vehicles (3, 4) which can reach the destination node faster as the shortest moving path.