Description
Title: ASYNCHRONOUS OPAQUE ROBOTS FORMING A CIRCLE ON AN INFINITE GRID
Abstract: This study presents a distributed algorithm for the Circle Formation problem using asynchronous mobile opaque robots operating in an infinite grid environment. The robots must first take up distinct positions and then form a circle over the grid. The robots do not share a common global coordinate system; their movements are only constrained along the grid lines. An asynchronous adversarial scheduler that uses Look-Compute-Move cycles to control the robots. The robots can’t be told apart by nature, and they don’t remember their previous configurations or behaviors. We consider the issue in the context of a luminous model, in which robots only use lights to communicate with one another and no other external systems. Our method uses seven different colors to resolve the Circle Formation issue. Our algorithm’s subroutine also resolves the Line Formation issue with three distinct colors.
Keywords: distributed computing, autonomous robots, circle formation, line formation, robots with lights, asynchronous, Look-Compute-Move cycle, grid
Paper Quality: SCOPUS / Web of Science Level Research Paper
Paper type: Analysis Based Research Paper
Subject: Computer Science
Writer Experience: 20+ Years
Plagiarism Report: Turnitin Plagiarism Report will be less than 10%
Restriction: Only one author may purchase a single paper. The paper will then indicate that it is out of stock.
What will I get after the purchase?
A turnitin plagiarism report of less than 10% in a pdf file and a full research paper in a word document.
In case you have any questions related to this research paper, please feel free to call/ WhatsApp on +919726999915
Reviews
There are no reviews yet.