Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/140466
Title: Pathfinding algorithms in graphs and applications
Author: Monzonís Laparra, Daniel
Director/Tutor: Benseny, Antoni
Keywords: Algorismes computacionals
Treballs de fi de grau
Teoria de grafs
Matemàtica discreta
Resolució de problemes
Intel·ligència artificial
Computer algorithms
Bachelor's thesis
Graph theory
Discrete mathematics
Problem solving
Artificial intelligence
Issue Date: 15-Jan-2019
Abstract: [en] The aim of this work is to give a rigorous mathematical insight of the most popular pathfinding algorithms, focusing on $A{∗}$ and trying to understand how the heuristic it uses affects its correctness and performance. We complement this theoretical study of the algorithms with experimental results found by running two benchmarks of the algorithms using a simulator of the algorithms built for this project.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny
URI: http://hdl.handle.net/2445/140466
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
memoria.pdfMemòria547.8 kBAdobe PDFView/Open
codi_font.zipCodi font215.38 kBzipView/Open


This item is licensed under a Creative Commons License Creative Commons