Collaborative robots face barriers to widespread adoption due to the complexity of programming them to achieve human-like movement. Learning from demonstration (LfD) has emerged as a crucial solution, allowing robots to learn tasks directly from expert demonstrations, offering versatility and an intuitive programming approach. However, many existing LfD methods encounter issues such as convergence failure and lack of generalization ability. In this paper, we propose: (1) a generative adversarial network (GAN)-based model with multilayer perceptron (MLP) architecture, coupled with a novel loss function designed to mitigate convergence issues; (2) an affine transformation-based generalization method aimed at enhancing LfD tasks by improving their generalization performance; (3) a data preprocessing method tailored to facilitate deployment on robotics platforms. We conduct experiments on a UR5 robotic platform tasked with handwritten digit recognition. Our results demonstrate that our proposed method significantly accelerates generation speed, achieving a remarkable processing time of 23 ms, which is five times faster than movement primitives (MPs), while preserving key features from demonstrations. This leads to outstanding convergence and generalization performance.

High-density 3D warehousing is the future cornerstone of modern logistics storage. It aims to efficiently manage and store various types of goods by utilizing 3D space and automation technology. The accurate and fast docking algorithm of the four-way shuttles, as a core method of carrying the goods in high-density 3D warehousing, has become an increasingly important technical challenge. Inaccurate docking will result in a failure to change direction, while long docking time will affect the operation efficiency of the four-way shuttle. To overcome these obstacles, this paper presents an accurate and rapid docking algorithm for four-way shuttles. Firstly, the deceleration and jerk of a four-way shuttle in the braking stage are initialized according to the motion parameter set calculated by the docking motion model. Then, the four-way shuttle starts to move until the stop signal has been detected. If the system fails to detect the stop signal, the distance compensation is needed to ensure that the four-way shuttle can arrive at the stop point. Finally, the four-way shuttle stops immediately by way of amplifying the deceleration when reaching the stop point. The result shows that the accuracy of rapid docking is superior to that of direct docking. Compared with crawling docking, rapid docking reduces the braking time by 3.99s and stops at a speed lower than the crawling speed. The rapid docking algorithm not only enhances the throughput of high-density 3D warehousing but also improves the service life of four-way shuttles.

Generalized target detection algorithms perform well for large- and medium-sized targets but struggle with small ones. However, with the growing importance of aerial images in urban transportation and environmental monitoring, detecting small targets in such imagery has been a promising research hotspot. The challenge in small object detection lies in the limited pixel proportion and the complexity of feature extraction. Moreover, current mainstream detection algorithms tend to be overly complex, leading to structural redundancy for small objects. To cope with these challenges, this paper recommends the PCSG model based on yolov5, which optimizes both the detection head and backbone networks. (1) An enhanced detection header is introduced, featuring a new structure that enhances the feature pyramid network and the path aggregation network. This enhancement bolsters the model’s shallow feature reuse capability and introduces a dedicated detection layer for smaller objects. Additionally, redundant structures in the network are pruned, and the lightweight and versatile upsampling operator CARAFE is used to optimize the upsampling algorithm. (2) The paper proposes the module named SPD-Conv to replace the strided convolution operation and pooling structures in yolov5, thereby enhancing the backbone’s feature extraction capability. Furthermore, Ghost convolution is utilized to optimize the parameter count, ensuring that the backbone meets the real-time needs of aerial image detection. The experimental results from the RSOD dataset show that the PCSG model exhibits superior detection performance. The value of mAP increases from 97.1% to 97.8%, while the number of model parameters decreases by 22.3%, from 1,761,871 to 1,368,823. These findings unequivocally highlight the effectiveness of this approach.

Metro Computer Interlocking Systems are crucial for ensuring the safe and efficient operation of rail transit. However, existing vision-based signal detection methods face challenges including small target sizes, high target density, low image resolution, and the need for deployment on resource-constrained devices. To address these issues, this paper proposes a two-stage lightweight signal detection framework for Metro Computer Interlocking Systems. First, based on YOLOv8, a small object detection layer together with feature fusion modules is introduced to form the YOLOv8-SFF architecture. A Scale Sequence Feature Fusion (SSFF) module is added to adjust the resolution of feature maps and retain critical fine-grained information, enhancing the detection of small visual signals. A Triple Feature Encoding (TFE) module is designed to enhance the recognition of dense small signals while replacing some traditional feature concatenation and upsampling operations, yielding a more compact network. Second, to enable practical deployment, a joint optimization strategy combining Layer-Adaptive Magnitude-based Pruning (LAMP) and Channel-wise Knowledge Distillation (CWD) is applied, in which the unpruned YOLOv8-SFF serves as the teacher and the pruned model serves as the student. In addition, an automatic annotation subsystem based on digital image processing is developed, leveraging color and morphological features to generate high-quality labels. Experimental results show that YOLOv8-SFF achieves a mean average precision (mAP@50) of 98.7%, improving mAP@50 by 11.3 percentage points and recall by 22.1 percentage points over the original YOLOv8. After joint pruning and distillation, the final compact model retains 98.0% mAP while reducing the parameter count by 86.2% and the model size to 1.1 MB, making it well suited for real-time deployment in resource-constrained metro dispatching systems.

Optimal path planning algorithms offer substantial benefits in high-density storage (HDS) systems in modern smart manufacturing. However, traditional algorithms may encounter significant optimization challenges due to intricate architectural configurations and traffic constraints of the HDS system. This paper addresses these issues by introducing a two-step novel path planning method: (1) the mesh-tree grid map topological representation and the (2) Lattice-Hopping (LH) algorithm. The proposed method first converts the layout of an HDS system into a mesh-tree grid hierarchical structure by capturing and simplifying the spatial and geometrical information as well as the traffic constraints of the HDS system. Then, the LH algorithm is proposed to find optimal shipping path by leveraging the global connectivity of main tracks (main track priority) and the ‘jumping’ mechanism of sub-tracks. The main track priority and the ‘jumping’ mechanism work together to save computational complexity and enhance the feasibility and optimality of the proposed method. Numerical and case studies are performed to demonstrate the superiorities of our method to properly modified benchmark algorithms. Algorithm scalability, robustness, and operational feasibility for industrial production in modern smart manufacturing are also displayed and emphasized.