Development of a faster shortest path search algorithm based on A* strategy integrated in an e-learning virtual environment
Abstract
Abstract – The paper presents an optimal search algorithm based on A* strategy for the shortest path problem solving and its integration into LearningONE, an e-learning virtual environment that was developed in a first stage for teaching some courses in the Computer Science domain, the Artificial Intelligence course and the Object Oriented Programming course. The main objective of the research work was to improve the running time of the A* informed search strategy for finding the shortest path between two locations in a certain environment. The experimental results obtained for the application of virtual mobile robots navigation in a maze that was integrated in LearningONE, showed that the optimized A* algorithm performed faster than the A* algorithm.
Full Text:
PDFReferences
S. Russell and P. Norvig, Artificial intelligence – a modern approach, Prentice Hall, 3rd edition, 2010.
J. Pearl, Heuristics: Intelligent search strategies for computer problem solving, Addison-Wesley, Reading, 1984.
E. W. Dijkstra, “A note on two problems in connexion with graphsâ€, Numerische Mathematik, vol. 1, pp. 269-271, 1959.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost pathsâ€, IEEE Transactions on Systems Science and Cybernetics, vol. 4, pp. 100-107, 1968.
P. E. Hart, N. J. Nilsson, and B. Raphael, Correction to “A formal basis for the heuristic determination of minimum cost pathsâ€, SIGART Newsletter, vol. 37, pp. 28-29, 1972.
S. T. Groza, “Design and implementation of an e-learning system integrated in a virtual worldâ€, BSc diploma project, Petroleum-Gas University of Ploiesti, 2018.
R. Dechter and J. Pearl, “Generalized best-first search strategies and the optimality of A*â€, Journal of the ACM, vol. 32, pp. 505-536, 1985.
H. Ma, S. Koenig, N. Ayanian, L. Cohen, W. Hönig, T. K. Satish Kumar, T. Uras, and H. Xu, “Overview: Generalizations of multi-agent path finding to real-world scenariosâ€, Proceedings of IJCAI Workshop Multi-Agent Path Finding, 2016.
D. Delling, P. Sanders, D. Schultes, and D. Wagner, “Engineering route planning algorithmsâ€, Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, Springer, 2009.
B. Holmes, J. Gardner, and M. Gamble, “e-Learning: Concepts and practiceâ€, Journal of Pedagogic Development, 2006.
J. Bersin, The blended learning book, San Francisco, John Wiley, 2004.
A. AdăscăliÈ›ei, C. CucoÈ™, I. Rusu, I. Nica, “Developing blended learning university environments using Moodle – case studyâ€, Proceeding of International Conference on Virtual Learning - ICVL 2014, pp. 258 – 266.
Refbacks
- There are currently no refbacks.
Copyright (c) 2019 Journal of Electrical Engineering, Electronics, Control and Computer Science
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.