RoboBlockly for Learning Coding and Math with Robots

0x2418126-6-12y2418126-6-12
Grid:
Tics Lines:
Width px
Hash Lines:
Width px
Labels:
Font px
Trace Lines:
Robot 1:
Width px
Robot 2:
Width px
Robot 3:
Width px
Robot 4:
Width px
Axes: x-axis y-axis Show Grid
Grid: 24x24 inches 36x36 inches 72x72 inches
96x96 inches 192x192 inches
Quad: 4 quadrants 1 quadrant
Units: US Customary Metric
Background:

Robot 1

Initial Position:
( in, in)
Initial Angle:
deg
Current Position: (0 in, 0 in)
Current Angle: 90 deg
Wheel Radius:
Track Width:
in

Robot 2

Initial Position:
( in, in)
Initial Angle:
deg
Current Position: (6 in, 0 in)
Current Angle: 90 deg
Wheel Radius:
Track Width:
in

Robot 3

Initial Position:
( in, in)
Initial Angle:
deg
Current Position: (12 in, 0 in)
Current Angle: 90 deg
Wheel Radius:
Track Width:
in

Robot 4

Initial Position:
( in, in)
Initial Angle:
deg
Current Position: (18 in, 0 in)
Current Angle: 90 deg
Wheel Radius:
Track Width:
in

Problem Statement:
The robot has been hired to walk the neighborhood dogs. Using the turnLeft()/turnRight() blocks show the path of the daily walk the robot makes on his dog walking route. The robot is not allowed to walk diagonally. Start the robot at the (0, 0). The first dog lives at (3, 4). Then the robot continues forward 5 units and turns left and goes another 6 units to pick up the next dog. The last dog is 7 units to the right. The route ends at the dog park which is at (-5, -2).
/* Code generated by RoboBlockly v2.0 */
#include <linkbot.h>
CLinkbotI robot;
double radius = 1.75;
double trackwidth = 3.69;

robot.driveDistance(4, radius);
robot.turnRight(90, radius, trackwidth);
robot.driveDistance(3, radius);
robot.driveDistance(5, radius);
robot.turnLeft(90, radius, trackwidth);
robot.driveDistance(6, radius);
robot.turnRight(90, radius, trackwidth);
robot.driveDistance(7, radius);
robot.turnRight(90, radius, trackwidth);
robot.driveDistance(12, radius);
robot.turnRight(90, radius, trackwidth);
robot.driveDistance(21, radius);
Blocks Save Blocks Load Blocks Show Ch Save Ch Workspace

		
Time
Problem Statement:
The robot has been hired to walk the neighborhood dogs. Using the turnLeft()/turnRight() blocks show the path of the daily walk the robot makes on his dog walking route. The robot is not allowed to walk diagonally. Start the robot at the (0, 0). The first dog lives at (3, 4). Then the robot continues forward 5 units and turns left and goes another 6 units to pick up the next dog. The last dog is 7 units to the right. The route ends at the dog park which is at (-5, -2).