An introduction to computational geometry focusing on applications to autonomous mobile robots. Topics may include planning, probabilistic roadmaps, search strategies, coverage algorithms, watchman routes, vision-based landmark identification and multi-robot applications. Prerequisite(s): COMP 2804 and one of COMP 2402, COMP 2002 or SYSC 2100.Lectures three hours a week.
An introduction to computational geometry focusing on applications to autonomous mobile robots. Topics may include planning, probabilistic roadmaps, search strategies, coverage algorithms, watchman routes, vision-based landmark identification and multi-robot applications. Prerequisite(s): COMP 2804 and one of COMP 2402, COMP 2002 or SYSC 2100.Lectures three hours a week.