Wednesday, December 4, 2019 - 12:00 to 14:00
SCHOOL OF COMPUTER SCIENCE
The School of Computer Science at the University of Windsor is pleased to present …
MSc Thesis Defense by:
Harinder Kaur Sidhu
Date: Wednesday December 4, 2019
Time: 12:00am – 2:00pm
Location: 3105, Lambton Tower
Abstract:
Pathfinding is the search for an optimal path from a start location to a goal location in a given environment. In Artificial Intelligence pathfinding algorithms are typically designed as a kind of graph search. These algorithms are applicable in a wide variety of applications such as computer games, robotics, networks, and navigation systems. The performance of these algorithms is affected by several factors such as the problem size, path length, the number and distribution of obstacles, data structures and heuristics. When new pathfinding algorithms are proposed in the literature, their performance is often investigated empirically (if at all). Proper experimental design and analysis is crucial to provide an informative and non-misleading evaluation. In this research, we survey many papers and classify them according to their methodology, experimental design, and analytical techniques. We identify some weaknesses in these areas that are all too frequently found in reported approaches. We then provide a set of guidelines for the experimenter and examine case studies that demonstrate the pitfalls in deviating from best practices.
Thesis Committee:
Internal Reader: Dr. Arunita Jaekal
External Reader: Dr. Christina Semeniuk
Advisor: Dr. Scott Goodwin
Chair: Dr. Sherif Saad
MSc Thesis Defense Announcement
5113 Lambton Tower, 401 Sunset Ave., Windsor ON., N9B 3P4 (519) 253-3000 Ext. 3716 csgradinfo@uwindsor.ca