Site Search
Computer Science

Photos

Dr. Luis RuedaDr. Luis Rueda
Dr. Luis Rueda
Dr. Ziad Kobti lecturingDr. Ziad Kobti
Dr. Ziad Kobti
Lambton TowerLambton Tower
Lambton Tower
Robin Gras, Ph.D.Dr. Robin Gras
Dr. Robin Gras
Xiaobu Yuan, Ph.D.Dr. Xiaobu Yuan
Dr. Xiaobu Yuan
Dr. Robert KentDr. Robert Kent
Dr. Robert Kent
Jessica Chen, Ph.D.Dr. Jessica Chen
Dr. Jessica Chen
Windsor WaterfrontWindsor Waterfront Park
Windsor Waterfront Park
Dr. Scott GoodwinDr. Scott Goodwin
Dr. Scott Goodwin
Arunita Jaekel, Ph.D.Dr. Arunita Jaekel
Dr. Arunita Jaekel
Christie Ezeife, Ph.D.Dr. Christie Ezeife
Dr. Christie Ezeife
Alioune Ngom, Ph.D.Dr. Alioune Ngom
Dr. Alioune Ngom
Imran Ahmad, Ph.D.Dr. Imran Ahmad
Dr. Imran Ahmad

Performance Evaluation of Competing Data Structures in Pathfinding

Add this event into your calendar using the iCAL format
  • Wed, 12/12/2018 - 11:00am - 12:00pm




The School of Computer Science at the University of Windsor is pleased to present …

MSc Thesis Defense by:
Mohsen Tavakoli

Pathfinding is an essential part of many applications, including video games and robot navigation. A pathfinding algorithm usually finds a path from the given starting point to the endpoint. Many different implementations of pathfinding solutions exist in the industry. One of the most known and used of these algorithms is A*. A* will find the shortest path from the starting point to the endpoint. Classic A* algorithm can guarantee the shortest path to the desired destination which was introduced in 1968 by Hart, Nilsson, and Raphael. A* explores the nodes in the graph from the start position one by one and assign them a value of F which is the sum of G cost and H cost. The G Cost is the actual cost of exploring the node from the starting position to the current node, and H cost is the estimation of the cost of from the current node to the goal node. The Open List keeps all of the nodes that are not explored at each iteration of the algorithm. In each iteration, the algorithm removes the node with the least value of F cost and run the algorithm. If the node is not the goal, it will be added to the closed list. Interactions with the open list, which are insert (current node) and remove Min, are costliest part of the algorithm. It is well known that using a priority queue will increase the performance of this algorithm. A number of priority queues have been used to implement A* and improve the performance of this algorithm. We propose to use a Lazy binary heap and evaluate its performance compare to other data structures. We expect that due to decreasing the size of current open list, it will outperform other binary heaps.

Thesis Committee:

Internal Reader:  Dr. Mehdi Kargar
External Reader:  Dr. Myron Hlynka
Advisor:  Dr. Scott Goodwin
Chair:  Dr. Sherif Saad Ahmed



Melissa Robinet
csgradinfo@uwindsor.ca
(519)253-3000 ext.3773