Week 7, Narrowing
Last Modified: 2009-02-18
find:

basket

Acroname Robotics  
 

Contents

The Plan

We have 4 remaining class periods, including this one to wrap up our network and get a demonstration working.  This week we isolate the remaining tasks and get tasks assigned so we can get our work finalized on time. 

Discussion

Last week there were 5 distinct assignments broken down as follows:

  • Library Improvement (kiki and kristy)
  • Packet Documentation (msloan1 and nugent)
  • Sniffer and Docs (nick^2)
  • Algorithm pseudo-code (sully and arion)
  • Test Findings (dan and jake)

We should be able to use the results of these efforts to conclude what we can and cannot expect from our network.  We need to break down the remaining portions of the project into milestones we can achieve in the remaining month we have to work with.  We will likely have an out-of-class session or two to do some of the more time constrained tasks. 

We have 4 more class periods in the class and will likely formally meet once or twice outside that. 

This week we should pick a time for additional meetings to refine our network with multiple nodes.  The integration of sensors and adding of the servos is very straightforward so we need to focus mostly on getting reliable messages back and forth. 

Lab

We need to get as much experience working on the network as possible this week.  To this end, we will try a multi-hop message similar to our test from last week.  This can be all in one room and we can also test it where we move down the hall outside the meeting room to extend our network and reduce overlaps. 

We have said that the boundary conditions are where either all nodes can see each other in one extreme or where all nodes can see at most the two neighbors in a chain at the other extreme.  It would be good to test both of these scenarios. 

Assignment

Based on our findings, we will re-organize the project work amongst teams to get the full node implementations done this week.  We will have 2 sets of teams working on parallel algorithms to see how they vary in the end.  The teams will need to work together to allow communication between the team nodes.  The odd team out may join one set or work on other tasks as determined in class today. 

Revision History:

  • 2009-02-18: Simple Updates
  • 2009-02-17: Initial Page
 

Related Links:

Main page for the University of Oregon Winter 2009 407/507 course

Resource Collection for the 407/507 Winter 2009 course

voice: 720-564-0373, email: sales@acroname.com, address: 4822 Sterling Dr., Boulder CO, 80301-2350, privacy
© Copyright 1994-2012 Acroname, Inc., Boulder, Colorado. All rights reserved.