Pregled bibliografske jedinice broj: 124048
The Shortest Path Determination in a Multi AGV System by Using String Algebra
The Shortest Path Determination in a Multi AGV System by Using String Algebra // The CD-ROM Proceedings of the IEEE Internatioanl Conference on Industrial Technology ICIT'03 / Jezernik, Karel (ur.).
Maribor, 2003. str. 984-989 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 124048 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
The Shortest Path Determination in a Multi AGV System by Using String Algebra
Autori
Bogdan, Stjepan ; Punčec, Mario ; Kovačić, Zdenko
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
The CD-ROM Proceedings of the IEEE Internatioanl Conference on Industrial Technology ICIT'03
/ Jezernik, Karel - Maribor, 2003, 984-989
Skup
The IEEE Internatioanl Conference on Industrial Technology ICIT'03
Mjesto i datum
Maribor, Slovenija, 10.12.2003. - 12.12.2003
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Automated Guided Vehicles; flexible manufacturing systems; shortest path; string-algebra
Sažetak
This paper is concerned with automation of a factory floor shop containing a number of robotic manufacturing cells and an accompanying warehouse connected with a number of AGVs that perform transportation tasks between dynamically configured source and destination nodes. In order to keep the high efficacy of the system, a supervisory controller must control the mission of each AGV and depending on the current position of AGVs, its current mission and its interaction with other AGVs, the problem of finding the shortest, or shortest possible (i.e. alternate) path between nodes must be solved. Here we present an algorithm for calculation of the shortest path between each pair of nodes by using String algebra.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika
