Single-Query Entropy-Guided Path Planning
Brendan Burns, Oliver Brock · 2006
Efficient motion planning for robots with many degrees of freedom requires the exploration of a large configuration space. Sampling based motion planners perform approximate exploration of the configuration space in order to render the problem tractable. Each sample of configuration space as an opportunity to gain information about that configuration space. A formal definition of information gain can be used to guide a motion planner to achieve maximal progress toward the discovery of a path. We call such a motion planner entropy-guided since entropy reduction is synonymous with information gain. In the following we describe a single-query entropy-guided motion planner which uses a formal definition of information gain to focus its efforts on the acquisition of a single path from start to goal locations. Experimental evidence indicates that this approach can outperform existing single-query techniques.