Pregled bibliografske jedinice broj: 192050
Optimization of Path Finding of a Non-Autonomous Robot in a Maze
Optimization of Path Finding of a Non-Autonomous Robot in a Maze // Intelligent MAchines and Factories : (Tagungsband), 5 (2005), 1-2; 123-129 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 192050 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Optimization of Path Finding of a Non-Autonomous Robot in a Maze
Autori
Jović, Franjo ; Pešut, Marina ; Blažević, Damir
Izvornik
Intelligent MAchines and Factories : (Tagungsband) (1642-6568) 5
(2005), 1-2;
123-129
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Optimization; Robot movement; Path finding; Maze passing
Sažetak
The article describes techniques used for programming a successful movement of non-autonomous robot through series of obstacles in a maze. Obstacles are detected through a robots sensor grid, processed and stored. After data gathering process, information is transmitted to external data processing unit using infra red beam. External data processing unit estimates the shortest path for successful overcoming of obstacles and detects maze exit. Several complex algorithms are applied for path optimization. After external data processing, the results are beamed back to the non-autonomous robot in a suitable form. In the second passing the robot successfully avoids obstacles and exits the maze using the shortest path. Path optimization algorithms are resource demanding and therefore not yet suitable for robot's circuitry deployment.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika, Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek