prikaz prve stranice dokumenta Planiranje puta autonomne prskalice
  Download
PDF 1.65 MB
undergraduate thesis
Planiranje puta autonomne prskalice
2022. urn:nbn:hr:190:284352
Paro, Borna
University of Rijeka
Faculty of Engineering
Department of Computer Engineering

Cite this document

Paro, B. (2022). Planiranje puta autonomne prskalice (Undergraduate thesis). Rijeka: University of Rijeka, Faculty of Engineering. Retrieved from https://urn.nsk.hr/urn:nbn:hr:190:284352

Paro, Borna. "Planiranje puta autonomne prskalice." Undergraduate thesis, University of Rijeka, Faculty of Engineering, 2022. https://urn.nsk.hr/urn:nbn:hr:190:284352

Paro, Borna. "Planiranje puta autonomne prskalice." Undergraduate thesis, University of Rijeka, Faculty of Engineering, 2022. https://urn.nsk.hr/urn:nbn:hr:190:284352

Paro, B. (2022). 'Planiranje puta autonomne prskalice', Undergraduate thesis, University of Rijeka, Faculty of Engineering, accessed 19 December 2024, https://urn.nsk.hr/urn:nbn:hr:190:284352

Paro B. Planiranje puta autonomne prskalice [Undergraduate thesis]. Rijeka: University of Rijeka, Faculty of Engineering; 2022 [cited 2024 December 19] Available at: https://urn.nsk.hr/urn:nbn:hr:190:284352

B. Paro, "Planiranje puta autonomne prskalice", Undergraduate thesis, University of Rijeka, Faculty of Engineering, Rijeka, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:190:284352

Please login to the repository to save this object to your list.
Metadata
TitlePlaniranje puta autonomne prskalice
Title (english)Autonomous sprayer path planning
AuthorBorna Paro
MentorKristijan Lenac (mentor)
Committee memberViktor Sučić (predsjednik povjerenstva)
Committee memberKristijan Lenac (član povjerenstva)
GranterUniversity of Rijeka
Faculty of Engineering
(Department of Computer Engineering)
Rijeka
Defense date and country2022-07-13, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Artificial Intelligence
Abstract
U ovom radu je opisan algoritam za traženje najkraćeg puta koji će obići sve sadnice uz nula ili što manje preklapanja koristeći Python programski jezik. Uz algoritam, u radu je opisana i prikazana simulacija koja je kreirana koristeći ROS2, Gazebo simulator, RViz2. Opisan je rad ROS-a, korišteni paketi i alati te model robota. Prikazani su najbitniji dijelovi koda
Abstract (english)
This paper describes an algorithm for finding the shortest path that will visit all seedlings with zero or as little overlap using the Python programming language. In addition to the algorithm, the paper describes and shows the simulation created using ROS2, Gazebo simulator and RViz2. The operation of ROS, robot model, the packages and tools used are described. The most important parts of the code are presented.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:190:284352
Study programmeTitle: Computer Engineering
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 conditionsOpen access
Terms of useLicence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) icon
Created on2022-07-13 12:50:18