Search

V podjetju Etra d.o.o. se ukvarjamo z avtomatizacijo in robotizacijo industrijskih procesov. Podjetje Etra d.o.o. je na tržišču prisotno že več kot 20 let in je eno izmed vodilnih podjetij, ki ponujajo celovite industrijske aplikacije na slovenskem in tujem tržišču. Projekt, pri katerem sem sodeloval, je bila izdelava avtomatiziranega visokega regalnega skladišča, od načrtovanja do končne izvedbe. Magistrska naloga zajema opis regalnega skladišča, ki služi za shranjevanje bal plastične folije. Skladišče omogoča skladiščenje do 2300 palet različnih dimenzij. Podrobneje so opisani algoritmi razvrščanja palet in delovanje nadzornega sistema. V nalogi je opisana uporabljena strojna oprema vezana na električni in programski del. Opisan je Siemensov krmilnik S7-414 in komunikacijski protokoli, preko katerih komunicira s perifernimi enotami. Prav tako je opisana programska oprema za programiranje krmilnikov (STEP7) in nadzornih sistemov (WinCC). V nadaljnjih poglavjih so opisane in orisane metode in algoritmi za avtomatsko delovanje skladišča. Delovanje slednjega je integrirano v naročnikov delovni proces tako, da ne povzroča dodatnih stroškov in časovnih zakasnitev. Algoritmi zlaganja omogočajo dinamično kreiranje položaja odlagalnih celic, s čimer dosežemo večjo gostoto shranjevanja izdelkov in večjo prilagodljivost glede na velikost izdelkov. Obenem skrbijo za sortiranje enakih oziroma podobnih izdelkov skupaj, s čimer optimiziramo delovanje skladišča. Pri zahtevah za izvoz palet algoritmi pobiranja poskrbijo za nemoteno dobavo izdelkov. Hkrati omogočajo različne strategije pobiranja, in sicer pobiranje po izbrani paleti, po delovnem nalogu, po najstarejšem tovoru ipd. Skladišče je avtonomno, operaterji pa komunicirajo in podajajo zahteve izključno preko internega logističnega sistema. The company Etra d.o.o. works in the field of automatisation and robotisation of industrial processes. Etra d.o.o. has been present on the market for over 20 years and is one of the leading companies offering comprehensive industrial applications on the Slovenian and foreign markets. The aim of project I participated in was to design an automated high rack warehouse, from the planning to the final implementation phase. This Master's thesis includes a description of the rack warehouse, which serves to store bales of plastic sheeting. The warehouse enables storage of up to 2,300 pallets of various dimensions. The paper elaborates on the classification algorithms for pallets and the control system operation. This paper firstly describes the hardware attached to the electrical and software parts. It also includes a description of the Siemens S7-414 controller and communication protocols that are used for the communication with peripheral units and a description of the software for PLC programming (STEP 7) and control systems (WinCC). Subsequent chapters describe and outline the methods and algorithms for automatic warehouse operation. The warehouse is integrated into the client’s working process, so that it does not cause additional costs and time delays. Stacking algorithms allow a dynamic creation of storage cell positions, which results in higher density of stored products and increases flexibility in regards to product size. At the same time the algorithms sort identical or similar products together, thereby optimizing the operation of the warehouse. Collection algorithms ensure smooth supply of products in accordance with all export requirements. At the same time they allow different collection strategies, for example the collection of the selected range, according to the work order, the oldest cargo, etc. The warehouse is autonomous and the operators communicate and pass on their requirements exclusively through the internal logistics system.

V tej diplomski nalogi se je reševal problem iskanja najboljše strategije pri igri Kača, ki nas bi ponesla do najboljšega rezultata. Problem pri tem je, da je mogočih neskončno različnih strategij, vsaka pa ima svoje prednosti in slabosti. Za reševanje problema se je najprej izdelalo osnovno igro Kača. Na njej se je potem implementiralo in izdelalo različne algoritme umetne inteligence, pri čemer vsak uporablja svojo strategijo. Ko je igra delovala, se je začelo z izdelavo algoritmov. Algoritme se je izdelalo enega za drugim. Rezultati se primerjajo po največji dolžini kače, številih premikov in številih poskusov. This paper solves the problem of looking for the best strategy in the Snake game that would ensure the best result. The problem is that there are countless possible strategies, with each having its strengths and weaknesses. To solve the problem, the basic Snake game was first created. After that, various artificial intelligence algorithms were created and implemented, with each using its own strategy. When the game was functional, algorithms were created one after another. Results are compared in terms of snake length, number of moves and number of tries.

Računanje časovne zahtevnosti sodi med osnovne naloge področja analize algoritmov, s katero želimo pridobiti funkcijo, ki nam za dano velikost problema napove, koliko časa se bo algoritem izvajal. Teoretična analiza je pogosto zahtevna, poleg tega ima še nekatere druge pomanjkljivosti, zato si lahko pomagamo z empirično analizo časovne zahtevnosti, na kar smo se osredotočili v tem delu. Razvili smo postopke, ki omogočajo analizo rezultatov meritev, torej podatkov, ki jih pridobimo z izvajanjem algoritmov na nalogah različnih velikosti. Analiza vrne ocenjen razred časovne zahtevnosti ter zapis funkcije v simbolični obliki. Razvili smo novo metodo za detekcijo slabih meritev, ki temelji na analizi zaporednih točk. Uvedli smo novo metriko za primerjavo algoritmov med seboj. Uporabili smo tudi nekaj novih pristopov k že znanim metodam ter vse skupaj vgradili v obstoječi sistem za avtomatsko analizo algoritmov. Time complexity is known as one of the principal tasks of algorithm analysis the goal is to obtain a function which - for a given size of the problem - estimates how much time the algorithm execution will take. Theoretical analysis is often cumbersome and has other drawbacks as well. Thus, the empirical analysis of time complexity can be used, which is also the primary focus of this paper. We have developed procedures that allow us analysis of measurements - i.e. data -, which we obtain by running algorithms on problems of different sizes. The analysis provides us with an estimated time complexity class and function in symbolic form. We have developed a new method for detection of bad measurements, which is based on analysis of consecutive points, and introduced new metrics for algorithm comparison. A few new approaches were intertwined together with existing methods, which was then, all together, integrated in the existing system for automatic algorithm analysis.