Due to the complex growth positions of dragon fruit and the difficulty in robotic picking, this paper proposes a six degrees of freedom dragon fruit picking robot and investigates the manipulator’s motion characteristics to address the adaptive motion issues of the picking manipulator. Based on the agronomic characteristics of dragon fruit cultivation, the structural design of the robot and the dimensions of its manipulator were determined. A kinematic model of the dragon fruit picking robot based on screw theory was established, and the workspace of the manipulator was analyzed using the Monte Carlo method. Furthermore, a dynamic model of the manipulator based on the Kane equation was constructed. Performance experiments under trajectory and non-trajectory planning showed that trajectory planning significantly reduced power consumption and peak torque. Specifically, Joint 3’s power consumption decreased by 62.28%, and during the picking, placing, and resetting stages, the peak torque of Joint 4 under trajectory planning was 10.14 N·m, 12.57 N·m, and 16.85 N·m, respectively, compared to 12.31 N·m, 15.69 N·m, and 22.13 N·m under non-trajectory planning. This indicated that the manipulator operates with less impact and smoother motion under trajectory planning. Comparing the dynamic model simulation and actual testing, the maximum absolute error in the joint torques was −2.76 N·m, verifying the correctness of the dynamic equations. Through field picking experiments, it was verified that the machine’s picking success rate was 66.25%, with an average picking time of 42.4 s per dragon fruit. The manipulator operated smoothly during each picking process. In the study, the dragon fruit picking manipulator exhibited good stability, providing the theoretical foundation and technical support for intelligent dragon fruit picking.
Snake-like robots, characterized by their high flexibility and multi-joint structure, exhibit exceptional adaptability to complex terrains such as snowfields, jungles, deserts, and underwater environments. Their ability to navigate narrow spaces and circumvent obstacles makes them ideal for operations in confined or rugged environments. However, efficient motion in such conditions requires not only mechanical flexibility but also effective path planning to ensure safety, energy efficiency, and overall task performance. Most existing path planning algorithms for snake-like robots focus primarily on finding the shortest path between the start and target positions while neglecting the optimization of energy consumption during real operations. To address this limitation, this study proposes an energy-efficient path planning method based on an improved A* algorithm enhanced with deep reinforcement learning: Dueling Double-Deep Q-Network (D3QN). An Energy Consumption Estimation Model (ECEM) is first developed to evaluate the energetic cost of snake robot motion in three-dimensional space. This model is then integrated into a new heuristic function to guide the A* search toward energy-optimal trajectories. Simulation experiments were conducted in a 3D environment to assess the performance of the proposed approach. The results demonstrate that the improved A* algorithm effectively reduces the energy consumption of the snake robot compared with conventional algorithms. Specifically, the proposed method achieves an energy consumption of 68.79 J, which is 3.39%, 27.26%, and 5.91% lower than that of the traditional A* algorithm (71.20 J), the bidirectional A* algorithm (94.61 J), and the weighted improved A* algorithm (73.11 J), respectively. These findings confirm that integrating deep reinforcement learning with an adaptive heuristic function significantly enhances both the energy efficiency and practical applicability of snake robot path planning in complex 3D environments.
The advancement of robotic fish necessitates examination of whether caudal fins should be specifically designed for individual body shapes or if generic, isometric fins can function effectively across multiple species. Addressing this knowledge gap is essential for optimizing performance and efficiency in robotic aquatic systems. This work examines the effect of caudal fin geometry on the swimming performance of a flying fish-inspired robot and proposes design guidelines for efficient robotic tails. Four fin designs were constructed based on the morphologies of flying fish, swordfish, whale sharks, and thresher shark. These designs was evaluated through computational fluid dynamics (CFD) and pool experiments. Key performance metrics, namely swimming speed, Strouhal number (St), Reynolds number (Re), and the cost of transport (COT), were assessed, with flow structures analyzed to interpret propulsive mechanisms. The flying fish caudal fin achieved the highest speed (up to 2.54 m s −1 ) and the lowest COT (20.05–30.18). Moreover, St and Re values remained within biologically relevant ranges, suggesting superior propulsive efficiency. CFD results confirmed the flying fish caudal fin as the best-performing design, while over-elongated fins were found to be less efficient, requiring more power. Our results suggest that swimming efficiency can be improved through body-tail morphological compatibility, emphasizing the adaptation of tail designs to specific body platforms rather than cross-species transplantation. These findings provide actionable guidance for the design of high-efficiency, flying fish-inspired robotic caudal fins.
Cross-lingual entity alignment is the task of finding the same semantic entities from different language knowledge graphs. In this paper, we propose a simple and novel unsupervised method for cross-language entity alignment. We utilize the deep learning multi-language encoder combined with a machine translator to encode knowledge graph text, which reduces the reliance on label data. Unlike traditional methods that only emphasize global or local alignment, our method simultaneously considers both alignment strategies. We first view the alignment task as a bipartite matching problem and then adopt the re-exchanging idea to accomplish alignment. Compared with the traditional bipartite matching algorithm that only gives one optimal solution, our algorithm generates ranked matching results which enabled many potentials downstream tasks. Additionally, our method can adapt two different types of optimization (minimal and maximal) in the bipartite matching process, which provides more flexibility. Our evaluation shows, we each scored 0.966, 0.990, and 0.996 Hits@1 rates on the DBP15K dataset in Chinese, Japanese, and French to English alignment tasks. We outperformed the state-of-the-art method in unsupervised and semi-supervised categories. Compared with the state-of-the-art supervised method, our method outperforms 2.6% and 0.4% in Ja-En and Fr-En alignment tasks while marginally lower by 0.2% in the Zh-En alignment task.