Performance Comparison of Depth Limited Search and A∗ Algorithm: A Case Study

Abstract

Search algorithms are an essential component of many artificial intelligence applications. Depth Limited Search and A∗ Search are two prominent search algorithms that have been widely used in various domains, including robotics, game playing, and natural language processing. The research paper presents an overview of these two algorithms, their architecture, pros and cons, and the areas of their application. A detailed comparison of these two algorithms in terms of their performance, efficiency, and effectiveness in solving various search problems is also analysed. Finally, the paper presents a case study for two approaches. Experimental results depicted that after repetitive execution of each algorithm and graph data, it was detected that while the A-star search was able to find the cheaper cost almost always, Depth Limited Search was able to find the route faster with limited node visits.