{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308336008"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308336008","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"TurtleBot Burger robotui skirtų aplinkos išžvalgymo algoritmų palyginimas realiose sąlygose /","abstract":"For autonomous mobile robots operating in unknown indoor environments, it is not suf­ ficient to build a map and plan a path to a given goal, because the robot also has to decide which unexplored part of the environment should be investigated next. This thesis addresses the comparison of environment exploration algorithms: methods based on different decision­making principles may perform differently in real indoor environments with different geometries. Five algorithms belonging to different groups of exploration strategies are compared using a common so&#383;tware basis. The experiments were carried out in three real indoor environments: a room with objects, a multiple room layout with a narrow passage between the rooms, and a long corridor with alcoves and obstacles. The algorithms were evaluated using exploration time, map coverage, traveled path length, and navigation goal execution results. The results showed that all analyzed algorithms were able to explore real indoor environments, but their performance depended on the geometry of the environment. In the simpler room, the results of the algorithms were similar, while environments with narrow passages and a long corridor revealed clearer differences between the exploration strategies. The nearest frontier and information gain methods showed a good ba­ lance between exploration time, traveled path length, and map coverage in most experiments. The RRT and Voronoi­based methods also achieved high coverage in some environments, but their performance was less stable.","abstract_html":"For autonomous mobile robots operating in unknown indoor environments, it is not suf­ ficient to build a map and plan a path to a given goal, because the robot also has to decide which unexplored part of the environment should be investigated next. This thesis addresses the comparison of environment exploration algorithms: methods based on different decision­making principles may perform differently in real indoor environments with different geometries. Five algorithms belonging to different groups of exploration strategies are compared using a common so&amp;#383;tware basis. The experiments were carried out in three real indoor environments: a room with objects, a multiple room layout with a narrow passage between the rooms, and a long corridor with alcoves and obstacles. The algorithms were evaluated using exploration time, map coverage, traveled path length, and navigation goal execution results. The results showed that all analyzed algorithms were able to explore real indoor environments, but their performance depended on the geometry of the environment. In the simpler room, the results of the algorithms were similar, while environments with narrow passages and a long corridor revealed clearer differences between the exploration strategies. The nearest frontier and information gain methods showed a good ba­ lance between exploration time, traveled path length, and map coverage in most experiments. The RRT and Voronoi­based methods also achieved high coverage in some environments, but their performance was less stable.","abstract_has_math":false,"creators":["Bačianskas, Gvidas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:59Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308336008&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308336008&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308336008","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Bačianskas, Gvidas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308336008/308336008.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308336008&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["For autonomous mobile robots operating in unknown indoor environments, it is not suf­ ficient to build a map and plan a path to a given goal, because the robot also has to decide which unexplored part of the environment should be investigated next. This thesis addresses the comparison of environment exploration algorithms: methods based on different decision­making principles may perform differently in real indoor environments with different geometries. Five algorithms belonging to different groups of exploration strategies are compared using a common so&#383;tware basis. The experiments were carried out in three real indoor environments: a room with objects, a multiple room layout with a narrow passage between the rooms, and a long corridor with alcoves and obstacles. The algorithms were evaluated using exploration time, map coverage, traveled path length, and navigation goal execution results. The results showed that all analyzed algorithms were able to explore real indoor environments, but their performance depended on the geometry of the environment. In the simpler room, the results of the algorithms were similar, while environments with narrow passages and a long corridor revealed clearer differences between the exploration strategies. The nearest frontier and information gain methods showed a good ba­ lance between exploration time, traveled path length, and map coverage in most experiments. The RRT and Voronoi­based methods also achieved high coverage in some environments, but their performance was less stable."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["TurtleBot Burger robotui skirtų aplinkos išžvalgymo algoritmų palyginimas realiose sąlygose /","Comparative analysis of environment exploration algorithms for the turtlebot burger robot in real-world conditions."]}]}],"canonical_facts":{"dc:creator":["Bačianskas, Gvidas,"],"dc:date":["2026"],"dc:description":["For autonomous mobile robots operating in unknown indoor environments, it is not suf­ ficient to build a map and plan a path to a given goal, because the robot also has to decide which unexplored part of the environment should be investigated next. This thesis addresses the comparison of environment exploration algorithms: methods based on different decision­making principles may perform differently in real indoor environments with different geometries. Five algorithms belonging to different groups of exploration strategies are compared using a common so&#383;tware basis. The experiments were carried out in three real indoor environments: a room with objects, a multiple room layout with a narrow passage between the rooms, and a long corridor with alcoves and obstacles. The algorithms were evaluated using exploration time, map coverage, traveled path length, and navigation goal execution results. The results showed that all analyzed algorithms were able to explore real indoor environments, but their performance depended on the geometry of the environment. In the simpler room, the results of the algorithms were similar, while environments with narrow passages and a long corridor revealed clearer differences between the exploration strategies. The nearest frontier and information gain methods showed a good ba­ lance between exploration time, traveled path length, and map coverage in most experiments. The RRT and Voronoi­based methods also achieved high coverage in some environments, but their performance was less stable."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308336008&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308336008/308336008.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["TurtleBot Burger robotui skirtų aplinkos išžvalgymo algoritmų palyginimas realiose sąlygose /","Comparative analysis of environment exploration algorithms for the turtlebot burger robot in real-world conditions."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:59Z"}