Course Presentations during CS 698 Aug-Dec 2001

1. Visibility Graphs - 2D and 3D - akhil gupta
2. Path planning with non holonomic robots - anusheel nahar
3. Gait-Pattern Adaptation - anup k agrawal
4. Probabilistic Roadmap Methods - aravind menon
5. Approximate Cell Decomposition - ashutosh kumar
6. 3D Collision Detection using Oriented Bounded Boxes - d s lamba
7. Voronoi Diagrams - kshitij judah
8. Decoupled Planning - kumar gaurav
9. Exact Decomposition - the Canny method - manu prakash
10. Local rule-based path planning methods - akshaya mohan
11. Multiple Moving Objects - nupur kothari
12. Exact Cell Decomposition - p baroi
13. RMP Overview and Visibility Graph Method - pooja nath
14. Kinematic Constraints - rajat raina
15. C-Space Construction for Non-Convex Polygons - ruchi saran
16. Microscopic Modelling of Driver Behaviour amid Moving Vehicles - swati jha
17. 3-Dimensional Voronoi Roadmap Methods - vartika bhandari
18. Potential Field Methods : Randomized motion planning - vidit jain
19. Methods for Visibility Constraint Motion Planning - vikrant kumar
20. Approximate Cell Decomposition - vivek vaibhav

Reference(for an implementable algorithm) : Improved Projection for Cylindrical Algebraic Decomposition - Christopher Brown Computer