Name
Abstract | ||
|---|---|---|
We present a new pruning method for compact precomputed search trees and evaluate the effectiveness and the efficiency of our precomputation planning with steering sets. Precomputed search trees are one method for reducing planning time; however, there is a time-memory trade off. Our precomputed search tree (PCS) is built with pruning based on a rule of constant memory, the maximum-size pruning method (MSP), which is the preset ratio of pruning. Using MSP, we get a large precomputed search tree of reasonable size. Additionally, we apply the node selection strategy (NSS) to MSP. We extend the outer edge of the tree and enhance the path reachability. In maps with less than a 12% obstacle rate, the runtime of precomputation planning is more than two orders of magnitude faster than the planning without precomputed search trees. Our precomputed search tree with steering sets finds an optimal path in the map of its obstacle rate at 20%. Then, our precomputation planning speedily produces the smooth optimal path in an indoor environment. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ROMAN.2009.5326312 | Toyama |
Keywords | Field | DocType |
mobile robots,path planning,search problems,trees (mathematics),compact precomputed search trees,maximum-size pruning method,mobile robots,node selection strategy,path planning,planning time reduction,precomputation planning,steering set | Motion planning,Obstacle,Precomputation,Computer science,Simulation,Reachability,Robot,Mobile robot,Pruning,Search tree | Conference |
Volume | Issue | ISSN |
22 | 1 | 1944-9445 E-ISBN : 978-1-4244-5081-7 |
ISBN | Citations | PageRank |
978-1-4244-5081-7 | 0 | 0.34 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yumiko Suzuki | 1 | 0 | 0.34 |
| Simon G. Thompson | 2 | 113 | 16.66 |
| Satoshi KAGAMI | 3 | 1285 | 160.65 |