Changes between Version 30 and Version 31 of Old/Dailyupdates


Ignore:
Timestamp:
Jun 20, 2007, 9:53:25 PM (17 years ago)
Author:
aniket
Comment:

—

Legend:

Unmodified
Added
Removed
Modified

  • Old/Dailyupdates

    v30 v31  
    4848}}}
    4949
    50 We've been issued a challenge. A week from today there is to be a race. One of the nodes in Orbit will become an access point, and each robot will attempt a time-trial to locate the node as quickly as possible. Robot #1 will probably use the Nelder-Mead script completed today, but we have flexibility regarding the algorithm for the other two.
     50We've been issued a challenge. A week from today there is to be a race. One of the nodes in Orbit will become an access point, and each robot will attempt a time-trial to locate the node as quickly as possible. Robot !#1 will probably use the Nelder-Mead script completed today, but we have flexibility regarding the algorithm for the other two.
    5151
    52 Another short term goal: have object-avoidance behavior run in the background while we are running our own python scripts. In general, the python MoveTo commands have timeout values, so if the robot is trying to reach an unreachable location (ie, inside a pillar) it should give up after n seconds. This will affect our scanning algorithms.
     52Another short term goal: have object-avoidance behavior run in the background while we are running our own python scripts. In general, the python !MoveTo commands have timeout values, so if the robot is trying to reach an unreachable location (ie, inside a pillar) it should give up after n seconds. This will affect our scanning algorithms.