Wenchuan Qiao

Wenchuan Qiao

Auto-generated profile, based on publicly available information

Wenchuan Qiao

Faculty of Robot Science and Engineering, Northeastern University, Shenyang 110819, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 August 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
WQWenchuan Qiao
Wenchuan Qiao
MHMin Huang
Min Huang
ZGZheming Gao
Zheming Gao
XWXingwei Wang
Xingwei Wang

1 July 2019 in International Journal of Advanced Robotic Systems
Verified
Journal Article
Open access
PDF file
WQWenchuan Qiao
Wenchuan Qiao
ZFZheng Fang
Zheng Fang
BSBailu Si
Bailu Si
Autonomous exploration is a key step toward real robotic autonomy. Among various approaches for autonomous exploration, frontier-based methods are most commonly used. One efficient method of frontier detection exploits the idea of the rapidly-exploring random tree and uses tree edges to search for frontiers. However, this method usually needs to consume a lot of memory resources and searches for frontiers slowly in the environments where random trees are not easy to grow (unfavorable environments). In this article, a sampling-based multi-tree fusion algorithm for frontier detection is proposed. Firstly, the random tree’s growing and storage rules are changed so that the disadvantage of its slow growing under unfavorable environments is overcome. Secondly, a block structure is proposed to judge whether tree nodes in a block play a decisive role in frontier detection, so that a large number of redundant tree nodes can be deleted. Finally, two random trees with different growing rules are fused to speed up frontier detection. Experimental results in both simulated and real environments demonstrate that our algorithm for frontier detection consumes fewer memory resources and shows better performances in unfavorable environments.