A Hybrid Routing Approach Using Two Searching Layers-Reference-Cited by-同舟云学术

A Hybrid Routing Approach Using Two Searching Layers

Published:2021-06-01 Issue:1 Volume:17 Page:59-66
ISSN:2255-9159
Container-title:Electrical, Control and Communication Engineering
language:en
Short-container-title:

Author:

Koca Gonca Ozmen¹^ORCID,Yetkin Seda²^ORCID

Affiliation:

1. Associate Professor, Mechatronics Engineering Department, Technology Faculty , Firat University , Elazığ , Turkey

2. Lecturer, Vocational School of Technical Sciences, Electronics and Automation Department , Bitlis Eren University , Bitlis , Turkey

Abstract

Abstract This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to SUB_TABLE to expedite the final searching in the hybrid approach. Map to work on is divided to subregions with decision-making process by using line-of-sight to avoid redundant searching. In the final searching layer, all feasible SUB_GOALs gained from decision-making process in the same subregion are connected to find final solutions of routes. Solutions achieved in the divided subregions are evaluated and combined to discover the final optimal route. The proposed hybrid approach is applied to three different scenarios in various dimensions of maps. In these three scenarios, the shortest route without hitting obstacles is calculated as 46.67, 57.76 and 124.7 units, respectively, and compared with other search algorithms. Simulation results of route planning are demonstrated to exhibit the effectiveness of the proposed hybrid approach.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ecce-2021-0007

Reference21 articles.

1. [1] Y. Fernando, M. A. Mustaqov and A. D. Megawaty, “Penerapan Algoritma A-Star Pada Aplikasi Pencarian Lokasi Fotografi Di Bandar Lampung Berbasis Android,” Jurnnal Teknoinfo, vol. 14, no. 1, 2020, pp. 27–34. https://doi.org/10.33365/jti.v14i1.509.

2. [2] H. Yusnita, “Kinerja Dynamic Programming, Algoritma A Star dan Dijkstra Dalam Menentukan Rute Terpendek,” Universitas Sumatera Utara, Master thesis, 2020. http://repositori.usu.ac.id/handle/123456789/28221

3. [3] R. F. Oktanugraha and S. R. Nudin, “Implementasi Algoritma A* (A Star) Dalam Penentuan Rute Terpendek Yang Dapat Dilalui Non Player Character Pada Game Good Thief,” Journal of Informatics and Computer Science, vol. 2, no. 1, 2020, pp. 74–85.

4. [4] A. R. Soltani, H. Tawfik, J. Y. Goulermas and T. Fernando, “Path planning in construction sites: performance evaluation of the Dijkstra, A* and GA search algorithms,” Adv. Engineering Informatics, vol. 16, no. 4, pp. 291–303, 2002. https://doi.org/10.1016/S1474-0346(03)00018-1.

5. [5] N. Delanoue, L. Jaulin and B. Cottenceau, “Counting the Number of Connected Components of a Set and its Application to Robotics,” in J. Dongarra, K. Madsen, J. Waśniewski (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol. 3732, pp. 93–101, 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_11.