multi-AGV Systems Research Articles

Research on path planning of locally added path factor dijkstra algorithm for multiple AGV systems

Aiming at the problem of relative encounter path conflict in multi-AGV systems under special working conditions, a path planning method is proposed to limit the running direction of AGV by adding path factor to Dijkstra algorithm. This method can realize simple traffic rule formulation. Effectively reduce the conflict of opposite encounter paths and achieve the purpose of orderly operation of multiple AGVs.

Novel methodology for optimising the design, operation and maintenance of a multi-AGV system

Automated guided vehicles (AGVs) have long been identified as a potential driver to improve system efficiency and lower labour costs in material handling systems. Accordingly, the reliability and availability of AGV systems is crucial to assure the stability and efficiency of these systems. However, the reliability issues and maintenance strategies of AGVs have not previously been studied sufficiently. This is even more marked in the case of multi-AGV systems that consist of fleets of AGVs. To fill this knowledge gap, research is conducted considering a multi-AGV system, consisting of three AGVs, in order to develop a scientific methodology for optimising the layout design, operation and maintenance of a multi-AGV system. Once an AGV is failed, it will be towed to the maintenance site for repair by a recycle vehicle to prevent deadlock and conflict. The efficiency of the recycling process of failed AGVs in a multi-AGV system, with respect to the change of location of the maintenance site, is analysed by the approach of coloured Petri nets (CPNs). A CPN model simulating the corrective and periodic preventive maintenance processes of failed AGVs is also developed in order to investigate the impact of different AGV maintenance strategies on the operation efficiency of the multi-AGV system. The simulation results obtained clearly show that the location of maintenance sites and maintenance strategies do have significant influence on the performance of a multi-AGV system, where corrective maintenance is an effective measure to maintain the long-term reliability and stability of the system.

Cooperative cloud robotics architecture for the coordination of multi-AGV systems in industrial warehouses

In this paper we introduce a novel cloud robotics architecture that provides different functionalities to support enhanced coordination of groups of Automated Guided Vehicles (AGVs) used for industrial logistics. In particular, we define a cooperative data fusion system that, gathering data from different sensing sources, provides a constantly updated global live view of the industrial environment, for coordinating the motion of the AGVs in an optimized manner. In fact, local sensing capabilities are complemented with global information, thus extending the field of view of each AGV. This knowledge extension allows to support a cooperative and flexible global route assignment and local path planning in order to avoid congestion zones, obstacles reported in the global live view map and deal with unexpected obstacles in the current path. The proposed methodology is validated in a real industrial environment, allowing an AGV to safely perform an obstacle avoidance procedure.

Path Planning for Multi-AGV Systems based on Two-Stage Scheduling

Path Planning for Multi-AGV Systems based on Two-Stage Scheduling

Decentralized Control of Multi-AGV Systems in Autonomous Warehousing Applications

In this paper, we present an algorithm for decentralized control of multiple automated guided vehicles performing transportation tasks within industrial and warehousing environments. By running on each vehicle in the system, the algorithm provides vehicles with capabilities for autonomous path planning and motion co-ordination. The path planning part of the algorithm implements a free-ranging motion scheme by determining the shortest feasible paths considering nonholonomic vehicle constraints. The motion co-ordination part of the algorithm ensures safe vehicle motions by reliable detection and resolution of different conflict situations with other vehicles in the shared workspace. Conflict resolution is based on a vehicle priority scheme and results in temporary stopping or removal of the lower priority vehicles taking part in the conflict. Removal action is always performed within the vehicle’s private zone , i.e., the preallocated local region of the workspace surrounding the vehicle. By encoding information on the vehicle size and its kinematic constraints, the introduced private zone mechanism provides the necessary physical space required for successful execution of every removal action. We also analyze the stability of the presented algorithm and discuss its deadlock-free and livelock-free properties. Algorithm performance has been validated by simulation using ten vehicles and experimentally on two different setups—a laboratory setup comprising five Pioneer 3DX vehicles and by two state-of-the-art autonomous forklifts in industrial-like operating conditions.

Ensemble Coordination Approach in Multi-AGV Systems Applied to Industrial Warehouses

This paper deals with a holistic approach to coordinate a fleet of automated guided vehicles (AGVs) in an industrial environment. We propose an ensemble approach based on a two layer control architecture and on an automatic algorithm for the definition of the roadmap. The roadmap is built by considering the path planning algorithm implemented on the hierarchical architecture and vice versa. In this way, we want to manage the coordination of the whole system in order to increase the flexibility and the global efficiency. Furthermore, the roadmap is computed in order to maximize the redundancy, the coverage and the connectivity. The architecture is composed of two layers. The low-level represents the roadmap itself. The high-level describes the topological relationship among different areas of the environment. The path planning algorithm works on both these levels and the subsequent coordination among AGVs is obtained exploiting shared resource (i.e., centralized information) and local negotiation (i.e., decentralized coordination). The proposed approach is validated by means of simulations and comparison using real plants.

Time Windows Based Dynamic Routing in Multi-AGV Systems

This paper presents a dynamic routing method for supervisory control of multiple automated guided vehicles (AGVs) that are traveling within a layout of a given warehouse. In dynamic routing a calculated path particularly depends on the number of currently active AGVs' missions and their priorities. In order to solve the shortest path problem dynamically, the proposed routing method uses time windows in a vector form. For each mission requested by the supervisor, predefined candidate paths are checked if they are feasible. The feasibility of a particular path is evaluated by insertion of appropriate time windows and by performing the windows overlapping tests. The use of time windows makes the algorithm apt for other scheduling and routing problems. Presented simulation results demonstrate efficiency of the proposed dynamic routing. The proposed method has been successfully implemented in the industrial environment in a form of a multiple AGV control system.