prikaz prve stranice dokumenta Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama
No public access
undergraduate thesis
Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama
2023. urn:nbn:hr:168:408700
Anić, Nikša
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Anić, N. (2023). Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:408700

Anić, Nikša. "Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:408700

Anić, Nikša. "Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:408700

Anić, N. (2023). 'Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 08 May 2024, https://urn.nsk.hr/urn:nbn:hr:168:408700

Anić N. Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2023 [cited 2024 May 08] Available at: https://urn.nsk.hr/urn:nbn:hr:168:408700

N. Anić, "Planiranje putanje mobilnog robota temeljem analogije s otporničkim mrežama", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:168:408700

Please login to the repository to save this object to your list.
Metadata
TitlePlaniranje putanje mobilnog robota temeljem analogije s otporničkim mrežama
Title (english)Path planning for the mobile robot based on analogy with resistive grids
AuthorNikša Anić
MentorMartin Dadić (mentor)
Committee memberMartin Dadić (predsjednik povjerenstva)
Committee memberLuka Humski (član povjerenstva)
Committee memberAna Drandić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2023-06-29, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Ovaj rad se bavi simulacijom robotovog planiranja putanje baziranog na analogiji s otporničkim mrežama. Promatramo robota postavljenog na neki čvor mreže te algoritme potrebne za pronalazak najkraceg puta do ciljnog čvora. Predstavljamo matematički model problema u obliku rješavanja Kirchhoffovog zakona, te opisujemo njegovu implementaciju u programskom jeziku Java.
Abstract (english)
This paper presents a simulation of a robot’s path planing based on finite resistive grids. The robot is placed in an environment represented by a finite resistive grid, and so we observe the algorithms used for locating the shortest route from any given node to another. A mathematical model of the problem is given in the form of a variation of Kirchhoff’s law, followed by an explanation of the afforementioned model’s implementation in an object-oriented language; more specifically Java.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:408700
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2023-10-11 08:16:36