2篇
您的检索式：作者名="J.M.Toibero"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Iterated Conditional Modes to Solve Simultaneous Localization and Mapping in Markov Random Fields Context显示文摘This paper models the complex simultaneous localization and mapping(SLAM) problem through a very flexible Markov random field and then solves it by using the iterated conditional modes algorithm. Markovian models allow to incorporate: any motion model; any observation model regardless of the type of sensor being chosen; prior information of the map through a map model; maps of diverse natures; sensor fusion weighted according to the accuracy. On the other hand, the iterated conditional modes algorithm is a probabilistic optimizer widely used for image processing which has not yet been used to solve the SLAM problem. This iterative solver has theoretical convergence regardless of the Markov random field chosen to model. Its initialization can be performed on-line and improved by parallel iterations whenever deemed appropriate. It can be used as a post-processing methodology if it is initialized with estimates obtained from another SLAM solver. The applied methodology can be easily implemented in other versions of the SLAM problem, such as the multi-robot version or the SLAM with dynamic environment. Simulations and real experiments show the flexibility and the excellent results of this proposal. | J.Gimenez A.Amicarelli J.M.Toibero F.di Sciascio R.Carelli | 2018 | International Journal of Automation and computing2018，15，3： | 2 |
| 2 | Continuous Probabilistic SLAM Solved via Iterated Conditional Modes显示文摘This article proposes a simultaneous localization and mapping(SLAM) version with continuous probabilistic mapping(CPSLAM), i.e., an algorithm of simultaneous localization and mapping that avoids the use of grids, and thus, does not require a discretized environment. A Markov random field(MRF) is considered to model this SLAM version with high spatial resolution maps. The mapping methodology is based on a point cloud generated by successive observations of the environment, which is kept bounded and representative by including a novel recursive subsampling method. The CP-SLAM problem is solved via iterated conditional modes(ICM), which is a classic algorithm with theoretical convergence over any MRF. The probabilistic maps are the most appropriate to represent dynamic environments, and can be easily implemented in other versions of the SLAM problem, such as the multi-robot version. Simulations and real experiments show the flexibility and excellent performance of this proposal. | J.Gimenez A.Amicarelli J.M.Toibero F.di Sciascio R.Carelli | 2019 | International Journal of Automation and computing2019，16，6： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员