Two agents with GBFS algorithms working cooperatively to get a shortest path


Authors

DOI:

https://doi.org/10.22517/23447214.24341

Keywords:

Autonomous robots, navigation, particle tracking, path planning, teamwork.

Abstract

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.

Downloads

Download data is not yet available.

Author Biographies

José Andrés Chaves Osorio, Universidad Tecnológica de Pereira

Departamento de Física, Docente e Investigador.

Juan Bernardo Gómez Mendoza, Universidad Nacional de Colombia

Facultad de Ingeniería y Arquitectura-Docente

Edward Andrés González Rios, SENA

Tecnoacademia Manizales, centro de automatización industrial – Sena, Instructor

Downloads

    Vistas(Views): 361
  • PDF Descargas(Downloads): 301

Published

2020-09-30

How to Cite

Chaves Osorio, J. A., Gómez Mendoza, J. B., & González Rios, E. A. (2020). Two agents with GBFS algorithms working cooperatively to get a shortest path. Scientia Et Technica, 25(3), 448–454. https://doi.org/10.22517/23447214.24341

Issue

Vol. 25 No. 3 (2020)

Section

Sistemas y Computación

License

The undersigned authors declare that the article submitted to the journal Scientia et Technica is an original work and that all its content is free of third-party copyright restrictions or has the corresponding authorizations. Consequently, the authors assume responsibility for any litigation or claim related to intellectual property rights, releasing the Technological University of Pereira and the journal Scientia et Technica from any liability.

If the submitted work is accepted for publication, the authors retain copyright to the article and grant the journal Scientia et Technica the right of first publication, as well as a non-exclusive, perpetual license to reproduce, edit, distribute, display, and publicly communicate the article in any medium or format, including print, electronic, databases, repositories, the Internet, or other scientific dissemination systems. The authors agree that the article will be published in open access and distributed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0).

The journal Scientia will respect in all cases the moral rights of the authors, in accordance with the provisions of article 30 of Law 23 of 1982 of the Republic of Colombia, recognizing the authorship of the work, the right to integrity and the right of disclosure, which are inalienable and non-waivable.