Show simple item record

dc.contributor.authorGokmen, Cem
dc.date.accessioned2019-02-12T14:43:02Z
dc.date.available2019-02-12T14:43:02Z
dc.date.created2018-12
dc.date.issued2018-12
dc.date.submittedDecember 2018
dc.identifier.urihttp://hdl.handle.net/1853/60893
dc.description.abstractWe investigate Markov chain algorithms that can accomplish global emergent phenomena in a distributed setting, namely in self-organizing particle systems, an abstraction of programmable matter. These particle systems are composed of individual computational units known as particles that each have limited memory, strictly local communication abilities, and modest computational power, and which collectively solve system-wide problems of movement and coordination. We introduce fully distributed, asynchronous, stochastic algorithms for two problems: separation and alignment, both of which we formally define. We then rigorously analyze the correctness and convergence of our distributed, stochastic algorithms by leveraging techniques from Markov chain analysis. Our theoretical results are complemented by simulations.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectMarkov chain
dc.subjectRandomized algorithms
dc.subjectDynamic distributed computing
dc.subjectSelf-organizing particle systems
dc.subjectProgrammable matter
dc.subjectSeparation
dc.subjectFlocking
dc.subjectAlignment
dc.titleMarkov Chain Algorithms for Emergent Phenomena in Self-Organizing Particle Systems
dc.typeText
dc.description.degreeUndergraduate
dc.contributor.departmentComputer Science
thesis.degree.levelUndergraduate
dc.contributor.committeeMemberRandall, Dana
dc.contributor.committeeMemberPeng, Richard
dc.type.genreUndergraduate Thesis
dc.date.updated2019-02-12T14:43:02Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record