HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Engineering / Faculty of Engineering >
Peer-reviewed Journal Articles, etc >

On Sharing Spatial Data with Uncertainty Integration Amongst Multiple Robots Having Different Maps

This item is licensed under: Creative Commons Attribution 4.0 International

Files in This Item:

The file(s) associated with this item can be obtained from the following URL:https://doi.org/10.3390/app9132753


Title: On Sharing Spatial Data with Uncertainty Integration Amongst Multiple Robots Having Different Maps
Authors: Ravankar, Abhijeet Browse this author
Ravankar, Ankit A. Browse this author
Hoshino, Yohei Browse this author →KAKEN DB
Kobayashi, Yukinori Browse this author →KAKEN DB
Keywords: information sharing
multi-robot systems
positional uncertainty
path planning
mapping
Issue Date: 1-Jul-2019
Publisher: MDPI
Journal Title: Applied sciences
Volume: 9
Issue: 13
Start Page: 2753
Publisher DOI: 10.3390/app9132753
Abstract: Information sharing is a powerful feature of multi-robot systems. Sharing information precisely and accurately is important and has many benefits. Particularly, smart information sharing can improve robot path planning. If a robot finds a new obstacle or blocked path, it can share this information with other remote robots allowing them to plan better paths. However, there are two problems with such information sharing. First, the maps of the robots may be different in nature (e.g., 2D grid-map, 3D semantic map, feature map etc.) as the sensors used by the robots for mapping and localization may be different. Even the maps generated using the same sensor (e.g., Lidar) can vary in scale or rotation and the sensors used might have different specifications like resolution or range. In such scenarios, the correspondence problem' in different maps is a critical bottleneck in information sharing. Second, the transience of the obstacles has to be considered while also considering the positional uncertainty of the new obstacles while sharing information. In our previous work, we proposed a node-map' with a confidence decay mechanism to solve this problem. However, the previous work had many limitations due to the decoupling of new obstacle's positional uncertainty and confidence decay. Moreover, the previous work applied only to homogeneous maps. In addition, the previous model worked only with static obstacles in the environment. The current work extends our previous work in three main ways: (1) we extend the previous work by integrating positional uncertainty in the confidence decay mechanism and mathematically model the transience of newly added or removed obstacles and discuss its merits; (2) we extend the previous work by considering information sharing in heterogeneous maps build using different sensors; and (3) we consider dynamic obstacles like moving people in the environment and test the proposed method in complex scenarios. All the experiments are performed in real environments and with actual robots and results are discussed.
Rights: © 2019 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/).
http://creativecommons.org/licenses/by/4.0/
Type: article
URI: http://hdl.handle.net/2115/75334
Appears in Collections:工学院・工学研究院 (Graduate School of Engineering / Faculty of Engineering) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University