Steelebot Impelementation
The greedy search algorithm is implemented on the Steelebot, shown above. The Steelebot
is driven with two wheels and moves from point to point smoothly
and accurately.
Two Steelebots, two targets, communication range limited to 1 meter.
The figure above shows the paths of two Steelebots performing the greedy search algorithm. The x’s
represent the target locations, the circles represent the vehicle starting
points, the dotted lines show the simulation vehicle paths, and the solid
lines show the live run vehicle paths. The axes are labeled in meters.
Communication range is limited to 1 meter.
The Steelebots begin moving toward the same target location since it is the closest one
for both vehicles. When they move within communication range, they arbitrate their
target selection and the Steelebot further away from this target selects a different
target.