Week 13


Automate your machine
Document the group project and your individual contribution

Dijkstra's algorithm: concieved in 1956, is an algorithm for finding the shortest path between two nodes – a common variation includes starting with one node and mapping distances to all of the other nodes, then selecting the pair od nodes with the smallest value
electrochromism: reversibly changing colour by using bursts of change on susceptible materials

Final Project Update

With the support of my classmate Logan I made substantial progress in encoding my microphone board with a beat detection algorithm using Damian Peckett's method. In order to successfully implement the code, I had to swap out the ATtiny45 with a ATtiny85 chip as the Arduino IDE sketch was consuming in excess of 90% of the t45. The other configuration issues included running the Burn Bootloader command, and sanity checks for misplaced resistors (subpar soldering in the chip replacement process).
The other breakthrough for the week was a successful design of my electronics schema. Instead of trying to house everything under a single roof (i.e. one board), or sending all the samples to either the output or an intermediately device, I ran the beat detection algorithm on my speaker board – sending serial communication only when a beat is perceived. The result was exactly what I was looking for; it also felt great to espouse Neil’s advice of “keeping things modular.”

Dream Machine

Unfortunately, due to finals I had to miss the recitation and the corresponding group project. However, I took this as a cue for a creative self-directed endeavor. I started with a question. What is my dream machine? As a big fan of soft robotics, my dream machine is a wobbing hug bot that produces sounds at a comforting frequency and on occassion does dirty dishes. Complete with piezoelectric sensors the hug machine would be activated at moments of emotional lows.