Skip to main content

Compression in Self-Organizing Particle Systems

Abstract Many programmable matter systems have been proposed and realized recently, each often tailored toward a particular task or physical setting. In our work on self-organizing particle systems, we abstract away from specific settings and instead describe programmable matter as a collection of simple computational elements (to be referred to as particles) with limited computational power that each perform fully distributed, local, asynchronous algorithms to solve system-wide problems of movement, configuration, and coordination. In this thesis, we focus on the compression problem, in which the particle system gathers as tightly together as possible, as in a sphere or its equivalent in the presence of some underlying geometry. While there are man... (more)
Created Date 2016-05
Contributor Daymude, Joshua Jungwoo (Author) / Richa, Andrea (Thesis Director) / Kierstead, Henry (Committee Member) / Computer Science and Engineering Program / School of Mathematical and Statistical Sciences / Barrett, The Honors College
Subject Mathematics / Programmable Matter / Algorithms / Theory / Computer Science
Series Academic Year 2015-2016
Type Text
Extent 37 pages
Language English
Reuse Permissions All Rights Reserved
Collaborating Institutions Barrett, the Honors College
Additional Formats MODS / OAI Dublin Core / RIS

524.8 KB application/pdf
  • Download restricted to ASU - Sign In
Download Count: 25