Starting from:

$40

CS8803-Runaway Robot Solved

Your task is to complete Parts 1–4  in the “Runaway Robot” project on Udacity. While you may use the Udacity IDE to test your code against some test cases, you must submit your code to Canvas for grading using the Assignments link in the canvas navigation bar.



The parameters for the test cases will satisfy the following constraints:

•       -20.0 <= target_starting_position_x <= 20.0

•       -20.0  <=target_starting_position_y <= 20.0

•       -math.pi <= target_starting_heading <  math.pi

•       10 <= abs( target_period )  <=  50

•       1.0  <= target_speed <=  5.0

•       -20.0 <= hunter_starting_position_x  <= 20.0

•       - 20.0 <= hunter_starting_position_y  <= 20.0

•       -math.pi <= hunter_starting_heading  <  math.pi

target_period will be an integer. It represents the number of time steps required for the robot to make one complete cycle.

A positive value for target_period means that the robot will move counterclockwise; a negative value means the robot will move clockwise.

The standard deviation of the Gaussian applied to the target's measurements will be 0 in Part 1, 0.05 times the target's speed in Parts 2–4.

The hunter bot (if present) will have a max speed twice that of the target in Part 3 and 0.99 that of the target in Part 4.

The requirements for passing a test case are:

•       Part 1: Identifies the position of the target within a distance of  0.02*target_speed using at most 10 calls to  estimate_next_pos

•       Part 2: Identifies the position of the target within a distance of 0.02*target_speed using at most 1000 calls to estimate_next_pos

•       Parts 3&4: Puts the hunter within a distance of  0.02*target_speed of the target using at most 1000 calls to next_move

•       All Parts: The code takes a maximum of 5 seconds per test case; taking longer than 5 seconds will result in the failure of the test case

All Parts: No exceptions are raised

More products