Choosing the optimal path in planning is a complex task due to the numerous options and constraints; this is known as the trip design problem (TTDP). This study aims to achieve path optimization through the weighted sum method and multi-criteria decision analysis. Firstly, this paper proposes a weighted sum optimization method using a comprehensive evaluation model to address TTDP, a complex multi-objective optimization problem. The goal of the research is to balance experience, cost, and efficiency by using the Analytic Hierarchy Process (AHP) and Entropy Weight Method (EWM) to assign subjective and objective weights to indicators such as ratings, duration, and costs. These weights are optimized using the Lagrange multiplier method and integrated into the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) model. Additionally, a weighted sum optimization method within the Traveling Salesman Problem (TSP) framework is used to maximize ratings while minimizing costs and distances. Secondly, this study compares seven heuristic algorithms—the genetic algorithm (GA), particle swarm optimization (PSO), the tabu search (TS), genetic-particle swarm optimization (GA-PSO), the gray wolf optimizer (GWO), and ant colony optimization (ACO)—to solve the TOPSIS model, with GA-PSO performing the best. The study then introduces the Lagrange multiplier method to the algorithms, improving the solution quality of all seven heuristic algorithms, with an average solution quality improvement of 112.5% (from 0.16 to 0.34). The PSO algorithm achieves the best solution quality. Based on this, the study introduces a new variant of PSO, namely PSO with Laplace disturbance (PSO-LD), which incorporates a dynamic adaptive Laplace perturbation term to enhance global search capabilities, improving stability and convergence speed. The experimental results show that PSO-LD outperforms the baseline PSO and other algorithms, achieving higher solution quality and faster convergence speed. The Wilcoxon signed-rank test confirms significant statistical differences among the algorithms. This study provides an effective method for experience-oriented path optimization and offers insights into algorithm selection for complex TTDP problems.

Tea bud recognition and localization constitute a fundamental step toward enabling fine-grained tea plantation management and intelligent harvesting, offering substantial value in improving the picking quality of premium tea materials, reducing labor dependency, and accelerating the development of smart tea agriculture. However, most existing methods for detecting tea buds are built upon Artificial Neural Networks (ANNs) and rely extensively on floating-point computation, making them difficult to deploy efficiently on energy-constrained edge platforms. To address this challenge, this paper proposes an energy-efficient tea bud detection model, GAE-SpikeYOLO, which improves upon the Spiking Neural Networks (SNNs) detection framework SpikeYOLO. Firstly, Gated Attention Coding (GAC) is introduced into the input encoding stage to generate spike streams with richer spatiotemporal dynamics, strengthening shallow feature saliency while suppressing redundant background spikes. Secondly, the model incorporates the Temporal-Channel-Spatial Attention (TCSA) module into the neck network to enhance deep semantic attention on tea bud regions and effectively suppress high-level feature responses unrelated to the target. Lastly, the proposed model adopts the EIoU loss function to further improve bounding box regression accuracy. The detection capability of the model is systematically validated on a tea bud object detection dataset collected in natural tea garden environments. Experimental results show that the proposed GAE-SpikeYOLO achieves a Precision (P) of 83.0%, a Recall (R) of 72.1%, a mAP@0.5 of 81.0%, and a mAP@[0.5:0.95] of 60.4%, with an inference energy consumption of only 49.4 mJ. Compared with the original SpikeYOLO, the proposed model improves P, R, mAP@0.5, and mAP@[0.5:0.95] by 1.4%, 1.6%, 2.0%, and 3.3%, respectively, while achieving a relative reduction of 24.3% in inference energy consumption. The results indicate that GAE-SpikeYOLO provides an efficient and readily deployable solution for tea bud detection and other agricultural vision tasks in energy-limited scenarios.

Semantic segmentation of high-resolution remote-sensing images is critical for urban planning, land-cover mapping, and ecological monitoring. However, existing methods face limitations in handling complex land-cover types, multi-scale objects, and modeling long-range dependencies. To address these challenges, we propose RFA2Net, an enhanced semantic segmentation model based on the DeepLabv3+ framework. The key innovations include the integration of the RFCSA-Conv module into the ResNet101 backbone to enhance feature representation and long-range dependency modeling, the design of the RFA-DASPP structure built upon the Dense ASPP framework with the novel RFCA-DConv dilated convolution module to reduce information loss during multi-scale feature fusion and enhance the model’s ability to perceive long-range directional structures, and the introduction of a Dual-Branch Fusion Network to improve segmentation accuracy for small-scale objects. Experimental results on the ISPRS Potsdam and LoveDA datasets demonstrate that RFA2Net outperforms several CNN and Transformer-based models, achieving 78.94% and 59.46% mean intersection over union (mIoU) on the ISPRS Potsdam and LoveDA datasets, respectively, with improvements of 3.19% and 3.08% over the original DeepLabv3+. Ablation studies and comparative experiments further confirm the model’s effectiveness, robustness, and practical applicability in high-resolution remote-sensing image segmentation, with particular relevance to environmental monitoring and sustainable energy applications.