Robot Hand - Graph Search Algorithms

Problem:

We have to control a robot hand which can move up, down, right or left. Aim is to pick up item A and place it box A, item B in box B and so on.

Solution:

• Greedy: We started with the basic greedy approach where we move the hand till we reach the items and then the boxes.
• BFS: Explore the map breadth-wise
• DFS: Explore the map depth-wise
• Best First: Use heuristics to judge which action will take us closest to the goal position