Computers and Thought
Experiments with a theorem-utilizing program
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
| Hi-index | 0.00 |
A state variable formulation of the remote manipulation problem is presented, applicable to human supervised or autonomous computer-manipulators. A discrete state vector, containing position variables for the manipulator and relevant objects, spans a quantized state space comprising many static configurations of objects and hand. A manipulation task is a desired new state.State transitions are assigned costs and are accomplished by commands: hand motions plus grasp, release, push, twist, etc. In control theory terms the problem is to find the cheapest control history(if any) from present to desired state. In theorem proving terms it is to combine predicates and axioms to prove (or disprove) the proposition "The task... is possible. " Each corresponds to finding the shortest path to the desired state. A method similar to Dynamic Programming is used to determine the optimal history. The system is capable of obstacle avoidance, grasp rendezvous, incorporationof new sensor data, remembering results of previous tasks, and so on.