Motion-Planning-Prashikshan

Learning motion planning and algos

Consisting 6 Tasks:

1. Installation
2. To study about Rotary Encoders in detail(Must include Basic types Absolute and Incremental encoder and also the mechanism to how the tics are counted and the relation between clockwise and anti-clockwise rotation).
3. To execute straight line motion(go through the logic and code behind it).
4. Study about pseudo inverse of a matrix. Study basics about holonomic motion. Advantages of holonomic motion & orientation of a holonomic bot.
5. When we do a maze solving or complex line following, we need to count the number of nodes. A node is defined as a region over which all the IR sensors give reading 0 i.e. a node is a black surface and if it is a node, all the sensors lie on black surface.
6. You might have ideas about maze solving and wall following. It needs real knowledge on algorithm for solving them. There are many types of algorithms, some of them are Graphs, DFS and BFS, shortest path algorithms(Dijkstra algorithm). Workout on how these are used in finding shortest path and on other algorithms used for the same cause. Revisit the concepts of Arrays and pointers as they play vital role in these algorithms.

Note: You can search from Internet, Google, Youtube or any other source as per your choice.

VSSUT ROBOTICS