A Hierarchical Multi-Robot Mapping Architecture Subject to Communication Constraints

Multi-robot systems are an efficient method to explore and map an unknown environment. The simulataneous localization and mapping (SLAM) algorithm is common for single robot systems, however multiple robots can share respective map data in order to merge a larger global map. This thesis contributes...

Full description

Saved in:
Bibliographic Details
Main Author Cappel, Henry Fielding
Format Journal Article
LanguageEnglish
Published 02.02.2021
Subjects
Computer Science - Robotics
Online AccessGet full text
DOI10.48550/arxiv.2102.01641

Cover

Abstract Multi-robot systems are an efficient method to explore and map an unknown environment. The simulataneous localization and mapping (SLAM) algorithm is common for single robot systems, however multiple robots can share respective map data in order to merge a larger global map. This thesis contributes to the multi-robot mapping problem by considering cases in which robots have communication range limitations. The architecture coordinates a team of robots and the central server to explore an unknown environment by exploiting a hierarchical choice structure. The coordination algorithms ensure that the hierarchy of robots choose frontier points that provide maximum information gain, while maintaining viable communication amongst themselves and the central computer through an ad-hoc relay network. In addition, the robots employ a backup choice algorithm in cases when no valid frontier points remain by arranging the communication relay network as a fireline back to the source. This work contributes a scalable, efficient, and robust architecture towards hybrid multi-robot mapping systems that take into account communication range limitations. The architecture is tested in a simulation environment using various maps.
AbstractList Multi-robot systems are an efficient method to explore and map an unknown environment. The simulataneous localization and mapping (SLAM) algorithm is common for single robot systems, however multiple robots can share respective map data in order to merge a larger global map. This thesis contributes to the multi-robot mapping problem by considering cases in which robots have communication range limitations. The architecture coordinates a team of robots and the central server to explore an unknown environment by exploiting a hierarchical choice structure. The coordination algorithms ensure that the hierarchy of robots choose frontier points that provide maximum information gain, while maintaining viable communication amongst themselves and the central computer through an ad-hoc relay network. In addition, the robots employ a backup choice algorithm in cases when no valid frontier points remain by arranging the communication relay network as a fireline back to the source. This work contributes a scalable, efficient, and robust architecture towards hybrid multi-robot mapping systems that take into account communication range limitations. The architecture is tested in a simulation environment using various maps.
Author Cappel, Henry Fielding
Author_xml – sequence: 1
  givenname: Henry Fielding
  surname: Cappel
  fullname: Cappel, Henry Fielding
BackLink https://doi.org/10.48550/arXiv.2102.01641$$DView paper in arXiv
BookMark eNqFTr0OgjAY7KCDPzyAk98LgC2CcSVEw8Ki7KSQqp-BlpSvRt9eIO5Od5e7y92SzbTRirGN4EF0jGO-k_aNryAUPAy4OERiwYoEMlRW2vqBtWwgdw2hfzGVIchl16G-QzKapGpyVsHVVc-BAhlITds6PdQIjR6U7slK1NSv2fwmm155P1yx7flUpJk_7ZedxVbaTzn-KKcf-_-JL29XQAc
ContentType Journal Article
Copyright http://creativecommons.org/licenses/by-nc-sa/4.0
Copyright_xml – notice: http://creativecommons.org/licenses/by-nc-sa/4.0
DBID AKY
GOX
DOI 10.48550/arxiv.2102.01641
DatabaseName arXiv Computer Science
arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 2102_01641
GroupedDBID AKY
GOX
ID FETCH-arxiv_primary_2102_016413
IEDL.DBID GOX
IngestDate Tue Jul 22 23:15:04 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-arxiv_primary_2102_016413
OpenAccessLink https://arxiv.org/abs/2102.01641
ParticipantIDs arxiv_primary_2102_01641
PublicationCentury 2000
PublicationDate 2021-02-02
PublicationDateYYYYMMDD 2021-02-02
PublicationDate_xml – month: 02
  year: 2021
  text: 2021-02-02
  day: 02
PublicationDecade 2020
PublicationYear 2021
Score 3.4995823
SecondaryResourceType preprint
Snippet Multi-robot systems are an efficient method to explore and map an unknown environment. The simulataneous localization and mapping (SLAM) algorithm is common...
SourceID arxiv
SourceType Open Access Repository
SubjectTerms Computer Science - Robotics
Title A Hierarchical Multi-Robot Mapping Architecture Subject to Communication Constraints
URI https://arxiv.org/abs/2102.01641
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV1NSwMxEB1qT17EolK_5-A1WjLZbXtcpHURqiAV9rYku1EK4kobxZ9vZrZiPfSaDGFICDNvkvcG4Mr4aug0kUpHjpRJnVGW7EANKpP4l-HYaaGLzR7S_NncF0nRAfzlwtjl9-Kr1Qd2qxvGI9csAhXxzY7WDK7uHov2cVKkuNb2f3Yxx5ShjSAx3Ye9dXaHWXscPej49wOYZ5gvmOcrbUfeUDiv6qlxTcCZZX2EV8w26vkYLzNXRzA0-I-_gdxdU3o6hNUhXE4n89tciR_lRysaUbKLpbhIR9CN0N73Ab02fuyIam8TQ1bbumJaXMyqomFC9TH0t61ysn3qFHY1_7zgv8X6DLph-enPY-gM7kL27wdGQXPa
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Hierarchical+Multi-Robot+Mapping+Architecture+Subject+to+Communication+Constraints&rft.au=Cappel%2C+Henry+Fielding&rft.date=2021-02-02&rft_id=info:doi/10.48550%2Farxiv.2102.01641&rft.externalDocID=2102_01641