DescriptionA self-organizing particle system (SOPS) is a collection of programmable units called particles with fixed computational capabilities. Within a particle system, individual particles execute fully distributed, local, asynchronous algorithms to achieve collective movement, configuration and co-ordination.
Leveraging recent developments in stochastic algorithm design for such systems, we propose a Markov chain based algorithm for collective maze-solving under the geometric amoebot model of SOPS for certain types of mazes. The inspiration for our algorithm comes from the algorithm for phototaxing, which uses external stimuli to create asymmetries in particle activity levels, thereby causing displacement of the particle system away from the stimuli.
Phototaxing has been proven for systems of two and three particles. We give an algorithm to verify phototaxing in arbitrarily large systems given the set of possible configurations are known. Using this algorithm, we verify that phototaxing also occurs in particle systems of size four.
systems of size four.