AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (6.6 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Publishing Language: Chinese

Research on multi-target path planning for artificial forest data acquisition robot

Yuting WANG1,3,4Jianhui LIN1,3,4Yili ZHENG1,2,3,4Jinrui MA1,3Hao LIANG1,2,3,4( )
School of Technology, Beijing Forestry University, Beijing 100083, China
State Key Laboratory of Efficient Production of Forest Resources, Beijing 100083, China
Key Laboratory of National Forestry and Grassland Administration on Forestry Equipment and Automation, Beijing 100083, China
Research Center for Intelligent Forestry, Beijing Forestry University, Beijing 100083, China
Show Author Information

Abstract

【Objective】

To address the issue that traditional methods in path planning for artificial forest data collection robots struggle to balance optimal path length and computational efficiency, a multi-target path planning method based on crossover simulated annealing is proposed to enhance the intelligence level and operational efficiency of artificial forest data collection.

【Method】

Firstly, the optimal path and distance between any two target radar nodes are calculated using the A* algorithm. Secondly, crossover operations from genetic algorithms are introduced to improve the way the traditional simulated annealing algorithm generates new solutions, allowing the algorithm to explore a larger solution space and find the optimal solution. Next, the two offspring solutions generated by the crossover operation are compared with the parent solutions, resulting in four main scenarios. Based on the solution quality and acceptance criteria, the acceptance standard for new solutions in the simulated annealing algorithm is further refined, accelerating the algorithm’s convergence. The improved simulated annealing algorithm is then used to generate the optimal visiting sequence of multi-target nodes. Finally, based on the optimal visiting sequence, the A* algorithm is used to connect the optimal paths to form the global closed-loop planned path.

【Result】

Experiments were conducted using the TSPLIB dataset, and the results were compared with the simulated annealing algorithm. Experimental results show that, compared to the simulated annealing algorithm, the proposed method reduces the path length by 22.3% and shortens the runtime by 10.5%. Furthermore, the algorithm's performance was verified in an artificial forest data collection experimental scenario in the Olympic forest park north area in Haidian District, Beijing. The experiment shows that, compared to the traditional simulated annealing algorithm, the proposed improved algorithm further reduces the path length by 11.69% and shortens the time by 21.99%.

【Conclusion】

This study proposes a multi-target path planning method based on crossover simulated annealing, which improves the rationality, smoothness, and computational efficiency of path planning for artificial forest data collection robots. It provides technical support for precise monitoring, resource assessment, and intelligent management of artificial forests, offering valuable insights for the application of intelligent equipment in the field of forestry engineering.

CLC number: S776 Document code: A Article ID: 1673-923X(2026)02-0215-14

References

【1】
【1】
 
 
Journal of Central South University of Forestry & Technology
Pages 215-228

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
WANG Y, LIN J, ZHENG Y, et al. Research on multi-target path planning for artificial forest data acquisition robot. Journal of Central South University of Forestry & Technology, 2026, 46(2): 215-228. https://doi.org/10.14067/j.cnki.1673-923x.2026.02.020

252

Views

2

Downloads

0

Crossref

0

CSCD

Received: 23 February 2025
Revised: 23 June 2025
Published: 25 February 2026
© 2026 Journal of Central South University of Forestry & Technology