The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Abstract¶
When a mobile agent does not know its position perfectly, incorporating the predicted uncertainty of future position estimates into the planning process can lead to substantially better motion performance. However, planning in the space of probabilistic position estimates, or belief space, can incur a substantial computational cost. In this paper, we show that planning in belief space can be performed efficiently for linear Gaussian systems by using a factored form of the covariance matrix. This factored form allows several prediction and measurement steps to be combined into a single linear transfer function, leading to very efficient posterior belief prediction during planning. We give a belief-space variant of the probabilistic roadmap algorithm called the belief roadmap (BRM) and show that the BRM can compute plans substantially faster than conventional belief space planning. We conclude with performance results for an agent using ultra-wide bandwidth radio beacons to localize and show that we can efficiently generate plans that avoid failures due to loss of accurate position estimation.
Summary¶
Introduces the belief roadmap, which factors covariance evolution to make planning in belief space more efficient. The method lets robots reason about uncertainty along roadmap paths without paying the full cost of high-dimensional belief planning everywhere.
Links¶
Tags¶
Similar Papers¶
Rapidly-exploring Random Belief Trees for Motion Planning under Uncertainty
Rapidly-exploring Random Belief Trees