A COMPARATIVE ANALYSIS OF INFORMED SEARCH AND UNINFORMED SEARCH ALGORITHMS IN THE EFFICIENCY OF AI PROBLEM MODELING
DOI:
https://doi.org/10.70248/jdaics.v3i3.4170Keywords:
Artificial Intelligence, Uninformed Search, Informed Search, Artificial Neural Network, Prediksi, Banjir, Curah Hujan, Kabupaten Karawang, Perubahan Iklim, Heuristic Function, Computational Efficiency, Problem ModelingAbstract
Search algorithms represent a core foundational component in intelligent system design for exploring state spaces to find optimal solutions. This article presents a theoretical comparative analysis between two primary search paradigms in Artificial Intelligence (AI): uninformed search (blind search) and informed search (heuristic search), with a specific focus on problem modeling computational efficiency. The scope of this study is focused on evaluating structural parameters and time-space complexity metrics across representative algorithms, including Breadth-First Search (BFS), Depth-First Search (DFS), Uniform-Cost Search (UCS), Greedy Best-First Search, and the A* algorithm. The qualitative comparative review demonstrates that while uninformed search offers model simplicity without requiring domain knowledge, it suffers from exponential complexity growth O(bd). Conversely, informed search leveraging admissible and consistent heuristic functions radically prunes search trees and optimizes resource consumption. The main scientific contribution of this study lies in a structured evaluation framework that maps the trade-offs between heuristic informativenes
References
B. Firmansyah, Dasar-Dasar Kecerdasan Buatan: Teori, Algoritma, dan Aplikasi, 1st ed. Jakarta: PT Bukuloka Literasi Bangsa, 2026.
S. R. and P. Norvig, Artificial Intelligence: A Modern Approach, 4th ed. Englewood Cliffs, NJ, USA: Prentice-Hall, 2020.
N. Purwandari and B. Firmansyah, “Sistem repository dokumen akreditasi program studi berbasis web pada Institut Bisnis dan Informatika Kosgoro 1957,” REMIK Ris. dan E-Jurnal Manaj. Inform. Komput., vol. 7, no. 1, pp. 196–210, 2023.
D. Arifin, M. S., Wahyuni, S., Rahmawati, “Analisis Performa Algoritma Pencarian Grafik pada Sistem Pengambilan Keputusan Berbasis Logika Komputasional,” J. Teknol. Inf. dan Ilmu Komput., vol. 9, no. 3, pp. 511–520, 2022.
B. Firmansyah, “Pengelolaan Arsip Digital Surat Masuk dan Keluar Menggunakan Teknik Document Scanning, Optical Character Recognition, dan Data Indexing,” J. Tek. Inform. dan Sist. Inf., vol. 9, no. 1, pp. 259–273, 2020.
R. Subekti, “Model of Data mining Clustering Rules on Population Determination of Trade and Accommodation Facilities in Indonesia with K-Means,” IJISTECH (International J. Inf. Syst. Technol., vol. 4, no. 1, pp. 482–488, 2020.
B. Sutikno, T., Handayani, W., Prasetyo, “Komparasi Efisiensi Teori Graf dan Struktur Traversal Pohon dalam Optimasi Algoritma Pencarian Sistem Cerdas,” Int. J. Artif. Intell. Appl. Sci., vol. 12, no. 4, pp. 310–322, 2021.
R. T. H. Filda Angellia, Nita Merlina, Agus Subekti, “Integrating vehicle dimension features for vision-based traffic density prediction using YOLOv5-LSTM architecture,” J. Soft Comput. Explor., vol. 7, no. 2, pp. 365–376, 2026.
R. Wibowo, A., Prasetyo, H., Utomo, “Analisis Performa Kompleksitas Algoritma Blind Search pada Optimasi Pemodelan Masalah Skala Masif,” J. Ris. Teknol. dan Ilmu Komput., vol. 14, no. 3, pp. 402–415, 2021.
A. Silvanie, “Pencarian Frequent Itemset dengan Algoritma Apriori dan Python. Studi kasus: Data Transaksi Penjualan Eceran Online di UK,” J. Nas. Inform., vol. 1, no. 2, pp. 82–94, 2020.
D. Setiawan, B., Utomo, R., Rahmawati, “Analisis Komparatif Notasi Asimtotik Big-O dan Pengukuran Efisiensi Algoritma Heuristik pada Ruang Pencarian Skala Masif,” J. Ris. Teknol. Komput. dan Ilmu Inf., vol. 12, no. 2, pp. 215–228, 2021.
L. Liu and B. Wang, “Research on Path-Planning Algorithm Integrating Optimization A-Star Algorithm and Artificial Potential Field Method,” Electronics, 2022.
