Maximum Likelihood Fusion of Stochastic Maps

Signal Processing, IEEE Transactions  (2014)

引用 3|浏览12
暂无评分
摘要
The fusion of independently obtained stochastic maps by collaborating mobile agents is considered. The proposed approach includes two parts: generalized likehood ratio matching and maximum likelihood alignment. In particular, an affine invariant hypergraph model is constructed for each stochastic map and a bipartite matching via a linear program is used to establish landmark correspondence between stochastic maps. A maximum likelihood alignment procedure is proposed to estimate rotation, translation and scale parameters in order to construct a global map of the environment. A main feature of the proposed approach is its scalability with respect to the number of landmarks: the matching step has polynomial complexity and the maximum likelihood alignment solution is obtained in closed form. Experimental validation of the proposed fusion approach is performed using the Victoria Park experimental benchmark.
更多
查看译文
关键词
computational complexity,computational geometry,directed graphs,linear programming,maximum likelihood estimation,mesh generation,parameter estimation,sensor fusion,stochastic processes,Victoria Park experimental benchmark,affine invariant hypergraph model,bipartite matching,generalized likehood ratio matching,global map construction,landmark correspondence,linear programming,maximum likelihood alignment procedure,maximum likelihood fusion,mobile agent collaboration,polynomial complexity,rotation parameter estimation,scale parameter estimation,stochastic maps,translation parameter estimation,Data association,data fusion,hypothesis testing,maximum likelihood estimation,mobile robot navigation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要