Robot Mind Map

Robot Mind Map

1. Prescribed Criteria 1

   • Follow the path using a line following algorithm
     • Can the robot follow the line
     • Can the robot see less light reflected on white than on black
     • Can the robot move around the line when finding the obstacle
     • Can the robot find the line

2. Self-Determined Criteria

   • Can the robot display “OBSTACLE OBSTACLE” once it detected the obstacle
   • Can the robot display OBSTACLE PASSED once it went around the obstalce
   • Can the robot display “COURSE FINISHED” once it finished the maze
   • Can the spike prime display “COURSE FINISHED” once it finished the maze
   • Can the robot make a victory display when it finished the course
   • Can the robot display “FOLLOWING LINE” once it is on the line

3. Coding Constructs

   • Variables
     • Variables are assigned using the “=“ operator
       • Variables are used for assigning values that can change
   • IF
     • control the flow of an algorithm and to specify which actions should be taken depending on certain conditions
       • It is used to make decisions based on conditions
   • IF ELSE
     • run either one piece of code if the Boolean expression evaluates to true , or another piece of code if it evaluates to false
       • Used to run conditions when different requirements are met or not met
   • FOR loop
     • a control flow statement for specifying iteration
       • For loops are used when you know how many times you want to repeat a certain block of code
   • WHILE loop
     • used to repeat a specific block of code an unknown number of times, until a condition is met.
       • While loops when we do not know how many times we will run through the code
   • Arrays
     • An array is a contiguous space in memory to store values
       • to store multiple pieces of data of the same type together

4. Algorithm Constructs

   • Modularisation
     • The process of dividing a problem into separate tasks/modules/functions
   • Sequence
     • An algorithm is a step-by-step process, and the order of those steps are crucial to ensuring the correctness of an algorithm.
   • Iteration
     • Algorithms often use repetition to execute steps a certain number of times or until a certain condition is met.
   • Assignment
     • a statement that is used to set a value to the variable name in a program
   • Condition
     • The "condition" in the if statement is a Boolean expression that evaluates to either true or false.
   • Selection
     • Algorithms can use selection to determine a different set of steps to execute based on a Boolean expression.

5. Planned response 1

   • Start robot from point 1
   • Robot will drive until the line is detected
   • Robot will follow the black line
   • Robot will detect obstacle using ultrasonic sensor
   • Robot will drive around the obstacle
   • Robot will keep following the line
   • Robot will stop at point 2

6. Prescribed Criteria 2

   • Detect and navigate around/move the obstacle using appropriate sensor/s on the spike prime
     • Can the ultrasonic sensor detect the obstacle
     • Can the spike prime move outside of the line to move around the obstacle
     • Can the robot reacquire the line after it has moved around the obstacle
     • Can the robot realline it angle to the line
     • Can the robot continue following the line

7. Planned response 2

   • Start robot from point 1
   • Robot will drive until the line is detected
   • Robot will follow the black line
   • Robot will detect the obstacle using ultrasonic sensor
   • Robot will drive around the obstacle
   • Robot will keep following the line
   • Robot will stop at point 2