ARTÍCULO
TITULO

Optimized Graph Search Algorithms for Exploration with Mobile Robot

Aydin GULLU    
Hilmi KUSÇU    

Resumen

Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path. In this study, a mobile robot explored an unknown environment using separate depth-first search (DFS)  and breadth-first search (BFS) algorithms. Afterward, developed DFS + Dijkstra and BFS + Dijkstra algorithms were run for the same environment. It was observed that the newly developed hybrid algorithm performed the identification using less distance. In experimental studies with real robots, progression with DFS for the first-time discovery of an unknown environment is very efficient for detecting boundaries. After finding the last point with DFS, the shortest route was found with Dijkstra for the robot to reach the previous node. In defining a robot that works in a real environment using DFS algorithm for movement in unknown environments and Dijkstra algorithm in returning, time and path are shortened. The same situation was tested with BFS and the results were examined. However, DFS + Dijkstra was found to be the best algorithm in field scanning with real robots. With the hybrid algorithm developed, it is possible to scan the area with real autonomous robots in a shorter time. In this study, field scanning was optimized using hybrid algorithms known.

 Artículos similares

       
 
Weiguang Zheng, Quanfu Geng, Xiaohong Xu and Zhixiang Liu    
The permanent-magnet synchronous motor (PMSM), with the advantages of low energy consumption and stable operation, is considered a green power source to replace gasoline engines. Motor control is the core problem of the electric-drive system, so it is im... ver más
Revista: Applied Sciences

 
Rui-Yu Li, Yu Guo and Bin Zhang    
Nonnegative matrix factorization (NMF) is an efficient method for feature learning in the field of machine learning and data mining. To investigate the nonlinear characteristics of datasets, kernel-method-based NMF (KNMF) and its graph-regularized extens... ver más
Revista: Information

 
Kyung-Hoon Jang, Sang-Won Seo and Dong-Jin Kim    
In this paper, we present the optimized air space of the lightning protection rod (SK-AOR380) with the function of a charge transfer system (CTS). For evaluation of CTS in the laboratory setting, some studies have focused on the modification of the struc... ver más

 
Maximilian Hoffmann and Ralph Bergmann    
Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consumi... ver más
Revista: Algorithms

 
Mohammad Daradkeh    
The heterogeneity and diversity of users and external knowledge resources is a hallmark of open innovation communities (OICs). Although user segmentation in heterogeneous OICs is a prominent and recurring issue, it has received limited attention in open ... ver más