Optimum Route Finding based on Belief-Desire-Intention model of Intelligent Agents

Route finding is exercised directly or indirectly in many scientific studies. This issue is addressed based on different perspectives, various methods, and in numerous applications. Route finding is considered as an optimization problem for which Dijkstra algorithm is used most frequently. Various techniques have been developed to enhance the performance of the algorithm. Recently, the use of belief-desire-intention architecture of agent-based model has been burgeoning in spatial sciences. Such a model is based on intentional systems, which the behavior of the entities can be described based on as desire, want, hope, belief information. Despite the versatility of this model, its concepts are burgeoning and as such it needs further analyses and investigation. In this paper, a novel model is introduced for solving route finding based on belief-desire-intention architecture of agent-base model. Based on this architecture, a novel algorithm is introduced to solve the optimum path between start and end nodes. The proposed algorithm will be able to provide the optimum solution for a problem in a vector network. At the end of this article, a sample of rout finding is discussed to show the efficiency of our proposed model. The evaluation results showed how the chosen path depends on the behavior of the agents. If suitable behaviors are selected for agents, acceptable results will be reached.