Search

To improve the operational efficiency of automated container terminals and the coordination between multiple operations, this article studies the integrated scheduling optimization problem of automated guided vehicles (AGVs) and yard cranes. The impact of charging constraints on AGV task allocation and scheduling is considered. With the goal of minimizing the maximum completion time of all tasks, a mixed integer programming model is proposed. A solution method based on a dynamic programming algorithm is designed, where a heuristic algorithm is used to assign tasks to the yard cranes, and the dynamic programming method is used to assign tasks to the AGVs based on the task assignment results of the yard cranes. Finally, the validity of the model and algorithm is tested by numerical experiments. Furthermore, the influence of the quantity of AGVs on the terminal operational efficiency and the impact of AGV charging strategies on AGV scheduling are analysed. [ABSTRACT FROM AUTHOR]

To address the problems of weak search ability, easily falling into local optimal solutions and poor path quality of sparrow search algorithm in AGV path planning, a multi-strategy improved sparrow search algorithm (MISSA) is proposed in this paper. MISSA improves the global search ability by improving the discoverer position update operator and introducing the sine cosine algorithm; adopts the adaptive number of vigilantes and adaptive adjustment step size to improve the convergence speed; introduces the Levy flight variation strategy to reduce the probability of falling into any local optimal solution; optimizes the boundary handling mechanism to prevent the loss of population diversity at a later stage; finally, uses the large-scale neighborhood search strategy and path smoothing mechanism for path optimization to further improve the path quality. The superiority-seeking ability of MISSA was verified by 12 standard test functions, and then 30 simulation experiments were conducted in grid maps with two specifications of 20×20 and 30×30. The experimental results showed that, by using MISSA, the path length was reduced by 44.1% and 63.1%, the number of turns was reduced by 68.4% and 78.4%, and the risk degree was reduced by 61.3% and 77.2%, which verifies the superiority of MISSA in path planning. Finally, MISSA was ported to the QBot2e mobile robot for physical verification to prove its feasibility in practical applications. [ABSTRACT FROM AUTHOR]

This article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly consider the shortest path while ignoring vehicle turning time and stability. We propose a secondary path-planning method based on an improved directed weighted graph theory integrated with an ROS. Firstly, the production environment is modeled in detail to identify the initial position of the AGV. Secondly, the operational area is systematically divided, key nodes are selected and optimized, and a directed weighted graph is constructed with optimized weights. It is integrated with the ROS for path planning, using the Floyd algorithm to find the optimal path. The effectiveness and superiority of this method have been demonstrated through simulation verification and actual AGV operation testing. The path planning strategy and fusion algorithm proposed in this article that comprehensively considers distance and angle steering are simple and practical, effectively reducing production costs for enterprises. This method is suitable for logistics sorting and small transport AGVs with a shorter overall path-planning time, higher stability, and limited computing power, and it has reference significance and practical value. [ABSTRACT FROM AUTHOR]

Copyright of Cotton Textile Technology is the property of Cotton Textile Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Automated Guided Vehicles (AGVs) have played an important role in modern factories or warehouses, replacing traditional conveyor-based sorting systems due to their flexibility and scalability. However, existing works on AGV sorting systems primarily focus on improving performance from mechanical perspectives or network optimization for routing design. There is a lack of discussion on how to provide a holistic assignment strategy that considers not only the assignment at the sorting area but also the impact of traffic flow from upstream stations in the system. This study introduces a novel two-stage optimization model for AGV sorting systems in central fill pharmacies, implemented via discrete-event simulation and a simulation-based heuristic algorithm. The methodology is based on a detailed analysis of the sorting system layout, assessing performance through key performance indicators (KPIs) such as throughput, utilization, and cycle time, complemented by a sensitivity analysis regarding the number of AGVs. Operational implications include improved assignment strategies that enhance overall system efficiency, reduced cycle time, and optimized resource utilization. Results demonstrate broad applicability across different automated systems, suggesting significant implications for operational efficiency. [ABSTRACT FROM AUTHOR]

As an important part of urban terminal delivery, automated guided vehicles (AGVs) have been widely used in the field of takeout delivery. Due to the real-time generation of takeout orders, the delivery system is required to be extremely dynamic, so the AGV needs to be dynamically scheduled. At the same time, the uncertainty in the delivery process (such as the meal preparation time) further increases the complexity and difficulty of AGV scheduling. Considering the influence of these two factors, the method of embedding a stochastic programming model into a rolling mechanism is adopted to optimize the AGV delivery routing. Specifically, to handle real-time orders under dynamic demand, an optimization mechanism based on a rolling scheduling framework is proposed, which allows the AGV's route to be continuously updated. Unlike most VRP models, an open chain structure is used to describe the dynamic delivery path of AGVs. In order to deal with the impact of uncertain meal preparation time on route planning, a stochastic programming model is formulated with the purpose of minimizing the expected order timeout rate and the total customer waiting time. In addition, an effective path merging strategy and after-effects strategy are also considered in the model. In order to solve the proposed mathematical programming model, a multi-objective optimization algorithm based on a NSGA-III framework is developed. Finally, a series of experimental results demonstrate the effectiveness and superiority of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

With the rapid development of the economy and the continuous improvement of people's living standards, the printing and packaging industry plays an increasingly important role in people's lives. The traditional printing industry is a discrete manufacturing industry, relying on a large amount of manpower and manual operation, low production efficiency, higher labor costs, wasting of resources, and other issues, so the realization of printing factory intelligence to improve the competitiveness of the industry is an important initiative. Automatic guided vehicles (AGVs) are an important part of an intelligent factory, serving the function of automatic transportation of materials and products. To optimize the movement paths of AGVs, enhance safety, and improve transportation efficiency and productivity, this paper proposes an alternative implementation of the A* algorithm. The proposed algorithm improves search efficiency and path smoothness by incorporating the grid obstacle rate and enhancing the heuristic function within the A* algorithm's evaluation function. This introduces the evaluation subfunction of the nearest distance between the AGV, the known obstacle, and the unknown obstacle in the global path in the dynamic window approach (DWA algorithm), and reduces the interference of obstacles with the AGV in global path planning. Finally, the two improved algorithms are combined into a new fusion algorithm. The experimental results show that the search efficiency of the fusion algorithm significantly improved and the transportation time shortened. The path smoothness significantly improved, and the closest distance to obstacles increased, reducing the risk of collision. It can thus effectively improve the productivity of an intelligent printing factory and enhance its flexibility. [ABSTRACT FROM AUTHOR]

In response to the issues of low solution efficiency, poor path planning quality, and limited search completeness in narrow passage environments associated with Rapidly-exploring Random Tree (RRT), this paper proposes a Grid-based Variable Probability Rapidly-exploring Random Tree algorithm (GVP-RRT) for narrow passages. The algorithm introduced in this paper preprocesses the map through gridization to extract features of different path regions. Subsequently, it employs random growth with variable probability density based on the features of path regions using various strategies based on grid, probability, and guidance to enhance the probability of growth in narrow passages, thereby improving the completeness of the algorithm. Finally, the planned route is subjected to path re-optimization based on the triangle inequality principle. The simulation results demonstrate that the planning success rate of GVP-RRT in complex narrow channels is increased by 11.5–69.5% compared with other comparative algorithms, the average planning time is reduced by more than 50%, and the GVP-RRT has a shorter average planning path length. [ABSTRACT FROM AUTHOR]

Abstract In response to the issues of low solution efficiency, poor path planning quality, and limited search completeness in narrow passage environments associated with Rapidly-exploring Random Tree (RRT), this paper proposes a Grid-based Variable Probability Rapidly-exploring Random Tree algorithm (GVP-RRT) for narrow passages. The algorithm introduced in this paper preprocesses the map through gridization to extract features of different path regions. Subsequently, it employs random growth with variable probability density based on the features of path regions using various strategies based on grid, probability, and guidance to enhance the probability of growth in narrow passages, thereby improving the completeness of the algorithm. Finally, the planned route is subjected to path re-optimization based on the triangle inequality principle. The simulation results demonstrate that the planning success rate of GVP-RRT in complex narrow channels is increased by 11.5–69.5% compared with other comparative algorithms, the average planning time is reduced by more than 50%, and the GVP-RRT has a shorter average planning path length.

Copyright of Automobile Technology & Material is the property of Automobile Technology & Material Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper investigates the filtering techniques to enhance the accuracy of indoor localization for Autonomous Guided Vehicles (AGVs) using Ultra-Wideband (UWB) technology. A comprehensive comparative analysis of various filtering approaches, including the Kalman Filter (KF), Moving Average Filter (MA), Savitzky-Golay Filter (SG), Weighted Average Filter (WAF), and their combinations, are conducted. The primary focus of this paper is the integration of a Moving Average-Kalman Filter (MAKF) with an extended window size of 201. Experimental findings reveal significant performance differences among these filtering techniques. The most effective approach is the MAKF technique, achieving an accuracy of 85.13% and the lowest path deviation of 0.17 meters. Conversely, the MA exhibits the lowest accuracy at 68.83%. Notably, the WAF attains an accuracy of 72.46% but exhibits a significantly higher path deviation of 2.65 meters compared to 1.45 meters of the MA filtering technique. The proposed MAKF acknowledged for its ability to effectively reduce noise with real-time responsiveness, represents a significant advancement in AGV indoor localization techniques. [ABSTRACT FROM AUTHOR]

In view of the path planning and navigation problem when the AGV forklift is in the situation of unknown environment information or dynamic change of environment, a method is proposed to obtain the target position by YOLOv5(You Only Look Once version 5) target detection algorithm. The global basic path is planned according to the target location, and the method of AGV path planning and navigation is integrated with DWA(Dynamic Window Approach) local dynamic path planning algorithm, so that the AGV forklift can quickly identify the target location and complete the path planning to reach the target location in the unknown environment or the environment with unknown local environment information. The experimental results show that compared with the previous method, the proposed method has good performance in terms of path length, time consumption and heading error of AGV forklift truck. The average path length is reduced by 12%, the average time consumption is reduced by about 5%, and the average error between the AGV heading and the target heading is within 5°. The proposed method can improve the working efficiency and flexibility of AGV forklift in unknown environment. [ABSTRACT FROM AUTHOR]

Copyright of Cotton Textile Technology is the property of Cotton Textile Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Saving energy and resources has become increasingly important for industrial applications. Foremost, this requires knowledge about the energy requirement. For this purpose, this paper presents a state-based energy requirement model for mobile robots, e.g., automated guided vehicles or autonomous mobile robots, that determines the energy requirement by integrating the linearized power requirement parameters within each system state of the vehicle. The model and their respective system states were verified using a qualitative process analysis of 25 mobile robots from different manufacturers and validated by comparing simulated data with experimental data. For this purpose, power consumption measurements over 461 operating hours were performed in experiments with two different industrial mobile robots. System components of a mobile robot, which require energy, were classified and their power consumptions were measured individually. The parameters in the study consist of vehicle speed, load-handling duration, load, utilization, material flow and layout data, and charging infrastructure system frequency, yet these varied throughout the experiments. Validation of the model through real experiments shows that, in a 99 % confidence interval, the relative deviation in the modeled power requirement for a small-scale vehicle is [ − 1.86 % , − 1.14 % ] , whereas, for a mid-scale vehicle, it is [ − 0.73 % , − 0.31 % ] . This sets a benchmark for modeling the energy requirement of mobile robots with multiple influencing factors, allowing for an accurate estimation of the energy requirement of mobile robots. [ABSTRACT FROM AUTHOR]

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Abstract This paper presents a fusion algorithm based on the enhanced RRT* TEB algorithm. The enhanced RRT* algorithm is utilized for generating an optimal global path. Firstly, proposing an adaptive sampling function and extending node bias to accelerate global path generation and mitigate local optimality. Secondly, eliminating path redundancy to minimize path length. Thirdly, imposing constraints on the turning angle of the path to enhance path smoothness. Conducting kinematic modeling of the mobile robot and optimizing the TEB algorithm to align the trajectory with the mobile robot's kinematics. The integration of these two algorithms culminates in the development of a fusion algorithm. Simulation and experimental results demonstrate that, in contrast to the traditional RRT* algorithm, the enhanced RRT* algorithm achieves a 5.8% reduction in path length and a 62.5% decrease in the number of turning points. Utilizing the fusion algorithm for path planning, the mobile robot generates a superior, seamlessly smooth global path, adept at circumventing obstacles. Furthermore, the local trajectory meticulously conforms to the kinematic constraints of the mobile robot.

Copyright of Machine Tool & Hydraulics is the property of Guangzhou Mechanical Engineering Research Institute (GMERI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper presents a fusion algorithm based on the enhanced RRT* TEB algorithm. The enhanced RRT* algorithm is utilized for generating an optimal global path. Firstly, proposing an adaptive sampling function and extending node bias to accelerate global path generation and mitigate local optimality. Secondly, eliminating path redundancy to minimize path length. Thirdly, imposing constraints on the turning angle of the path to enhance path smoothness. Conducting kinematic modeling of the mobile robot and optimizing the TEB algorithm to align the trajectory with the mobile robot's kinematics. The integration of these two algorithms culminates in the development of a fusion algorithm. Simulation and experimental results demonstrate that, in contrast to the traditional RRT* algorithm, the enhanced RRT* algorithm achieves a 5.8% reduction in path length and a 62.5% decrease in the number of turning points. Utilizing the fusion algorithm for path planning, the mobile robot generates a superior, seamlessly smooth global path, adept at circumventing obstacles. Furthermore, the local trajectory meticulously conforms to the kinematic constraints of the mobile robot. [ABSTRACT FROM AUTHOR]

Dispatching, receiving, and transporting goods involve a large amount of manual effort. Within a logistics supply chain, a wide variety of transported goods need to be handled, recognized, and checked at many different points. Effective planning of automated guided vehicle (AGV) transportation can reduce equipment energy consumption and shorten task completion time. As the need for efficient warehouse logistics has increased in manufacturing systems, the use of AGVs has also increased to reduce working time. These processes hold automation potential, which we can exploit by using computer vision techniques. We propose a method for the complete automation of box recognition, covering both the types and quantities of boxes. To do this, an ELAN and GhostConv-based YOLO network (EGCY-Net) is proposed with a Conv-GhostConv Stack (CGStack) module and an ELAN-GhostConv Network (EGCNet). To enhance inter-channel relationships, the CGStack module captures complex patterns and information in the image by using ghost convolution to increase the model inference speed while retaining the ability to capture spatial features. EGCNet is designed and constructed based on ELAN and the CGStack module to capture and utilize hierarchical features efficiently in layer aggregation. Additionally, the proposed methodology involves the creation of a dataset comprising images of boxes taken in warehouse settings. The proposed system is realized on the NVIDIA Jetson Nano platform, using an Arducam IMX477 camera. To evaluate the proposed model, we conducted experiments with our own dataset and compared the results with some state-of-the-art (SOTA) models. The proposed network achieved the highest detection accuracy with the fewest parameters compared to other SOTA models. [ABSTRACT FROM AUTHOR]

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Autonomous routing through curved path for point-to-point mobile robot is a well-established challenging problem in the area of intelligent path navigation. Point-to-point collision-free locomotion of AGV (Automated Guided Vehicle) requires precise differentiation of movable path from other environmental visual noise. As these path navigating depend on various visual cues and precepts, naturally the semantic meaning of path in contrast to other closely available objects on the visual window requires significant amount of understanding of the input from precepts. In this paper, it is experimentally established that semantic segmentation has proved to be a concise method in making comparative better segregation of paths from midway structured obstacles that are with high computational cost. The claims are also evident from surveyed works. The challenge of reducing high computational performance with efficient segmentation of movable area has been addressed in this research work with a focus on deriving better filtered accessible paths with a degree of algorithmic confidence. Further, this segmented result is taken for curved trajectory tracking by the AGV. A systematic percept mediated deep based Semantic-region Aware Model Predictive Trajectory Tracking(SAMP-TT)Algorithm has been proposed to solve the problem of precise obstacle detection on curved path trajectories. RGB (Red, Green Blue) image of outdoor multi-sectioned area has been collected by Intel Realsense D455 which worked as input feed to the respective neural network models. The performance of the proposed technique has been benchmarked with existing segmentation models including ENET (Efficient Neural Network), U-NET to confirm the considerable reliability and accuracy of the presented algorithm. It has been followed by the state-of-art comparative visual result analysis of different taken models with the proposed architecture. [ABSTRACT FROM AUTHOR]

This study aims to identify the non-value-adding activities during vehicle stowage operations in automobile terminals and propose a connected automated vehicle (CAV) loading system, a self-driving-car-loading system. Furthermore, the productivity of the CAV loading system is compared with the current loading system. A simulation model of an actual loading system was developed using the software FlexSim. The simulation results showed that the walking time of workers, operation time of shuttle vans, and waiting time occupied a large part of the cycle time in the current operation system. The proposed CAV loading system has eliminated these inefficiencies, and increased productivity by 26.78%. This is the first study to (1) present a self-driving-car-loading system in a simulated automobile terminal of a real-world size, and (2) propose a CAV loading system. Results provide useful insights for the integration of self-driving technology into future automobile port operations. [ABSTRACT FROM AUTHOR]

Route planning for automated guided vehicles (AGVs) is one of the key factors that affects work efficiency of automated storage and retrieval systems (AS/RSes). Route planning plays an important role in the operation of AGVs. Since the characteristic of AS/RSes is chessboard-like, the environment is more complex than traditional route planning environments because the number of nodes is large, more than one shortest route exists between two nodes, and the routes with the shortest distance may not be the most energy-saving routes. Although the traditional route planning algorithms such as the classical Q-learning algorithm can work well in AGV route planning, it also has some limitations. This paper proposes a novel multi-AGV route planning approach to solving the AGV route planning problem in the chessboard-like warehouse, which can improve the route planning efficiency greatly. First, by combining adjacency matrix and reward matrix, we propose a low-dimensional adjacency-reward matrix for route planning. This algorithm improves the efficiency of classical Q-learning algorithms and accelerates dynamic route planning significantly. We further improve the algorithm by considering the travel directions to minimize the number of turns in the route and additionally by considering whether the AGV is loaded or not and plan routes accordingly. Finally, we propose a multi-AGV online collision-free route planning algorithm based on these considerations for dynamic route planning for multi-AGVs operating in a large-scale warehouse. The proposed algorithms are validated with several case studies. [ABSTRACT FROM AUTHOR]

This article introduces passive wheels as the new localization system for automated guided vehicles (AGVs). The article focuses on investigating the accuracy of the proposed system and comparing with other widely used solutions: rotary encoders coupled with drive wheels, AHRS and LiDAR scanner. The fusion of dead reckoning and inertial data is acquired by the implementation of the Kalman filter. On the other hand, the fusion of LiDAR data depends on application of the AMCL or the graph-based algorithm. The study was conducted on five different scenarios, designed to investigate the influence of specific types of movements on the performance of tested localization methods. Results indicate, that passive wheels dead reckoning outperforms drive wheels dead reckoning in most scenarios, minimizing errors due to reduced both longitudal and lateral slippages, which appear during AGV accelerating, decelerating and turning. AHRS integration improves accuracy, especially in scenarios involving significant amount of angular motion. LiDAR-based methods in short term show mediocre results, due to relatively high, but steady values of error. The study highlights the importance of the map's quality for LiDAR-based techniques and points up the conditions, under which the LiDAR-based techniques do not operate very well. In conclusion, the research provides insights into the strengths and weaknesses of various AGV localization techniques in various movement scenarios, emphasizing the impact of sensor choice and path-shape conditions on accuracy.

In this study, a robust $H_\infty$ observer-based PID path tracking control strategy is proposed for Autonomous Ground Vehicle (AGV) to efficiently attenuate the effect of external disturbance, actuator/sensor fault signals, and control saturation to achieve the robust path tracking design. To simplify the design procedure, a novel path reference-based feedforward linearization scheme is proposed to transform nonlinear dynamic AGV system to an equivalent linear tracking error system with nonlinear actuator signal. To protect the AGV system from the corruption of actuator/sensor fault signals, two smoothed signal models are introduced to precisely estimate these fault signals to compensate their corruption. Further, the proposed $H_\infty$ fault-tolerant observer-based PID path tracking control strategy of AGV system can be transformed to an equivalent bilinear matrix inequality (BMI). Consequently, by the proposed two-step method, the complex BMI can be transformed into two linear matrix inequalities (LMIs), which can be easily solved via LMI TOOLBOX in MATLAB. Therefore, control restriction is also considered to meet the constraints of physical actuator saturation on PID controller, making the proposed control scheme more applicable. Finally, the triple-lane change task of AGV is simulated as a numerical example to illustrate the design procedure and to validate the performance of proposed design method.

This article proposes an improved A* algorithm aimed at improving the logistics path quality of automated guided vehicles (AGVs) in digital production workshops, solving the problems of excessive path turns and long transportation time. The traditional A* algorithm is improved internally and externally. In the internal improvement process, we propose an improved node search method within the A* algorithm to avoid generating invalid paths; offer a heuristic function which uses diagonal distance instead of traditional heuristic functions to reduce the number of turns in the path; and add turning weights in the A* algorithm formula, further reducing the number of turns in the path and reducing the number of node searches. In the process of external improvement, the output path of the internally improved A* algorithm is further optimized externally by the improved forward search optimization algorithm and the Bessel curve method, which reduces path length and turns and creates a path with fewer turns and a shorter distance. The experimental results demonstrate that the internally modified A* algorithm suggested in this research performs better when compared to six conventional path planning methods. Based on the internally improved A* algorithm path, the full improved A* algorithm reduces the turning angle by approximately 69% and shortens the path by approximately 10%; based on the simulation results, the improved A* algorithm in this paper can reduce the running time of AGV and improve the logistics efficiency in the workshop. Specifically, the walking time of AGV on the improved A* algorithm path is reduced by 12s compared to the traditional A* algorithm.

Automated guided vehicle (AGV) smart parking provides a new solution to solve the problem of urban parking difficulties. In the AGV parking lot, whether the AGV running path is reasonable affects the transportation efficiency of the entire parking lot. RRT algorithm and ant colony algorithm can achieve good path planning effect for AGV. However, the use of uniformly distributed initial pheromones can easily lead to blind search and local optimization in the early stage of the algorithm, resulting in a decrease in AGV efficiency. In this paper, an AGV based on the fast-scaling random tree-ant colony algorithm (RRT*-ACO) is proposed. The path planning method uses the fast search mechanism of RRT* algorithm and the positive feedback advantage of ant colony algorithm to combine the two algorithms and add them to the RRT* algorithm. The two-way search, heuristic dynamic sampling and dynamic step size strategies are used to accelerate the search speed of the RRT* algorithm, quickly generate an initial path, and then deploy different concentrations of initial pheromones according to the initial path to guide the ant colony algorithm search. Then, the silo excavation search strategy is added to the ant colony algorithm, which improves the pheromone update rule and reduces the number of iterations of the ant colony algorithm. Finally, several simulation experiments are carried out on the algorithm in maps of different scales, and the comparative experimental results show that the RRT*-ACO algorithm has faster convergence speed, better global search ability, and the path planning efficiency is significantly higher than that of traditional ant colony algorithm and ant colony system, and has better robustness in large-scale maps.

For the coil misalignment problem in the charging process of automatic guidance vehicles (AGVs), this paper proposes an optimization method for the bilateral LCC compensation network parameters based on quadruple-D quadrature (4DQ) coils. By introducing two coefficients $K_{\text {T}}$ and $K_{\text {f1}}$ , the compensation capacitors $C_{\text {T}}$ and $C_{\text {f1}}$ are optimized, achieving smaller output power fluctuations. Firstly, the capacitor values $C_{\text {T}}$ and $C_{\text {f1}}$ at resonance in the SS and PS equivalent circuit topology are obtained, meanwhile, the relationship between the output power $P_{\text {out}}$ and the coupling coefficient $k$ , represented by the coefficients $K_{\text {T}}$ and $K_{\text {f1}}$ , is obtained. Furthermore, with the transmission efficiency as the limiting condition, the output power fluctuation is effectively suppressed by adjusting $K_{\text {T}}$ and $K_{\text {f1}}$ . Finally, the experimental results show that after optimization the output power is 427.08W, and the transmission efficiency is 93.506% when the coupling coil are aligned, the system can still maintain a power output of at least 382.36W with a coil offset of 0-153mm in the X/Y axis directions, and the transmission efficiency is always above 89.472%. At the same time, the maximum deviation value $\Delta P_{{\text {abs}\_{}\text{max}}}$ decreased from 213.1W before optimization to 111.0W after optimization, a decrease of 47.91%, effectively suppressing the power fluctuation and improving anti-offset performance.

This article presents the design, implementation and start-up of the first AIMW (Autonomous Industrial Mobile Warehouse) in the industry, in particular, in the factory located at Ford España S.L. in Almussafes (Valencia). This first version has been given the name of “Survival”, due to its ability to survive the industrial environment commonly known as “the jungle”. The motivation for the design of the first AIMW was due to the management of spare warehouses for maintenance tasks. In all factories there is a central warehouse where replacement materials with a higher probability of use are placed near the warehouse exit, thus reducing the time to obtain the replacement. However, in large factories, such as automobile manufacturing, the distance between the central warehouse and the place where the breakdown occurs may cause very long delays. For this reason, there are smaller warehouses distributed throughout the plant that replicate the part of the central warehouse where the most used materials are kept. The objective of our research is to make that part of the central warehouse mobile with the AIMW design, thus eliminating the fixed warehouses. In the factory at Ford España S.L. in Almussafes there are 170 of these warehouses distributed in a homogeneous way. In this first proposal of an AIMW, and with the primary objective of reducing costs, Survival 1.0 has been designed based on a commercial AMR. For its choice, commercial AMRs were tested in real situations within the Ford factory (Almussafes). As a result, none of them were able to pass all the tests. In addition, the current regulations for AMRs, the ANSI/ITSDF B56.5:2019 and the EN 1525:1997 standard, only define minimum test standards to describe how manufacturers and users must carry out the safety measurements of AGVs and AMRs. However, from an industry point of view, these regulations are not adequate. Therefore, there are extensions of these regulations generated by the companies themselves that imply additional developments of commercial AMRs. This paper shows the developments made to be able to integrate the first AIMW into the production line, but it also shows the gap between research and standardization of AMRs with respect to the demands and needs of the industry. There are currently three Survival 1.0 AIMWs in operation in the factory at Ford España S.L. in Almussafes.

This article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly consider the shortest path while ignoring vehicle turning time and stability. We propose a secondary path-planning method based on an improved directed weighted graph theory integrated with an ROS. Firstly, the production environment is modeled in detail to identify the initial position of the AGV. Secondly, the operational area is systematically divided, key nodes are selected and optimized, and a directed weighted graph is constructed with optimized weights. It is integrated with the ROS for path planning, using the Floyd algorithm to find the optimal path. The effectiveness and superiority of this method have been demonstrated through simulation verification and actual AGV operation testing. The path planning strategy and fusion algorithm proposed in this article that comprehensively considers distance and angle steering are simple and practical, effectively reducing production costs for enterprises. This method is suitable for logistics sorting and small transport AGVs with a shorter overall path-planning time, higher stability, and limited computing power, and it has reference significance and practical value.

As an important part of urban terminal delivery, automated guided vehicles (AGVs) have been widely used in the field of takeout delivery. Due to the real-time generation of takeout orders, the delivery system is required to be extremely dynamic, so the AGV needs to be dynamically scheduled. At the same time, the uncertainty in the delivery process (such as the meal preparation time) further increases the complexity and difficulty of AGV scheduling. Considering the influence of these two factors, the method of embedding a stochastic programming model into a rolling mechanism is adopted to optimize the AGV delivery routing. Specifically, to handle real-time orders under dynamic demand, an optimization mechanism based on a rolling scheduling framework is proposed, which allows the AGV’s route to be continuously updated. Unlike most VRP models, an open chain structure is used to describe the dynamic delivery path of AGVs. In order to deal with the impact of uncertain meal preparation time on route planning, a stochastic programming model is formulated with the purpose of minimizing the expected order timeout rate and the total customer waiting time. In addition, an effective path merging strategy and after-effects strategy are also considered in the model. In order to solve the proposed mathematical programming model, a multi-objective optimization algorithm based on a NSGA-III framework is developed. Finally, a series of experimental results demonstrate the effectiveness and superiority of the proposed model and algorithm.

This article deals with the implementation of automated guided vehicles (AGVs) in a selected company. The aim is to analyse the use of AGVs in our country and abroad and to provide information about the use of AGVs in other countries and operations other than ours. The result of the analysis was a literature review, which points out the individual advantages and disadvantages of the use of AGVs in companies. Within the review we also address the issue of AMR vehicles, due to the modernization of existing AGVs in the company, or the replacement of AMRs with AGVs in general. Our aim is to show why AGVs can replace human work. This is mainly because of the continuous increase in the wages of employees, because of safety, but also because of the modernization of the selected company. The company has positive experience of AGVs in other sites. We wanted to point out a higher form of automation, and how it would be possible to use AMR vehicles for the same work as AGVs. In the company, we have identified jobs where we would like to introduce AGVs or AMR vehicles. Consequently, we chose the AGV from CEIT operated by magnetic tape and the AMR from SEER as an example. Based on studies, the demand for AGVs is expected to increase by up to 17% in 2019–2024. Therefore, the company is looking into the issue of the implementation of AGVs at multiple sites. The question which remains is the economic return and the possibility of investing in the automation of processes in the company, which we discuss in more detail in the conclusion of the article and in the research. The article describes the exact processes for AGVs, their workload, and also the routes for AGVs, such as loading/unloading points, stopping points, checkpoints, junctions with other AGVs, charging stations, and field elements, as well as their speed, frequency and the possibility of collision with other AGVs. Our research shows that by applying the new technology, the company will save a large amount of money on employee wages. The purchase of two AGVs will cost the company EUR 49,000, while the original technology used in the company cost EUR 79,200 annually. The payback period for such an investment is 8 months. The benefits of implementing AGVs are evaluated in the last section of this paper, where both the economic and time requirements of the different proposals are included. This section also includes recommendations for improving specific parts of the enterprise. [ABSTRACT FROM AUTHOR]

Background: This article presents the results of a literature review from 2018 to 2023, which focused on research related to human and AGV system cooperation in a shared workspace. This study defines AGV systems as systems using Automated Guided Vehicles or Autonomous Guided Vehicles. An Automated Guided Vehicle is a cart that follows a guided path, while an Autonomous Guided Vehicle is an Automated Guided Vehicle that is autonomously controlled. The analyses conducted answered two research questions: (RQ1) In what aspects are the human factor examined in publications on the implementation and operation of AGV systems? (RQ2) Has the human-AGV collaboration aspect been analyzed in the context of a sustainable work environment? Methods: The literature review was conducted following the systematic literature review method, using the PRISMA approach. Results: Based on the search of two journal databases, according to the indicated keywords, 1219 documents pertaining to the analyzed issues were identified. The selection and elimination of documents that did not meet the defined criteria made it possible to limit the number of publications to 117 articles and proceedings papers. On this basis, the authors defined a classification framework comprising five basic research categories and nine subcategories. The analyzed documents were classified, and each distinguished group was characterized by describing the results. Conclusions: The development of a two-level classification framework for research from the analyzed area according to the assumptions of the concept map and the identification of research gaps in the area of human-AGV interaction. [ABSTRACT FROM AUTHOR]

With the implementation of AGV technology and automated scheduling, storage and retrieval systems have become widely utilized in warehouse management. However, due to the use of unidirectional channels, AGV movement is restricted, and detours may occur frequently. Additionally, as the number of AGVs increases, deadlocks can arise, which lead to delays in order packaging and a decrease in overall warehouse performance. Hence, this paper proposes a dynamic scheduling method for task assignment and route optimization of AGVs to prevent collisions. The routing optimization method is based on an improved A* algorithm, which takes into account the dynamic map as input. Moreover, this paper investigates highly complex collision scenarios in bidirectional channels. Through simulation experiments, it is evident that scheduling methods based on bidirectional channels offer a clear advantage in terms of efficiency compared to those based on unidirectional channels. [ABSTRACT FROM AUTHOR]

In this paper, we propose a Grid-based Non-uniform Probability Density Sampling Probabilistic Roadmap algorithm (GN-PRM) in response to the challenges of difficult sampling in narrow passages and low-probability map generation in traditional Probabilistic Roadmap algorithms (PRM). The improved algorithm incorporates grid-based processing for map segmentation, employing non-uniform probability density sampling based on the different attributes of each block to enhance sampling probability in narrow passages. Additionally, considering the computational cost and frequent ineffective searches in traditional PRM algorithms during pathfinding, this paper optimizes the time required for query route planning by altering connection strategies to improve the algorithm's runtime. Finally, the simulation results indicate that, with a reduction of over 50% in undirected line segments and a reduction of over 85% in runtime, the GN-PRM algorithm achieves a 100% success rate in complex planning scenarios with a sampling point value of K = 500. In comparison, the traditional PRM algorithm has a success rate of no more than 10%, with a sampling point value of K = 500. [ABSTRACT FROM AUTHOR]