Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/140466Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Benseny, Antoni | - |
| dc.contributor.author | Monzonís Laparra, Daniel | - |
| dc.date.accessioned | 2019-09-19T07:40:03Z | - |
| dc.date.available | 2019-09-19T07:40:03Z | - |
| dc.date.issued | 2019-01-15 | - |
| dc.identifier.uri | http://hdl.handle.net/2445/140466 | - |
| dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny | ca |
| dc.description.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. | ca |
| dc.format.extent | 39 p. | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | eng | ca |
| dc.rights | cc-by-nc-nd (c) Daniel Monzonís Laparra, 2019 | - |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
| dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
| dc.subject.classification | Algorismes computacionals | ca |
| dc.subject.classification | Treballs de fi de grau | - |
| dc.subject.classification | Teoria de grafs | ca |
| dc.subject.classification | Matemàtica discreta | ca |
| dc.subject.classification | Resolució de problemes | ca |
| dc.subject.classification | Intel·ligència artificial | ca |
| dc.subject.other | Computer algorithms | en |
| dc.subject.other | Bachelor's theses | - |
| dc.subject.other | Graph theory | en |
| dc.subject.other | Discrete mathematics | en |
| dc.subject.other | Problem solving | en |
| dc.subject.other | Artificial intelligence | en |
| dc.title | Pathfinding algorithms in graphs and applications | ca |
| dc.type | info:eu-repo/semantics/bachelorThesis | ca |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
| Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| memoria.pdf | Memòria | 547.8 kB | Adobe PDF | View/Open |
| codi_font.zip | Codi font | 215.38 kB | zip | View/Open |
This item is licensed under a
Creative Commons License
