Professional Documents
Culture Documents
Peer-review under responsibility of 3rd Asia International Multidisciplanry Conference 2019 editorial board
(http://www.utm.my/asia/our-team/)
© 2019 Published by Readers Insight Publisher,
lat 306 Savoy Residencia, Block 3 F11/1,44000 Islamabad. Pakistan,
info@readersinsight.net
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Copyright © 2019 Authors. This is an open access article distributed under the Creative Commons Attribution License, which permits
unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
1
Science Proceedings Series 1(2) 1-3
RESEARCH OBJECTIVES
The aims of this paper is to give overview of AGV routing. Also explain several AGV
algorithms that used to find shortest path such as Dijkstra algorithm A-star algorithm, Short
Path Problem with Time Window (SPPTW), hybrid partial swarm optimization and genetic
algorithm PSO-GA. Three routing of AGV are disuss. The aim of AGV routing is to find route
that is shortest with possible time path and also feasible (1). In static routing, AGVs use a map
to follow the routes which are predetermined to travel from first station origin to last station
destination (2);(3). The other type is dynamic routing, to increase the speed of process to
finding the AGV routes. In this type the routing decision is depending on actual-time
information for calculation new routes (i.e., the route can change and update during the
implementation process (4). The last type of AGV routing is free range routing this route is
free range because it can use of total free space that is available in the facility without use any
fixed paths. On the other hand, the Position system has two types that is global positioning
system (GPS) and local positioning system (LPS). LPS used widely in many applications such
as Wi-Fi, (RFID), ultrasound systems (IR), Bluetooth, and vision-based systems (5).
RESULTS
AGV Algorithms focus on finding the feasible routes for AGV(1). The design of the algorithm
of AGV routing is to make routing optimization easy and feasible that is related to arrival time,
the avoidance of static obstacles and the planned trajectories of other AGV. AGV algorithm
for dynamic routing is classify to several types. The first type of algorithm is optimal algorithm
used to obtained the global optimal sollution. Another type based on Heuristic approaches that
is discover partial of the available solutions and obtain an nearly solution Finally, there is
hybrid approach based algorithms effect the strengths of both of the previous approaches(6).
Table 1 Comparison of three types AGV routing
AGV Routing Feature Static Dynamic Free Range
The routes that fixed specific route for each use of total free space
Use
into the infrastructure new transportation job available in the facility
increases speed of
Speed Limited speed Better speed
process
Increase Number of infinite number of
Direction Limit route
routes possible routes
Reduced route length less Medium More
Throughput Normal High maximum
Copyright © 2019 Authors. This is an open access article distributed under the Creative Commons Attribution License, which permits
unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2
Science Proceedings Series 1(2) 1-3
CONCLUSION
In this paper routing of AGV, different AGV shortest path algorithm such as Dijkstra algorithm
A-star algorithm, Short Path Problem With Time Window (SPPTW), hybrid partial swarm
optimization and genetic algorithm PSO-GA are presented with highlights and several
limitations among them are observed. Futhermore, the controller using Labview software
directs an AGV along both of static and dynamic routing in real time using LPS
ACKNOWLEDGEMENT
State any acknowledgement if it is required.
REFERENCES
1. Hsu WJ. Scheduling and Routing Algorithms for AGVs : a Survey Scheduling and Routing
Algorithms for AGVs : a Survey School of Applied Science Nanyang Technological University.
2014;(June).
2. Duinkerken MB. JAO. A simulation model for automated container terminals. Proc Bus Ind Simul
Symp Washingt DC [SCS]. 2000;134–9.
3. Duinkerken MB, Lodewijks G. Routing of AGVs on automated container terminals. Proc 2015
IEEE 19th Int Conf Comput Support Coop Work Des CSCWD 2015. 2015;401–6.
4. Vivaldini KCT, Rocha LF, Becker M, Moreira AP. Comprehensive Review of the Dispatching ,
Scheduling and Routing of AGVs. Control - Proc 11th Port Conf Autom Control springer.
2015;321:505–15.
5. Hameedah Sahib Hasan, Mohamed Hussein S. M. S and M. A. MD. An Overview of Local
Positioning System : Technologies , Techniques and Applications. Int J Eng Technol. 2018;7:1–
5.
6. Atique Shaikh PAD. AGV Path Planning and Obstacle Avoidance Using Dijkstra ’ s Algorithm.
2013;2(6):77–83.
7. Hameedah Sahib Hasan, Mohamed Hussein, Shaharil. Mad. Saad and MAMD. Graphical User
Interface ( GUI ) for Local Positioning System Based on Labview. Int J Mach Learn Comput.
2019;9(2):236–41.
Copyright © 2019 Authors. This is an open access article distributed under the Creative Commons Attribution License, which permits
unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
3