HAURRT*smart: A rapidly exploring pseudo-random tree algorithm with low redundancy

doi:10.1016/j.ast.2026.111868

HAURRT*smart: A rapidly exploring pseudo-random tree algorithm with low redundancy

2026-03-14

0

PRE

AI

DOI：10.1016/j.ast.2026.111868

Original

Original request for help

Save

Abstract

En 中文

• A new strategy for rapidly expanding pseudo-random trees is proposed. • A method that theoretically resolves node redundancy in random trees. • This algorithm demonstrates high efficiency throughout all phases. • Comprehensive tests demonstrate the algorithm’s robustness and adaptability.

Keywords:

pseudo-random tree

node redundancy

rapid expansion

algorithm efficiency

robustness

HAURRT*smart: A rapidly exploring pseudo-random tree algorithm with low redundancy

Abstract

Journal

Organization