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

This article compares path-planning and data-exchange algorithms for cooperative robotic search and coverage. The methods are simulated in C++ in environments with static obstacles, examining mission duration and overlap between search trajectories.

Publisher record.

Aryai, V., Kharazi, M., & Ariai, F. (2017). “Nearest Zero-point” Algorithm for Cooperative Robotic Search Missions. IAES International Journal of Robotics & Automation, 6(1), 49–58. doi:10.11591/ijra.v6i1.pp49-58