<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-5ZYL6KZE/2821413d-1a38-40a6-8d27-ba044d8bc84f/PDF"><dcterms:extent>525 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-5ZYL6KZE/9506f4df-8cc4-4122-a11b-9428dcd9b478/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2014-2026"><edm:begin xml:lang="en">2014</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-5ZYL6KZE"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2022</dcterms:issued><dc:creator>Leng, J. Y.</dc:creator><dc:creator>Liu, X.Q.</dc:creator><dc:creator>Meng, Q. N.</dc:creator><dc:creator>Wang, J. J.</dc:creator><dc:creator>Wang, Y. J.</dc:creator><dc:creator>Zhou, M. J.</dc:creator><dc:format xml:lang="sl">letnik:17</dc:format><dc:format xml:lang="sl">številka:4</dc:format><dc:format xml:lang="sl">str. 505-513</dc:format><dc:identifier>DOI:10.14743/apem2022.4.452</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:269454851</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-5ZYL6KZE</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</dc:publisher><dcterms:isPartOf xml:lang="sl">Advances in production engineering and management</dcterms:isPartOf><dc:subject xml:lang="sl">algoritem optimizacije s kolonijami mravelj</dc:subject><dc:subject xml:lang="en">ant colony algorithm</dc:subject><dc:subject xml:lang="en">automated guided vehicle(AGV)</dc:subject><dc:subject xml:lang="sl">avtomatsko vodena vozila</dc:subject><dc:subject xml:lang="en">heuristic algorithm</dc:subject><dc:subject xml:lang="sl">hevristični algoritem</dc:subject><dc:subject xml:lang="sl">inteligentna proizvodnja</dc:subject><dc:subject xml:lang="en">intelligent manufacturing</dc:subject><dc:subject xml:lang="en">MATLAB</dc:subject><dc:subject xml:lang="en">multi-AGVs</dc:subject><dc:subject xml:lang="sl">načrtovanje opravil</dc:subject><dc:subject xml:lang="sl">načrtovanje poti</dc:subject><dc:subject xml:lang="en">path planning</dc:subject><dc:subject xml:lang="en">task scheduling</dc:subject><dc:subject xml:lang="en">task sequence</dc:subject><dc:subject xml:lang="sl">zaporedje opravil</dc:subject><dcterms:temporal rdf:resource="2014-2026" /><dc:title xml:lang="sl">Study on scheduling and path planning problems of multi-AGVs based on a heuristic algorithm in intelligent manufacturing workshop|</dc:title><dc:description xml:lang="sl">In order to solve the scheduling and path planning problems of multi-AGVs in an intelligent manufacturing workshop, it is necessary to consider loading, unloading, and transporting the workpiece of each AGV at the same time. A step task scheduling and path optimization mode of AGV is proposed. The process is as follows: Firstly, a mathematical model algorithm and a material transportation task allocation algorithm based on the urgency degree of workpiece processing were established for the optimization objective, and all workpiece transportation task sequences between shelves and processing equipment were assigned to the corresponding AGV to generate the initial feasible path of each AGV. Then, the AGV collision detection and anti-collision algorithm are designed to plan the global collision-free walking path of multi-AGVs in the workshop, and the path can be dynamically adjusted according to the delivery task. The model is solved by a heuristic algorithm ant colony algorithm and MATLAB coding. Finally, an example is given to verify the effectiveness of the method, which can effectively solve the task allocation of multi-AGVs and avoid collision path planning based on the transportation task sequence, and improve the work efficiency of AGV. This research can provide a theoretical basis and practical reference for realizing multi AGVs collaborative scheduling by using AGV automated material transport system in an intelligent production workshop</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-5ZYL6KZE"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-5ZYL6KZE" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-5ZYL6KZE/2821413d-1a38-40a6-8d27-ba044d8bc84f/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza v Mariboru, Fakulteta za strojništvo</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-5ZYL6KZE/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-5ZYL6KZE" /></ore:Aggregation></rdf:RDF>