Benseny, AntoniMonzonís Laparra, Daniel2019-09-192019-09-192019-01-15https://hdl.handle.net/2445/140466Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny[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.39 p.application/pdfengcc-by-nc-nd (c) Daniel Monzonís Laparra, 2019http://creativecommons.org/licenses/by-nc-nd/3.0/es/Algorismes computacionalsTreballs de fi de grauTeoria de grafsMatemàtica discretaResolució de problemesIntel·ligència artificialComputer algorithmsBachelor's thesesGraph theoryDiscrete mathematicsProblem solvingArtificial intelligenceinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess