Open AccessTwo agents with GBFS algorithms working cooperatively to get a shortest path
Author(s) -
José Andrés Chaves Osorio,
Juan-Bernardo Gómez-Mendoza,
Edward Andrés González Rios
Publication year - 2020
Publication title -
scientia et technica
Language(s) - English
Resource type - Journals
eISSN - 2344-7214
pISSN - 0122-1701
DOI - 10.22517/23447214.24341
Subject(s) - shortest path problem , planner , path (computing) , motion planning , computer science , mathematical optimization , yen's algorithm , algorithm , work (physics) , order (exchange) , mathematics , dijkstra's algorithm , theoretical computer science , artificial intelligence , engineering , robot , computer network , graph , mechanical engineering , finance , economics
This study is carried out in order to verify if the implementation of the concept of cooperative work among two agents, that use path planners A* to obtain the shortest path (previous work of the authors) is also valid when the cooperative strategy is applied using another path planner such as the so-called GBFS (Greedy Best First Search). In this sense, this paper shows a path planning strategy that combines the capabilities of two Agents each one with its own path planner GBFS (slightly different from each other) in order to obtain the shortest path. The comparisons between paths are made by analyzing the behavior and results obtained from the agents operating in different forms: (1) Working individually; (2) Working as a team (cooperating and exchanging information). The results show that in all analyzed situations are obtained shortest traveled distances when the path planners work as a cooperative team.