Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots
share
Programmable matter consists of many self-organizing computational entities which are autonomous and cooperative with one another to achieve a goal and it has been widely studied in various fields, e.g., robotics or mobile agents, theoretically and practically. In the field of computer science, programmable matter can be theoretically modeled as a distributed system consisting of simple and small robots equipped with limited capabilities, e.g., no memory and/or no geometrical coordination. A lot of theoretical research is studied based on such theoretical models, to clarify the relation between the solvability of various problems and the considered models. We newly propose a computational model named Pairbot model where two autonomous mobile robots operate as a pair on a grid plane. In Pairbot model, every robot has the one robot as its unique partner, called buddy, each other. We call the paired two robots pairbot. Two robots in one pairbot can recognize each other, and repeatedly change their geometrical relationships, long and short, to achieve the goal. In this paper, as a first step to show the feasibility and effectiveness of the proposed Pairbot model, we introduce two simple problems, the marching problem and the object coating problem, and propose two algorithms to solve these two problems, respectively. In both algorithms, it is assumed that the visibility range is one (every robot can observe only its neighboring robots) and the scheduler is asynchronous (ASYNC).
READ FULL TEXT
