538 research outputs found

    Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

    Get PDF
    This paper concerns the coordination and the traffic management of a group of Automated Guided Vehicles (AGVs) moving in a real industrial scenario, such as an automated factory or warehouse. The proposed methodology is based on a three-layer control architecture, which is described as follows: 1) the Top Layer (or Topological Layer) allows to model the traffic of vehicles among the different areas of the environment; 2) the Middle Layer allows the path planner to compute a traffic sensitive path for each vehicle; 3) the Bottom Layer (or Roadmap Layer) defines the final routes to be followed by each vehicle and coordinates the AGVs over time. In the paper we describe the coordination strategy we propose, which is executed once the routes are computed and has the aim to prevent congestions, collisions and deadlocks. The coordination algorithm exploits a novel deadlock prevention approach based on time-expanded graphs. Moreover, the presented control architecture aims at grounding theoretical methods to an industrial application by facing the typical practical issues such as graphs difficulties (load/unload locations, weak connections,), a predefined roadmap (constrained by the plant layout), vehicles errors, dynamical obstacles, etc. In this paper we propose a flexible and robust methodology for multi-AGVs traffic-aware management. Moreover, we propose a coordination algorithm, which does not rely on ad hoc assumptions or rules, to prevent collisions and deadlocks and to deal with delays or vehicle motion errors. Note to Practitioners-This paper concerns the coordination and the traffic management of a group of Automated Guided Vehicles (AGVs) moving in a real industrial scenario, such as an automated factory or warehouse. The proposed methodology is based on a three-layer control architecture, which is described as follows: 1) the Top Layer (or Topological Layer) allows to model the traffic of vehicles among the different areas of the environment; 2) the Middle Layer allows the path planner to compute a traffic sensitive path for each vehicle; 3) the Bottom Layer (or Roadmap Layer) defines the final routes to be followed by each vehicle and coordinates the AGVs over time. In the paper we describe the coordination strategy we propose, which is executed once the routes are computed and has the aim to prevent congestions, collisions and deadlocks. The coordination algorithm exploits a novel deadlock prevention approach based on time-expanded graphs. Moreover, the presented control architecture aims at grounding theoretical methods to an industrial application by facing the typical practical issues such as graphs difficulties (load/unload locations, weak connections, ), a predefined roadmap (constrained by the plant layout), vehicles errors, dynamical obstacles, etc. In this paper we propose a flexible and robust methodology for multi-AGVs traffic-aware management. Moreover, we propose a coordination algorithm, which does not rely on ad hoc assumptions or rules, to prevent collisions and deadlocks and to deal with delays or vehicle motion errors

    Design choices for agent-based control of AGVs in the dough making process

    Get PDF
    In this paper we consider a multi-agent system (MAS) for the logistics control of Automatic Guided Vehicles (AGVs) that are used in the dough making process at an industrial bakery. Here, logistics control refers to constructing robust schedules for all transportation jobs. The paper discusses how alternative MAS designs can be developed and compared using cost, frequency of messages between agents, and computation time for evaluating control rules as performance indicators. Qualitative design guidelines turn out to be insufficient to select the best agent architecture. Therefore, we also use simulation to support decision making, where we use real-life data from the bakery to evaluate several alternative designs. We find that architectures in which line agents initiate allocation of transportation jobs, and AGV agents schedule multiple jobs in advance, perform best. We conclude by discussing the benefits of our MAS systems design approach for real-life applications

    Interacting with a multi AGV system

    Get PDF
    This paper introduces a novel Human Machine Interface (HMI) that allows users to interact with a fleet of Automated Guided Vehicles (AGVs) used for logistics operations in industrial environments. The interface is developed for providing operators with information regarding the fleet of AGVs, and the status of the industrial environment. Information is provided in an intuitive manner, utilizing a three-dimensional representation of the elements in the environment. The HMI also allows operators to influence the behavior of the fleet of AGVs, manually inserting missions to be accomplished

    Platooning-based control techniques in transportation and logistic

    Get PDF
    This thesis explores the integration of autonomous vehicle technology with smart manufacturing systems. At first, essential control methods for autonomous vehicles, including Linear Matrix Inequalities (LMIs), Linear Quadratic Regulation (LQR)/Linear Quadratic Tracking (LQT), PID controllers, and dynamic control logic via flowcharts, are examined. These techniques are adapted for platooning to enhance coordination, safety, and efficiency within vehicle fleets, and various scenarios are analyzed to confirm their effectiveness in achieving predetermined performance goals such as inter-vehicle distance and fuel consumption. A first approach on simplified hardware, yet realistic to model the vehicle's behavior, is treated to further prove the theoretical results. Subsequently, performance improvement in smart manufacturing systems (SMS) is treated. The focus is placed on offline and online scheduling techniques exploiting Mixed Integer Linear Programming (MILP) to model the shop floor and Model Predictive Control (MPC) to adapt scheduling to unforeseen events, in order to understand how optimization algorithms and decision-making frameworks can transform resource allocation and production processes, ultimately improving manufacturing efficiency. In the final part of the work, platooning techniques are employed within SMS. Autonomous Guided Vehicles (AGVs) are reimagined as autonomous vehicles, grouping them within platoon formations according to different criteria, and controlled to avoid collisions while carrying out production orders. This strategic integration applies platooning principles to transform AGV logistics within the SMS. The impact of AGV platooning on key performance metrics, such as makespan, is devised, providing insights into optimizing manufacturing processes. Throughout this work, various research fields are examined, with intersecting future technologies from precise control in autonomous vehicles to the coordination of manufacturing resources. This thesis provides a comprehensive view of how optimization and automation can reshape efficiency and productivity not only in the domain of autonomous vehicles but also in manufacturing

    Performance optimisation of mobile robots in dynamic environments

    Get PDF
    This paper presents a robotic simulation system, that combines task allocation and motion planning of multiple mobile robots, for performance optimisation in dynamic environments. While task allocation assigns jobs to robots, motion planning generates routes for robots to execute the assigned jobs. Task allocation and motion planning together play a pivotal role in optimisation of robot team performance. These two issues become more challenging when there are often operational uncertainties in dynamic environments. We address these issues by proposing an auction-based closed-loop module for task allocation and a bio-inspired intelligent module for motion planning to optimise robot team performance in dynamic environments. The task allocation module is characterised by a closed-loop bid adjustment mechanism to improve the bid accuracy even in light of stochastic disturbances. The motion planning module is bio-inspired intelligent in that it features detection of imminent neighbours and responsiveness of virtual force navigation in dynamic traffic conditions. Simulations show that the proposed system is a practical tool to optimise the operations by a team of robots in dynamic environments. © 2012 IEEE.published_or_final_versionThe IEEE International Conference on Virtual Environments Human-Computer Interfaces and Measurement Systems (VECIMS 2012), Tianjin, China, 2-4 July 2012. In Proceedings of IEEE VECIMS, 2012, p. 54-5

    An auction-based approach with closed-loop bid adjustment to dynamic task allocation in robot teams

    Get PDF
    Dynamic task allocation is among the most difficult issues in multi-robot coordination, although it is imperative for a multitude of applications. Auction-based approaches are popular methods that allocate tasks to robots by assembling team information at a single location to make practicable decisions. However, a main deficiency of auction-based methods is that robots generally do not have sufficient information to estimate reliable bids to perform tasks, particularly in dynamic environments. While some techniques have been developed to improve bidding, they are mostly open-looped without feed-back adjustments to tune the bid prices for subsequent tasks of the same type. Robots' bids, if not assessed and adjusted accordingly, may not be trustworthy and would indeed impede team performance. To address this issue, we propose a closed-loop bid adjustment mechanism for auction-based multi-robot task allocation, with an aim to evaluate and improve robots' bids, and hence enhance the overall team performance. Each robot in a team maintains and uses its own track record as closed-loop feedback information to adjust and improve its bid prices. After a robot has completed a task, it assesses and records its performance to reflect the discrepancy between the bid price and the actual cost of the task. Such performance records, with time-discounting factors, are taken into account to damp out fluctuations of bid prices. Adopting this adjustment mechanism, a task would be more likely allocated to a competent robot that submits a more accurate bid price, and hence improve the overall team performance. Simulation of task allocation of free-range automated guided vehicles serving at a container terminal is presented to demonstrate the effectiveness of the adjustment mechanism.postprintThe World Congress on Engineering (WCE 2011), London, U.K., 6-8 July 2011. In Proceedings of WCE, 2011, v. 2, p. 1061-106

    Energy and Route Optimization of Moving Devices

    Get PDF
    This thesis highlights our efforts in energy and route optimization of moving devices. We have focused on three categories of such devices; industrial robots in a multi-robot environment, generic vehicles in a vehicle routing problem (VRP) context, automatedguided vehicles (AGVs) in a large-scale flexible manufacturing system (FMS). In the first category, the aim is to develop a non-intrusive energy optimization technique, based on a given set of paths and sequences of operations, such that the original cycle time is not exceeded. We develop an optimization procedure based on a mathematical programming model that aims to minimize the energy consumption and peak power. Our technique has several advantages. It is non-intrusive, i.e. it requires limited changes in the robot program and can be implemented easily. Moreover,it is model-free, in the sense that no particular, and perhaps secret, parameter or dynamic model is required. Furthermore, the optimization can be done offline, within seconds using a generic solver. Through careful experiments, we have shown that it is possible to reduce energy and peak-power up to about 30% and 50% respectively. The second category of moving devices comprises of generic vehicles in a VRP context. We have developed a hybrid optimization approach that integrates a distributed algorithm based on a gossip protocol with a column generation (CG) algorithm, which manages to solve the tested problems faster than the CG algorithm alone. The algorithm is developed for a VRP variation including time windows (VRPTW), which is meant to model the task of scheduling and routing of caregivers in the context of home healthcare routing and scheduling problems (HHRSPs). Moreover,the developed algorithm can easily be parallelized to further increase its efficiency. The last category deals with AGVs. The choice of AGVs was not arbitrary; by design, we decided to transfer our knowledge of energy optimization and routing algorithms to a class of moving devices in which both techniques are of interest. Initially, we improve an existing method of conflict-free AGV scheduling and routing, such that the new algorithm can manage larger problems. A heuristic version of the algorithm manages to solve the problem instances in a reasonable amount of time. Later, we develop strategies to reduce the energy consumption. The study is carried out using an AGV system installed at Volvo Cars. The results are promising; (1)the algorithm reduces performance measures such as makespan up to 50%, while reducing the total travelled distance of the vehicles about 14%, leading to an energy saving of roughly 14%, compared to the results obtained from the original traffic controller. (2) It is possible to reduce the cruise velocities such that more energy is saved, up to 20%, while the new makespan remains better than the original one
    corecore