Genetic Algorithm Solution for Transfer Robot Operation
Keywords:robotics, warehouse, genetic algorithm, chromosome, decision-making
The proposed article presents the research of decision-making processes for control system of transport robot, acting inside warehouse. The analysis shows the growing importance of warehouse systems for flexible integrated system. Such warehouse operations, like loading/uploading pallets and sending goods to distribution center can be fully automated by applying robots and some examples are known. Simultaneously, the wide introduction of transport robots with extended possibilities is still limited. Application of intelligent robot can significantly improve properties of warehouse systems, making them closer to Industry 4.0 standards. The functioning of a transport robot can be described as a Travelling Salesmen Problem with numerous solutions that must be effectively limited. Genetic algorithms are proposed as a basis for path generation. The algorithms and software are implemented to model warehouse transfer robots using an Arduino-robot. The results of testing show the effectiveness of the developed algorithms, software and hardware system.
E. Mikhailov, B. Remenyuk, “Optimize the placement warehouse transport system,” Journal of Electrotechnic and Computer systems, no. 18 (94), pp. 60–64, 2015.
S. Thrun, Probabilistic Robotics, The MIT Press, 2005, 667 p.
A. Khor, A. Yong, Robotics in Supply chain, in: L. Huan, S. Raman (Eds.), Emerging Trends of Technologies in Supply Chain Management, WOU Press, 2018, pp. 25-38.
I. Nevliudov, O. Tsymbal, A. Bronnikov, “Intelligent means in the system of managing a manufacturing agent,” Innovative Technologies and Scientific Solutions for Industries, no. 1 (3), pp. 33–47, 2018, https://doi.org/10.30837/2522-9818.2018.3.033.
O. Tsymbal, A. Bronnikov, “Decision-making information technology for flexible integrated manufacturing,” Innovative Technologies and Scientific Solutions for Industries, no. 2 (8), pp. 105–112, 2019, https://doi.org/10.30837/2522-9818.2019.8.105.
V. Vacic, T. Sobh, “Vehicle routing problem with time windows,” International Journal of Computing, vol. 3, issue 2, pp. 72–80, 2004, https://doi.org/10.47839/ijc.3.2.289.
V. Red’ko, “Interaction between learning and evolution in population of autonomous agents,” International Journal of Computing, vol. 12, issue 1, pp. 42–47, 2013, https://doi.org/10.47839/ijc.12.1.586.
C.E. Thomaz, M.A.C. Pacheco, M.M.B.R. Vellasco, “Mobile robot path planning using genetic algorithms,” In: Mira J., Sánchez-Andrés J.V. (eds) Foundations and Tools for Neural Modeling. IWANN 1999. Lecture Notes in Computer Science, vol. 1606. Springer, Berlin, Heidelberg, https://doi.org/10.1007/BFb0098225.
C. Zheng, H. Liu, M. Ge, Y. Liu, “A novel maze representation approach for finding filled path of a mobile robot,” Proceedings of the International Conference on Computer, Network, Communication and Information Systems (CNCI’2019), Advances in Computer Science Research, vol. 88, 2019, pp. 664-673, https://doi.org/10.2991/cnci-19.2019.92.
S. Števo, I. Sekaj, M. Dekan, “Optimization of robotic arm trajectory using genetic algorithm,” Proceedings of the 19th World Congress the International Federation of Automatic Control Cape Town, South Africa, August 24-29, 2014, pp. 1748-1753, https://doi.org/10.3182/20140824-6-ZA-1003.01073.
O. Chocrone, P. Bidaud, “Evolutional algorithms in kinematic design of robotic systems,” Proceedings of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, Grenoble, France, Sept. 8-12, 1997, pp. 279-286.
B. Eldridge, A. Maciejewski, “Using genetic algorithms to optimize social robot behavior for improved pedestrian flow,” Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Waikoloa, Hawaii, October 10-12, 2005, pp. 525-529.
J. Xin, J. Zhong, F. Yang, Y. Cui, J. Sheng, “An improved genetic algorithm for path-planning of unmanned surface vehicle,” Sensors, vol. 19, paper 2640, 2019, https://doi.org/10.3390/s19112640.
G. Nagib, W. Gharieb, “Path planning for a mobile robot using Genetic Algorithms,” Proceedings of the International Conference on Electrical, Electronic and Computer Engineering (ICEEC’04), 2004, pp. 185-190.
K. Kwaśniewski, Z. Gosiewski, “Genetic algorithm for mobile robot route planning with obstacle avoidance,” Acta Mechanica et Automatica, vol. 12 no. 2, pp. 151-159, 2018, https://doi.org/10.2478/ama-2018-0024.
M. Fetanat, S. Haghzad, S. Shouraki, “Optimization of dynamic mobile robot path planning based on evolutionary methods,” Proceedings of the AI & Robotics (IRANOPEN 2015), 2015, pp. 1–7, https://doi.org/10.1109/RIOS.2015.7270743.
A. Balaji, P. Padmanabhan, “Multi-objective optimization of mobile robot path planning using genetic algorithm,” IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE), pp. 17-20, 2011.
K. Sedighi, K. Ashenayi, T. Manikas, R. Wainwright, H. Tai, “Autonomous local path planning for a mobile robot using a genetic algorithm,” Proceedings of the Congress on Evolutionary Computation, Portland, OR, 19–23 June 2004, pp. 1338–1345.
B. Wu, Y. Wang, “Mobile robot dynamic path planning based on genetic algorithm,” Proceedings of the Annual Conference of China Institute of Communications, vol. 1864, issue 1, pp. 96-99, 2010.
J. Liu, X. Tian, W. Zhou, K. Guo, “An improved genetic algorithm for path-planning for mobile robot,” Proceedings of the 4th International Conference on Computer, Mechatronics, Control and Electronic Engineering (ICCMCEE 2015), 2015, pp. 998-1003, https://doi.org/10.2991/iccmcee-15.2015.186.
M. Honjwei, M. Longlong, “Robot path planning based on differential evolution in static environment,” International Journal of Digital Content Technology and its Applications (JDCTA), vol. 6, no. 20, pp. 122-129, 2012, https://doi.org/10.4156/jdcta.vol6.issue20.14.
How to Cite
LicenseInternational Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.