25 research outputs found

    A Framework for Applying Reinforcement Learning to Deadlock Handling in Intralogistics

    Get PDF
    Intralogistics systems, while complex, are crucial for a range of industries. One of their challenges is deadlock situations that can disrupt operations and decrease efficiency. This paper presents a four-stage framework for applying reinforcement learning algorithms to manage deadlocks in such systems. The stages include Problem Formulation, Model Selection, Algorithm Selection, and System Deployment. We carefully identify the problem, select an appropriate model to represent the system, choose a suitable reinforcement learning algorithm, and finally deploy the solution. Our approach provides a structured method to tackle deadlocks, improving system resilience and responsiveness. This comprehensive guide can serve researchers and practitioners alike, offering a new avenue for enhancing intralogistics performance. Future research can explore the framework’s effectiveness and applicability across different systems

    Conflict-free dynamic route multi-AGV using dijkstra floyd-warshall hybrid algorithm with time windows

    Get PDF
    Autonomous Guided Vehicle is a mobile robot that can move autonomously on a route or lane in an indoor or outdoor environment while performing a series of tasks. Determination of the shortest route on an autonomous guided vehicle is one of the optimization problems in handling conflict-free routes that have an influence on the distribution of goods in the manufacturing industry's warehouse. Pickup and delivery processes in the distribution on AGV goods such as scheduling, shipping, and determining the route of vehicle with short mileage characteristics, is very possible to do simulations with three AGV units. There is a windows time limit on workstations that limits shipping. The problem of determining the route in this study is considered necessary as a multi-vehicle route problem with a time window. This study aims to describe the combination of algorithms written based on dynamic programming to overcome the problem of conflict-free AGV routes using time windows. The combined approach of the Dijkstra and Floyd-Warshall algorithm results in the optimization of the closest distance in overcoming conflict-free routes

    Development of an Industrial Internet of Things (IIoT) based Smart Robotic Warehouse Management System

    Get PDF
    According to data of Census and Statistics Department, freight transport and storage services contributed to 90% of the employment of logistics sector in the period from 2010 to 2014. Traditional warehouse operations in Hong Kong are labor-intensive without much automation. With the rapid increasing transaction volume through multi-channel, the preference for next-day delivery service has been increasing. As a result, 3rd party logistics providers have realized the importance of operational efficiency. With the advent of Industry 4.0 emerging technologies including Autonomous Robots, Industrial Internet of Things (IIoT), Cloud Computing, etc., a smart robotic warehouse management system is proposed as it redefines the warehouse put-away and picking operations from man-to-goods to goods-to-man using autonomous mobile robots. This paper aims to develop and implement an IIoT-based smart robotic warehouse system for managing goods and autonomous robots, as well as to make use of the autonomous mobile robots to deliver the goods automatically for put-away and picking operations. The significance of the paper is to leverage the Industry 4.0 emerging technologies to implement the concept of smart warehousing for better utilization of floor space and labor force so as to improve logistics operational efficiency

    Task Assignment and Path Planning for Autonomous Mobile Robots in Stochastic Warehouse Systems

    Get PDF
    The material handling industry is in the middle of a transformation from manual operations to automation due to the rapid growth in e-commerce. Autonomous mobile robots (AMRs) are being widely implemented to replace manually operated forklifts in warehouse systems to fulfil large shipping demand, extend warehouse operating hours, and mitigate safety concerns. Two open questions in AMR management are task assignment and path planning. This dissertation addresses the task assignment and path planning (TAPP) problem for autonomous mobile robots (AMR) in a warehouse environment. The goals are to maximize system productivity by avoiding AMR traffic and reducing travel time. The first topic in this dissertation is the development of a discrete event simulation modeling framework that can be used to evaluate alternative traffic control rules, task assignment methods, and path planning algorithms. The second topic, Risk Interval Path Planning (RIPP), is an algorithm designed to avoid conflicts among AMRs considering uncertainties in robot motion. The third topic is a deep reinforcement learning (DRL) model that is developed to solve task assignment and path planning problems, simultaneously. Experimental results demonstrate the effectiveness of these methods in stochastic warehouse systems

    Evolutionary algorithms for robot path planning, task allocation and collision avoidance in an automated warehouse

    Get PDF
    Thesis (PhD)--Stellenbosch University, 2022.ENGLISH ABSTRACT: Research with regard to path planning, task allocation and collision avoidance is important for improving the field of warehouse automation. The dissertation addresses the topic of routing warehouse picking and binning robots. The purpose of this dissertation is to develop a single objective and multi-objective algorithm framework that can sequence products to be picked or binned, allocate the products to robots and optimise the routing through the warehouse. The sequence of the picking and binning tasks ultimately determines the total time for picking and binning all of the parts. The objectives of the algorithm framework are to minimise the total time for travelling as well as the total time idling, given the number of robots available to perform the picking and binning functions. The algorithm framework incorporates collision avoidance since the aisle width does not allow two robots to pass each other. The routing problem sets the foundation for solving the sequencing and allocation problem. The best heuristic from the routing problem is used as the strategy for routing the robots in the sequencing and allocation problem. The routing heuristics used to test the framework in this dissertation include the return heuristic, the s-shape heuristic, the midpoint heuristic and the largest gap heuristic. The metaheuristic solution strategies for single objective part sequencing and allocating problem include the covariance matrix adaptation evolution strategy (CMA-ES) algorithm, the genetic algorithm (GA), the guaranteed convergence particle swarm optimisation (GCPSO) algorithm, and the self-adaptive differential evolution algorithm with neighbourhood search (SaNSDE). The evolutionary multi-objective algorithms considered in this dissertation are the non-dominated sorting genetic algorithm III (NSGA-III), the multi-objective evolutionary algorithm based on decomposition (MOEAD), the multiple objective particle swarm optimisation (MOPSO), and the multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES). Solving the robot routing problem showed that the return routing heuristic outperformed the s-shape, largest gap and midpoint heuristics with a significant margin. The return heuristic was thus used for solving the routing of robots in the part sequencing and allocation problem. The framework was able to create feasible real-world solutions for the part sequencing and allocation problem. The results from the single objective problem showed that the CMA-ES algorithm outperformed the other metaheuristics on the part sequencing and allocation problem. The second best performing metaheuristic was the SaNSDE. The GA was the third best metaheuristic and the worst performing metaheuristic was the GCPSO. The multi-objective framework was able to produce feasible trade-off solutions and MOPSO was shown to be the best EMO algorithm to use for accuracy. If a large spread and number of Pareto solutions are the most important concern, MOEAD should be used. The research contributions include the incorporation of collision avoidance in the robot routing problem when using single and multi-objective algorithms as solution strategies. This dissertation contributes to the research relating to the performance of metaheuristics and evolutionary multi-objective algorithms on routing, sequencing, and allocation problems. To the best of the author’s knowledge, this dissertation is the first where these four metaheuristics and evolutionary multi-objective algorithms have been tested for solving the robot picking and binning problem, given that all collisions must be avoided. It is also the first time that this specific variation of the part sequencing and allocation problem has been solved using metaheuristics and evolutionary multi-objective algorithms, taking into account that all collisions must be avoided.AFRIKAANSE OPSOMMING: Navorsing in verband met roete beplanning, part allokasie en botsing vermyding is belangrik vir die bevordering van die pakhuis automatisering veld. Die verhandeling handel oor die onderwerp van parte wat gestoor en gehaal moet word en die verkillende parte moet ook gealokeer word aan ’n spesifieke robot. Die doel van hierdie verhandeling is om ’n enkele doelwit en ’n multidoelwit algoritme raamwerk te ontwikkel wat parte in ’n volgorde rangskik en ook die parte aan ’n robot alokeer. Die roete wat die robot moet volg deur die pakhuis moet ook geoptimeer word om die minste tyd te verg. Die volgorde van die parte bepaal uiteindelik die totale tyd wat dit neem vir die robot om al die parte te stoor en te gaan haal. Die doelwitte van die algoritme raamwerk is om die totale reistyd en die totale ledige tyd te minimeer, gegewe die aantal beskikbare robotte in die sisteem om die stoor en gaan haal funksies uit te voer. Die algoritme raamwerk bevat botsingsvermyding, aangesien die gangbreedte van die pakhuis nie toelaat dat twee robotte mekaar kan verbygaan nie. Die roete probleem lˆe die grondslag vir die oplossing van die volgorde en allokerings probleem. Die beste heuristiek vir die roete probleem word verder gebruik in die volgorde en allokerings probleem. Die verskillende roete heuristieke wat in hierdie verhandeling oorweeg was, sluit in die terugkeer heuristiek, die s-vorm heuristiek, die middelpunt heuristiek en die grootste gaping heuristiek. Die metaheuristieke vir die volgorde en allokerings probleem sluit die volgende algoritmes in: die kovariansie matriks aanpassing evolusie algoritme (CMA-ES), die genetiese algoritme (GA), die gewaarborgde konvergerende deeltjie swermoptimerings (GCPSO) algoritme, en laastens die selfaanpassende differensi¨ele evolusie algoritme met die teenwoordigheid van buurtsoek (SaNSDE). Die evolusionêre multidoelwit algoritmes wat oorweeg was vir die volgorde en allokerings probleem sluit die volgende algoritmes in: die multidoelwit kovariansie matriks aanpassing evolusie algoritme (MO-CMA-ES), die nie-dominerende sortering genetiese algoritme III (NSGA-III), die multidoelwit evolusionˆere algoritme gebaseer op ontbinding (MOEAD) en laastens die multidoelwit deeltjie swermoptimering algoritme (MOPSO) Oplossings van die robot roete probleem het gewys dat die terugkeer heuristiek die s-vorm, grootste gaping en middelpunt heuristiek met ’n beduidende marge oortref het. Die terugkeer heuristiek is dus gebruik vir die oplossing van die roete beplanning van robotte in die volgorde en allokasie probleem. Die raamwerk was doeltreffend en die resultate het getoon, vir die enkel doelwit probleem, dat die CMA-ES algoritme beter gevaar het as die ander metaheuristieke vir die volgorde en allokasie probleem. Die SaNSDE was die naas beste presterende metaheuristiek. Die GA was die derde beste metaheuristiek, en die metaheuristiek wat die slegste gevaar het, was die GCPSO. Vir die multidoelwit probleem het die MOPSO die beste gevaar, as akkuraatheid die belangrikste doelwit is. As ’n grootter verskeidenheid die belangrikste is, is die MOEAD meer geskik om ’n oplossing te vind. Die navorsingsbydraes sluit in dat vermyding van botsings in ag geneem word in die robot roete probleem. Hierdie verhandeling dra by tot die navorsing oor die oplossing van roete beplanning, volgorde en allokasie probleme met metaheuristieke. Na die beste van die outeur se kennis is hierdie die eerste keer dat al vier metaheuristieke getoets was om die robot stoor-en-gaan haal probleem op te los, onder die kondisie dat alle botsings vermy moet word. Dit is ook die eerste keer dat hierdie spesifieke variant, enkel-en-multidoelwit probleem van die volgorde en allokasie van parte met behulp van metaheuristieke en multidoelwit evolusionˆere algoritmes opgelos was, met die inagneming dat alle botsings vermy moet word.Doctora

    Multi AGV Communication Failure Tolerant Industrial Supervisory System

    Get PDF
    Hoje em dia, em muitos ambientes industriais que utilizam vários robots, existe o problema de controlar o tráfego. Para se controlar o tráfego é preciso planear caminhos seguros, evitar os chamados deadlocks e estar imune a falhas de rede. O objetivo deste projeto consiste em implementar um sistema supervisor que controle esse tráfego, ou seja, seja capaz de detetar as falhas de rede, detetar desvios nas rotas dos robôs e replanear se necessário. O sistema de planeamento de trajetórias é o TEA*, um algoritmo A* mas que entra com a noção de tempo.The use of multi AGV implies an optimisation of traffic control. Several approaches focus on a trajectory planning method that guarantees an efficient and safe coordination of multi AGV. However, many fail to detect, treat and prevent the possible failure and delay in the communication between the AGV and the control platform. These faults can result in possible deadlock situations and collisions. In environments where communication faults are common, we might face a decrease of efficiency. Therefore, the aim of this project is to implement a supervisory system that controls the traffic of a fleet of AGV by being able to detect communication faults, delays in the communication, deviations in the routes of the robots and re-plan trajectories if necessary. For this purpose, the algorithm TEA*, an A* based algorithm (a graph search algorithm) with time notion, will be used to keep the efficiency and allow time optimisations

    Agent-based material transportation scheduling of AGV systems and its manufacturing applications

    Get PDF
    制度:新 ; 報告番号:甲3743号 ; 学位の種類:博士(工学) ; 授与年月日:2012/9/10 ; 早大学位記番号:新6114Waseda Universit

    Enhancing the performance of automated guided vehicles through reliability, operation and maintenance assessment

    Get PDF
    Automated guided vehicles (AGVs), a type of unmanned moving robots that move along fixed routes or are directed by laser navigation systems, are increasingly used in modern society to improve efficiency and lower the cost of production. A fleet of AGVs operate together to form a fully automatic transport system, which is known as an AGV system. To date, their added value in efficiency improvement and cost reduction has been sufficiently explored via conducting in-depth research on route optimisation, system layout configuration, and traffic control. However, their safe application has not received sufficient attention although the failure of AGVs may significantly impact the operation and efficiency of the entire system. This issue becomes more markable today particularly in the light of the fact that the size of AGV systems is becoming much larger and their operating environment is becoming more complex than ever before. This motivates the research into AGV reliability, availability and maintenance issues in this thesis, which aims to answer the following four fundamental questions: (1) How could AGVs fail? (2) How is the reliability of individual AGVs in the system assessed? (3) How does a failed AGV affect the operation of the other AGVs and the performance of the whole system? (4) How can an optimal maintenance strategy for AGV systems be achieved? In order to answer these questions, the method for identifying the critical subsystems and actions of AGVs is studied first in this thesis. Then based on the research results, mathematical models are developed in Python to simulate AGV systems and assess their performance in different scenarios. In the research of this thesis, Failure Mode, Effects and Criticality Analysis (FMECA) was adopted first to analyse the failure modes and effects of individual AGV subsystems. The interactions of these subsystems were studied via performing Fault Tree Analysis (FTA). Then, a mathematical model was developed to simulate the operation of a single AGV with the aid of Petri Nets (PNs). Since most existing AGV systems in modern industries and warehouses consist of multiple AGVs that operate synchronously to perform specific tasks, it is necessary to investigate the interactions between different AGVs in the same system. To facilitate the research of multi-AGV systems, the model of a three-AGV system with unidirectional paths was considered. In the model, an advanced concept PN, namely Coloured Petri Net (CPN), was creatively used to describe the movements of the AGVs. Attributing to the application of CPN, not only the movements of the AGVs but also the various operation and maintenance activities of the AGV systems (for example, item delivery, corrective maintenance, periodic maintenance, etc.) can be readily simulated. Such a unique technique provides us with an effective tool to investigate larger-scale AGV systems. To investigate the reliability, efficiency and maintenance of dynamic AGV systems which consist of multiple single-load and multi-load AGVs traveling along different bidirectional routes in different missions, an AGV system consisting of 9 stations was simulated using the CPN methods. Moreover, the automatic recycling of failed AGVs is studied as well in order to further reduce human participation in the operation of AGV systems. Finally, the simulation results were used to optimise the design, operation and maintenance of multi-AGV systems with the consideration of the throughputs and corresponding costs of them.The research reported in this thesis contributes to the design, reliability, operation, and maintenance of large-scale AGV systems in the modern and rapidly changing world.</div
    corecore