期刊名称:TELKOMNIKA (Telecommunication Computing Electronics and Control)
印刷版ISSN:2302-9293
出版年度:2015
卷号:13
期号:1
页码:93-102
DOI:10.12928/telkomnika.v13i1.1275
出版社:Universitas Ahmad Dahlan
摘要:For the tremendously increasing of system state in wild field, the computational complexities of mobile robot system should be taken into account. This paper proposes a hierarchical-map updating approach for simultaneous localization and mapping of robots. The basic idea of hierarchical-map is defining two kinds of maps during the recursive updating process, namely local map (upper map) and global map (lower map). The system states will be updated by the preset maps. The hierarchical-map updating process is just for the upper map and the lower map is updated after a certain running term. In the calculation, the state data of the upper map is far less than that of the lower map. It is validated by the experiments that, the approach is more optimal than others in computational complexities while ensuring the consistency estimate.
其他摘要:For the tremendously increasing of system state in wild field, the computational complexities of mobile robot system should be taken into account. This paper proposes a hierarchical-map updating approach for simultaneous localization and mapping of robots. The basic idea of hierarchical-map is defining two kinds of maps during the recursive updating process, namely local map (upper map) and global map (lower map). The system states will be updated by the preset maps. The hierarchical-map updating process is just for the upper map and the lower map is updated after a certain running term. In the calculation, the state data of the upper map is far less than that of the lower map. It is validated by the experiments that, the approach is more optimal than others in computational complexities while ensuring the consistency estimate.