Brief Announcement

Cannon, Sarah; Daymude, Joshua J.; Gokmen, Cem; Randall, Dana; Richa, Andréa W.

doi:10.1145/3212734.3212792

Cited by 3 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[ 54 ] Advanced collective tasks such as separation and peer recruitment, however, are not yet demonstrated in micrometer‐scale systems, as they require coordinated execution of sensing, data processing, memory updating, and actuation steps on‐board. [ 55–57 ]…”

Section: Introductionmentioning

confidence: 99%

Memristor Circuits for Colloidal Robotics: Temporal Access to Memory, Sensing, and Actuation

Yang

Liu

Berrueta

et al. 2021

Advanced Intelligent Systems

View full text Add to dashboard Cite

Micrometer‐scale robots capable of navigating enclosed spaces and remote locations are approaching reality. However, true autonomy remains an open challenge despite substantial progress made with externally supervised and manipulated systems. To accelerate the development of autonomous microrobots, alternatives to conventional top‐down lithography are sought. Such additive technologies like printing, coating, and colloidal self‐assembly allow for rapid prototyping and access to novel materials, such as polymers, bio‐ and nanomaterials. On the basis of recent experimental findings that memristive networks can be rapidly printed and lifted off as electronic microparticles, an alternative design paradigm is introduced based on arrays of two‐terminal memristive elements, which enables real‐time use of memory, sensing, and actuation in microrobots. Several memristor‐based designs are validated, each representing a key building block toward robotic autonomy: tracking elapsed time, timestamping a rare event, continuously cataloguing time‐indexed data, and accessing the collected information for a feedback‐controlled response as in a robotic glucose‐responsive insulin. The computational results establish an actionable framework for microrobotic design—tasks normally requiring complex circuits can now be achieved with self‐assembled and printed memristor arrays within microparticles.

show abstract

Section: Introductionmentioning

confidence: 99%

Memristor Circuits for Colloidal Robotics: Temporal Access to Memory, Sensing, and Actuation

Yang

Liu

Berrueta

et al. 2021

Advanced Intelligent Systems

View full text Add to dashboard Cite

show abstract

Computing by Programmable Particles

Daymude

Hinnenthal

Richa

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Efficient Deterministic Leader Election for Programmable Matter

Dufoulon

Kutten

Moses

2021

Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

It was suggested that a programmable matter system (composed of multiple computationally weak mobile particles) should remain connected at all times since otherwise, reconnection is difficult and may be impossible. At the same time, it was not clear that allowing the system to disconnect carried a significant advantage in terms of time complexity. We demonstrate for a fundamental task, that of leader election, an algorithm where the system disconnects and then reconnects automatically in a non-trivial way (particles can move far away from their former neighbors and later reconnect to others). Moreover, the runtime of the temporarily disconnecting deterministic leader election algorithm is linear in the diameter. Hence, the disconnecting -reconnecting algorithm is as fast as previous randomized algorithms. When comparing to previous deterministic algorithms, we note that some of the previous work assumed weaker schedulers. Still, the runtime of all the previous deterministic algorithms that did not assume special shapes of the particle system (shapes with no holes) was at least quadratic in , where is the number of particles in the system. (Moreover, the new algorithm is even faster in some parameters than the deterministic algorithms that did assume special initial shapes.)Since leader election is an important module in algorithms for various other tasks, the presented algorithm can be useful for speeding up other algorithms under the assumption of a strong scheduler. This leaves open the question: "can a deterministic algorithm be as fast as the randomized ones also under weaker schedulers?" CCS CONCEPTS• Theory of computation → Self-organization; Distributed algorithms; • Computing methodologies → Mobile agents.

show abstract

Brief Announcement

Cited by 3 publications

References 10 publications

Memristor Circuits for Colloidal Robotics: Temporal Access to Memory, Sensing, and Actuation

Memristor Circuits for Colloidal Robotics: Temporal Access to Memory, Sensing, and Actuation

Computing by Programmable Particles

Efficient Deterministic Leader Election for Programmable Matter

Contact Info

Product

Resources

About