Hexagon-based Q-learning for object search with multiple robots

Abstract

This paper presents the hexagon-based Q-leaning for object search with multiple robots. We set up an experimental environment with five small mobile robots, obstacles, and a target object. The robots were out to search for a target object while navigating in a hallway where some obstacles were placed. In this experiment, we used three control algorithms: a random search, an area-based action making (ABAM) process to determine the next action of the robots, and hexagon-based Q-learning to enhance the area-based action making process.