Imitation learning has shown strong potential for enabling robots to acquire dexterous manipulation skills by integrating visual observations with proprioceptive states. However, common approaches typically use visual encoders pretrained in computer vision domains, which mainly aim to extract generic representations without emphasizing the precise spatial and semantic structures that are crucial for robotic manipulation. In this work, we propose the Joint-Guided Spatial and Semantic Sensitive Diffusion Policy (S3D), which effectively fuses structured and generic features by incorporating depth and semantic maps with RGB and proprioceptive inputs to strengthen spatial–semantic understanding in manipulation. However, naively incorporating these multimodal representations inevitably introduces additional computational overhead. Thus, we introduce a Joint-Guided Dynamic Attention module that generates joint-conditioned queries to extract behavior-specific representations with controlled complexity. Experiments across a variety of simulated and real-world robotic manipulation tasks demonstrate that S3D yields consistent performance gains over state-of-the-art methods.

In recent years, magnetically controlled microrobots have garnered significant attention. This paper presents the H-robot, a self-designed microrobot featuring an innovative structure. The H-robot features a honeycomb porous spherical design specifically engineered to enhance cargo capacity. A new dynamic model for this structure has been developed for low Reynolds number fluid environments, along with a robust backstepping sliding mode control (RBSMC) strategy. Experiments were conducted in a calibrated magnetic field generated by a magnetic field generator to achieve precise motion control. The results demonstrate that the H-robot accurately tracks standard trajectories, with root mean square errors (RMSE) of$9.09 \times 10^{-4} \mathbf{~ m}$for the Number-8 path and$8.29 \times 10^{-4} \mathbf{~ m}$for the S-shaped path. Additionally, the proposed resistance model enhances tracking accuracy by 73.61% compared to traditional models, effectively adjusting the dynamic behavior of the H-robot in low Reynolds number fluids and significantly improving its motion performance. Finally, path planning experiments in a maze demonstrate the H-robot's ability to navigate and avoid obstacles.

We address a fundamental challenge in coordinating large-scale 3D drone swarms: how to achieve rapid collective response to environmental stimuli while ensuring group stability and safety. Existing swarm navigation modals often rely on sophisticated individual perception and communication capabilities, which can be computationally expensive and impractical for large swarms. In this paper, we propose the Non-reciprocal Collective Emergent Navigation model (NRCE), a decentralized approach designed for real-world drone flocking in complex environments. Unlike traditional models, our approach leverages localized non-reciprocal interactions, where boundary drones detect environmental stimuli and propagate this information throughout the swarm without directly controlling individual trajectories. Through extensive numerical simulations and physical experiments with up to 28 drones, we demonstrate how this model achieves coordinated collective motion while effectively balancing stability with responsiveness. Our findings reveal two notable insights: (1) intermediate cohesion levels (ωc) optimize collective response—a "Goldilocks zone" where individuals are neither too tightly coupled nor too independent, challenging the conventional wisdom that stronger cohesion always improves coordination; and (2) swarm queue configuration significantly affects optimal interaction parameters, with divergent trends observed between attraction- and repulsion-based coordination mechanisms as layer count increases. These discoveries provide critical design principles for cost-effective, high-density swarm systems while advancing the theoretical understanding of collective dynamics in both artificial and biological systems.

Ant Colony Optimization (ACO) is a prominent swarm intelligence algorithm extensively applied to path planning. However, traditional ACO methods often exhibit shortcomings, such as blind search behavior and slow convergence within complex environments. To address these challenges, this paper proposes the Pheromone-Focused Ant Colony Optimization (PFACO) algorithm, which introduces three key strategies to enhance the problem-solving ability of the ant colony. First, the initial pheromone distribution is concentrated in more promising regions based on the Euclidean distances of nodes to the start and end points, balancing the trade-off between exploration and exploitation. Second, promising solutions are reinforced during colony iterations to intensify pheromone deposition along high-quality paths, accelerating convergence while maintaining solution diversity. Third, a forward-looking mechanism is implemented to penalize redundant path turns, promoting smoother and more efficient solutions. These strategies collectively produce the focused pheromones to guide the ant colony’s search, which enhances the global optimization capabilities of the PFACO algorithm, significantly improving convergence speed and solution quality across diverse optimization problems. The experimental results demonstrate that PFACO consistently outperforms comparative ACO algorithms in terms of convergence speed and solution quality.

Efficient feature learning is considered indispensable for maximizing the representation of scarce information in tiny datasets. However, existing methods are often unable to fully exploit local features and contextual dependencies when dealing with tiny datasets. To overcome this shortcoming, a Cross-Feature Vision Transformer (CF-ViT) was proposed, which decouples local feature refinement from global context modeling and leverages the complementary strengths of CNNs and Transformers. Specifically, a Cross-Scale Fusion (CSF) module was introduced to integrate features from multiple scales, ensuring that cross-scale information is globally embedded. In addition, a Feature Enhancement and Reorganization (FER) module was incorporated into CF-ViT, whereby Transformer outputs are reorganized into 2D feature maps for convolution-based detail enhancement to thoroughly exploit local information. Extensive experiments have demonstrated that CF-ViT consistently surpasses baselines across 4 tiny datasets, reaching a 96.87% (KSDD) Top-1 accuracy with only 29.19 million parameters and 2.67 billion FLOPs. Moreover, a Top-1 accuracy of 85.03% is attained on a real-world tiny dataset of wood surface defect detection, exceeding all baselines. These findings underscore the effectiveness and generalization capability of CF-ViT in capturing fine-grained local details and global context, offering a promising and deployable solution for vision tasks in tiny datasets.

In logistics systems with multiagent collaboration, one of the prevailing focus lies on modeling as the dynamic multiperiod vehicle routing problem (DMPVRP). This work introduces modifications to DMPVRP to align with the requirements of real factory operations, particularly with dynamic supply demands. A self-established multiagent dynamic scheduling framework has been proposed to adapt to dynamic environmental changes and make timely adjustments, which consists of two modules: dynamic path planning and machine assignment. The first module utilizes a self-designed multioperator two-stage evolutionary algorithm to dynamically update the routes for vehicles. The second module maintains the workload balance among vehicles in real time. Experimental results demonstrate that the proposed algorithm achieves optimal outcomes compared to three state-of-the-art algorithms, surpassing others by 20% in machine output and exhibiting 5% lower transportation costs. In addition, a case study from a steel cord manufacturing factory is conducted, demonstrating its capability to promptly enhance efficiency.

Peripheral waveform analysis (PWA), which is generally used to reveal hidden health status information from peripheral pulse signals, typically involves three procedures: signal preprocessing, feature extraction, and pattern classification. With the advancement of data-driven deep neural network methodologies, feature extraction and pattern classification have progressively converged into end-to-end neural networks, where the final layer of the network is equivalent to conventional pattern classifiers. However, the performance of deep learning models heavily relies on the quality of the dataset, rendering data signal preprocessing a crucial component. This study proposes a framework that integrates signal preprocessing, feature extraction, and pattern classification into a unified learning approach using heuristic algorithms, enabling the automatic discovery of optimal data encoding methods and their corresponding models. Initially, the search space is defined based on parameters relevant to signal preprocessing, and a fitness function is constructed utilizing CNN. Subsequently, the optimal combination of data preprocessing and CNN is determined through the heuristic algorithm Particle Swarm Optimization (PSO). The proposed method was evaluated in the dataset comprising authentic clinical cases of type 2 diabetes screening involving approximately 200 volunteers. The model derived from this framework demonstrates the capability to effectively discriminate between healthy volunteers and those with diabetes, achieving the highest accuracy of 93.6%. Compared to state-of-the-art algorithms, the proposed model was shown to be competitive in both accuracy and time cost.

In this paper, we propose a new ant colony optimization algorithm, called learning-based neural ant colony optimization (LN-ACO), which incorporates an "intelligent ant". This intelligent ant contains a convolutional neural network pre-trained on a large set of instances which is able to predict the selection probabilities of the set of possible choices at each step of the algorithm. The intelligent ant is capable of generating a solution based on knowledge learned during training, but also guides other 'traditional' ants in improving their choices during the search. As the search progresses, the intelligent ant is also influenced by the pheromones accumulated by the colony, leading to better solutions. The key idea is that if tasks or instances share common features either in terms of their search landscape or solutions, then information learned by solving one instance can be applied to substantially accelerate the search on another. We evaluate the proposed algorithm on two public datasets and one real-world test set in the path planning domain. The results demonstrate that LN-ACO is competitive in its search capability compared to other ACO methods, with a significant improvement in convergence speed.