| Title: | Algoritmi iskanja poti v labirintu : zaključno delo |
|---|
| Authors: | ID Burja, Urban (Author)
ID Kolmanič, Simon (Mentor) More about this mentor...  |
|---|
| Files: |  VS_Burja_Urban_2019.pdf (3,36 MB)
MD5: DCA30B53BE8B49E0BA4BC8C1E1B8EC33
PID: 20.500.12556/dkum/403a54f1-0209-4930-a5d2-d1163d4a2b05
|
|---|
| Language: | Slovenian |
|---|
| Work type: | Bachelor thesis/paper |
|---|
| Typology: | 2.11 - Undergraduate Thesis |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Namen diplomske naloge je predstavitev različnih pristopov reševanja problema iskanja
poti v labirintu med dvema točkama. Spoznali smo klasične metode, kot so iskanje v
širino, iskanje v globino, Dijkstrov algoritem, algoritem A*, Usmerjeno požrešno iskanje
ter algoritem levega pravila. Vsak algoritem smo opisali in ga vizualno predstavili. V
zaključku pogledamo še rezultate posameznega pristopa na dveh primerih ter opišemo
naše ugotovitve |
|---|
| Keywords: | najkrajša pot, Iskanje v širino, Dijkstrov algoritem, algoritem A*, Usmerjeno požrešno iskaje |
|---|
| Place of publishing: | Maribor |
|---|
| Place of performance: | Maribor |
|---|
| Publisher: | [U. Burja] |
|---|
| Year of publishing: | 2019 |
|---|
| Number of pages: | VI, 41 f. |
|---|
| PID: | 20.500.12556/DKUM-74526 |
|---|
| UDC: | 004.021:688-749.8(043.2) |
|---|
| COBISS.SI-ID: | 22901526 |
|---|
| NUK URN: | URN:SI:UM:DK:8ZOUPDRE |
|---|
| Publication date in DKUM: | 22.11.2019 |
|---|
| Views: | 1630 |
|---|
| Downloads: | 186 |
|---|
| Metadata: |    |
|---|
| Categories: | KTFMB - FERI
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
