Pre-Determined Dominance vs. Dynamic Dominance:
Daivd suggested that we needed to find a way to minimize the amount of
distance traveled by colliding robots while at the same time not try
overwhelm the algorithm with numerous calculations.
Dominance algorithm from last semester faced the problem of having
robots rebound in the opposite direction of travel when least dominant
even though the robot is relatively closer to destination than the
more dominant robot.
This happens more and more as we increased the strength of collision
detection. Thus we decided that Dominance cannot be pre-determined
thus it cannot also be static.
Dominance in Dynamic Dominance is determined by distance between
current and final position. We reason that once a robot is close to
its final destination, they should be allowed to reach their
destination first and allow all other opposing robots to move out of
the way.
To run the applet click
here.