A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass

2010 ◽  
pp. 157-169 ◽  
Author(s):  
Swapnil Ghike ◽  
Krishnendu Mukhopadhyaya
Keyword(s):  
Pattern Formation ◽  
Distributed Algorithm ◽  
Autonomous Robots

On fast pattern formation by autonomous robots

2021 ◽  
pp. 104699
Author(s):  
Ramachandran Vaidyanathan ◽  
Gokarna Sharma ◽  
Jerry Trahan
Keyword(s):  
Pattern Formation ◽  
Autonomous Robots

On Fast Pattern Formation by Autonomous Robots

2018 ◽  
pp. 203-220 ◽  
Author(s):  
Ramachandran Vaidyanathan ◽  
Gokarna Sharma ◽  
Jerry L. Trahan
Keyword(s):  
Pattern Formation ◽  
Autonomous Robots

scholarly journals k-Circle Formation and k-epf by Asynchronous Robots

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 62
Author(s):  
Subhash Bhagat ◽  
Bibhuti Das ◽  
Abhinav Chakraborty ◽  
Krishnendu Mukhopadhyaya
Keyword(s):  
Fixed Point ◽  
Pattern Formation ◽  
Positive Integer ◽  
Fixed Points ◽  
Distributed Algorithm ◽  
Euclidean Plane ◽  
Formation Problem ◽  
The Common ◽  
Circle Formation

For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots are identical, anonymous, oblivious, and they operate in Look–Compute–Move cycles. This paper studies the k-circle formation problem and its relationship with the k-epf problem, a generalized version of the embedded pattern formation problem, which asks exactly k robots to reach and remain at each fixed point. First, the k-circle formation problem is studied in a setting where the robots have an agreement on the common direction and orientation of one of the axes. We have characterized all the configurations and the values of k, for which the k-circle formation problem is deterministically unsolvable in this setting. For the remaining configurations and the values of k, a deterministic distributed algorithm has been proposed, in order to solve the problem. It has been proved that for the initial configurations with distinct robot positions, if the k-circle formation problem is deterministically solvable then the k-epf problem is also deterministically solvable. It has been shown that by modifying the proposed algorithm, the k-epf problem can be solved deterministically.

Pattern formation in the splay Freedericks transition of a nematic side-group polysiloxane

1993 ◽  
Vol 3 (6) ◽  
pp. 865-889 ◽  
Author(s):  
Norbert Schwenk ◽  
Hans Wolfgang Spiess
Keyword(s):  
Pattern Formation ◽  
Side Group

Pattern Formation in Thin Polymer Films: A New Morphology

2000 ◽  
Vol 629 ◽  
Author(s):  
Jean-Loup Masson ◽  
Peter F. Green
Keyword(s):  
Growth Rate ◽  
Pattern Formation ◽  
Early Stage ◽  
Structural Evolution ◽  
Distinct Form ◽  
Thin Polymer Films ◽  
Intermediate Morphology ◽  
Thin Polymer ◽  
Nonwetting Liquid ◽  
Cylindrical Holes

ABSTRACTResearchers have shown that thin, nonwetting, liquid homopolymer films dewet substrates, forming patterns that reflect fluctuations in the local film thickness. These patterns have been shown to be either discrete cylindrical holes or bicontinuous “spinodal-like” patterns. In this paper we show the existence of a new morphology. During the early stage of dewetting, discrete highly asymmetric holes appear spontaneously throughout the film. The nucleation rate of these holes is faster than their growth rate. The morphology of the late stage of evolution, after 18 days, is characterized by a bicontinuous pattern, distinct form conventional spinodal dewetting patterns. This morphology has been observed for a range of film thicknesses between 7.5 and 21nm. The structural evolution of this intermediate morphology is discussed.

Sign in / Sign up

Export Citation Format

Share Document