“Nearest Zero-point” Algorithm for Cooperative Robotic Search Missions

Vahid Aryai, Mahsa Kharazi, Farid Ariai

Abstract


Four path planning and data exchange algorithms for cooperative search and coverage robotic missions are proposed and modified. The introduced methods are simulated using C++ programming environment and the results are discussed in detail for environments with static obstacles. It has been shown that using the “nearest zero-point” algorithm can greatly optimize the mission duration and also overlapping of the search trajectories. Finally, the results are compared with several existing algorithms.


Keywords


Artificial intelligence; Cooperative search; Grid-based algorithm; Optimization; Robotic search

Full Text:

PDF


DOI: http://doi.org/10.11591/ijra.v6i1.pp49-58

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

IJRA Visitor Statistics