IROS
2006
IEEE
13 years 10 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...