Smoothing and Mapping using Multiple Robots

Mapping expansive regions is an arduous and often times incomplete when performed by a single agent. In this paper we illustrate an extension of \texttt{Full SLAM} \cite{Dellaert06ijrr} and \cite{dong}, which ensures smooth maps with loop-closure for multi-robot settings. The current development and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Paga, Karthik, Phaneuf, Joe, Driscoll, Adam, Evans, David
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Paga, Karthik
Phaneuf, Joe
Driscoll, Adam
Evans, David
description Mapping expansive regions is an arduous and often times incomplete when performed by a single agent. In this paper we illustrate an extension of \texttt{Full SLAM} \cite{Dellaert06ijrr} and \cite{dong}, which ensures smooth maps with loop-closure for multi-robot settings. The current development and the associated mathematical formulation ensure without loss of generality the applicability of full bundle adjustment approach for multiple robots operating in relatively static environments. We illustrate the efficacy of this system by presenting relevant results from experiments performed in an indoor setting. In addition to end-to-end description of the pipeline for performing smoothing and mapping \texttt{SAM} with a fleet of robots, we discuss a one-time prior estimation technique that ensures the incremental concatenation of measurements from respective robots in order to generate one smooth global map - thus emulating large scale mapping with single robot. Along with an interpretation of the non-linear estimates, we present necessary implementation details for adopting this SAM system.
doi_str_mv 10.48550/arxiv.1805.02141
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1805_02141</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1805_02141</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-4ca45e03743c0943eec6dba410395489170243886410502c09390ac3cf8464633</originalsourceid><addsrcrecordid>eNotjk8PwUAUxPfiIPgATnqX1tu-t9vtUcS_hEhwb561aFLatCV8e4rLzGQymfyE6EsIyCgFIy6f6SOQBlQAoSTZFsPdNc_rS3o7e3w7emsuiibfq0bX96xOi8x52_yQ11VXtE6cVa73947Yz6b7ycJfbebLyXjls46kT5ZJOcCI0EJM6JzVxwOTBIwVmVhGEBIaoz-NgvCzwRjYoj0Z0qQRO2Lwu_3SJkWZXrl8JQ118qXGN0fjOiQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Smoothing and Mapping using Multiple Robots</title><source>arXiv.org</source><creator>Paga, Karthik ; Phaneuf, Joe ; Driscoll, Adam ; Evans, David</creator><creatorcontrib>Paga, Karthik ; Phaneuf, Joe ; Driscoll, Adam ; Evans, David</creatorcontrib><description>Mapping expansive regions is an arduous and often times incomplete when performed by a single agent. In this paper we illustrate an extension of \texttt{Full SLAM} \cite{Dellaert06ijrr} and \cite{dong}, which ensures smooth maps with loop-closure for multi-robot settings. The current development and the associated mathematical formulation ensure without loss of generality the applicability of full bundle adjustment approach for multiple robots operating in relatively static environments. We illustrate the efficacy of this system by presenting relevant results from experiments performed in an indoor setting. In addition to end-to-end description of the pipeline for performing smoothing and mapping \texttt{SAM} with a fleet of robots, we discuss a one-time prior estimation technique that ensures the incremental concatenation of measurements from respective robots in order to generate one smooth global map - thus emulating large scale mapping with single robot. Along with an interpretation of the non-linear estimates, we present necessary implementation details for adopting this SAM system.</description><identifier>DOI: 10.48550/arxiv.1805.02141</identifier><language>eng</language><subject>Computer Science - Robotics</subject><creationdate>2018-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1805.02141$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1805.02141$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Paga, Karthik</creatorcontrib><creatorcontrib>Phaneuf, Joe</creatorcontrib><creatorcontrib>Driscoll, Adam</creatorcontrib><creatorcontrib>Evans, David</creatorcontrib><title>Smoothing and Mapping using Multiple Robots</title><description>Mapping expansive regions is an arduous and often times incomplete when performed by a single agent. In this paper we illustrate an extension of \texttt{Full SLAM} \cite{Dellaert06ijrr} and \cite{dong}, which ensures smooth maps with loop-closure for multi-robot settings. The current development and the associated mathematical formulation ensure without loss of generality the applicability of full bundle adjustment approach for multiple robots operating in relatively static environments. We illustrate the efficacy of this system by presenting relevant results from experiments performed in an indoor setting. In addition to end-to-end description of the pipeline for performing smoothing and mapping \texttt{SAM} with a fleet of robots, we discuss a one-time prior estimation technique that ensures the incremental concatenation of measurements from respective robots in order to generate one smooth global map - thus emulating large scale mapping with single robot. Along with an interpretation of the non-linear estimates, we present necessary implementation details for adopting this SAM system.</description><subject>Computer Science - Robotics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjk8PwUAUxPfiIPgATnqX1tu-t9vtUcS_hEhwb561aFLatCV8e4rLzGQymfyE6EsIyCgFIy6f6SOQBlQAoSTZFsPdNc_rS3o7e3w7emsuiibfq0bX96xOi8x52_yQ11VXtE6cVa73947Yz6b7ycJfbebLyXjls46kT5ZJOcCI0EJM6JzVxwOTBIwVmVhGEBIaoz-NgvCzwRjYoj0Z0qQRO2Lwu_3SJkWZXrl8JQ118qXGN0fjOiQ</recordid><startdate>20180505</startdate><enddate>20180505</enddate><creator>Paga, Karthik</creator><creator>Phaneuf, Joe</creator><creator>Driscoll, Adam</creator><creator>Evans, David</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20180505</creationdate><title>Smoothing and Mapping using Multiple Robots</title><author>Paga, Karthik ; Phaneuf, Joe ; Driscoll, Adam ; Evans, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-4ca45e03743c0943eec6dba410395489170243886410502c09390ac3cf8464633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science - Robotics</topic><toplevel>online_resources</toplevel><creatorcontrib>Paga, Karthik</creatorcontrib><creatorcontrib>Phaneuf, Joe</creatorcontrib><creatorcontrib>Driscoll, Adam</creatorcontrib><creatorcontrib>Evans, David</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Paga, Karthik</au><au>Phaneuf, Joe</au><au>Driscoll, Adam</au><au>Evans, David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Smoothing and Mapping using Multiple Robots</atitle><date>2018-05-05</date><risdate>2018</risdate><abstract>Mapping expansive regions is an arduous and often times incomplete when performed by a single agent. In this paper we illustrate an extension of \texttt{Full SLAM} \cite{Dellaert06ijrr} and \cite{dong}, which ensures smooth maps with loop-closure for multi-robot settings. The current development and the associated mathematical formulation ensure without loss of generality the applicability of full bundle adjustment approach for multiple robots operating in relatively static environments. We illustrate the efficacy of this system by presenting relevant results from experiments performed in an indoor setting. In addition to end-to-end description of the pipeline for performing smoothing and mapping \texttt{SAM} with a fleet of robots, we discuss a one-time prior estimation technique that ensures the incremental concatenation of measurements from respective robots in order to generate one smooth global map - thus emulating large scale mapping with single robot. Along with an interpretation of the non-linear estimates, we present necessary implementation details for adopting this SAM system.</abstract><doi>10.48550/arxiv.1805.02141</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1805.02141
ispartof
issn
language eng
recordid cdi_arxiv_primary_1805_02141
source arXiv.org
subjects Computer Science - Robotics
title Smoothing and Mapping using Multiple Robots
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T09%3A58%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Smoothing%20and%20Mapping%20using%20Multiple%20Robots&rft.au=Paga,%20Karthik&rft.date=2018-05-05&rft_id=info:doi/10.48550/arxiv.1805.02141&rft_dat=%3Carxiv_GOX%3E1805_02141%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true