Path Finder : An Artificial Intelligence Based Shortest Path
Anupam Singh1, Vivek Lokchand Shahare2, Nitin Arora3, Ahatsham4
1Anupam Singh*, Department of Informatics, School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India.
2Vivek Lokchand Shahare, Department of Informatics, School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India.
3Nitin Arora, Department of Informatics, School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India.
4Ahatsham, Department of Informatics, School of Computer Science, University of Petroleum and Energy Studies, Dehradun, India.
Manuscript received on November 12, 2019. | Revised Manuscript received on November 25, 2019. | Manuscript published on 30 November, 2019. | PP: 5177-5181 | Volume-8 Issue-4, November 2019. | Retrieval Number: D7380118419/2019©BEIESP | DOI: 10.35940/ijrte.D7380.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Artificial Intelligence driven assistant system is a supporting system that is used to find path within limited defined area as well as it can be used for the automation purpose. The path finder feature helps to find the path between two places within limited defined area. This approach is very useful for the people who are new to the organization, as they do not know the path inside the organization. There exist a lot of artificial intelligence assistants that help people to solve their problem. So, here is the implemented system that solves the path related problems within the organization and also helps to automate the system.
Keywords: Artificial Intelligence, Dijkstra’s Algorithm, Shortest Path, Connected Graph.
Scope of the Article: Artificial Intelligence and Machine Learning.