THE SPIDER ROBOT PROBLEM

The spider robot is modelled as a point where all its legs are attached, and the footholds where the robot can securely place its feet consist of a set of n points in the plane. The constraints on the robot motion are of two types; first the robot feet have to rest on reachable footholds (feasibility constraint), second each position of the robot must be stable (stability constraint).

Home