Asynchronous and Parallel Distributed Pose Graph Optimization

We present Asynchronous Stochastic Parallel Pose Graph Optimization (<inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>), the first asynchronous algorithm for distributed pose graph optimization (PGO) in multi-robot simultaneous l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE robotics and automation letters Ročník 5; číslo 4; s. 5819 - 5826
Hlavní autoři: Tian, Yulun, Koppel, Alec, Bedi, Amrit Singh, How, Jonathan P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2377-3766, 2377-3766
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We present Asynchronous Stochastic Parallel Pose Graph Optimization (<inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>), the first asynchronous algorithm for distributed pose graph optimization (PGO) in multi-robot simultaneous localization and mapping. By enabling robots to optimize their local trajectory estimates without synchronization, <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> offers resiliency against communication delays and alleviates the need to wait for stragglers in the network. Furthermore, <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> can be applied on the rank-restricted relaxations of PGO, a crucial class of non-convex Riemannian optimization problems that underlies recent breakthroughs on globally optimal PGO. Under bounded delay, we establish the global first-order convergence of <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> using a sufficiently small stepsize. The derived stepsize depends on the worst-case delay and inherent problem sparsity, and furthermore matches known result for synchronous algorithms when there is no delay. Numerical evaluations on simulated and real-world datasets demonstrate favorable performance compared to state-of-the-art synchronous approach, and show <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>'s resilience against a wide range of delays in practice.
AbstractList We present Asynchronous Stochastic Parallel Pose Graph Optimization ([Formula Omitted]), the first asynchronous algorithm for distributed pose graph optimization (PGO) in multi-robot simultaneous localization and mapping. By enabling robots to optimize their local trajectory estimates without synchronization, [Formula Omitted] offers resiliency against communication delays and alleviates the need to wait for stragglers in the network. Furthermore, [Formula Omitted] can be applied on the rank-restricted relaxations of PGO, a crucial class of non-convex Riemannian optimization problems that underlies recent breakthroughs on globally optimal PGO. Under bounded delay, we establish the global first-order convergence of [Formula Omitted] using a sufficiently small stepsize. The derived stepsize depends on the worst-case delay and inherent problem sparsity, and furthermore matches known result for synchronous algorithms when there is no delay. Numerical evaluations on simulated and real-world datasets demonstrate favorable performance compared to state-of-the-art synchronous approach, and show [Formula Omitted]'s resilience against a wide range of delays in practice.
We present Asynchronous Stochastic Parallel Pose Graph Optimization (<inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>), the first asynchronous algorithm for distributed pose graph optimization (PGO) in multi-robot simultaneous localization and mapping. By enabling robots to optimize their local trajectory estimates without synchronization, <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> offers resiliency against communication delays and alleviates the need to wait for stragglers in the network. Furthermore, <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> can be applied on the rank-restricted relaxations of PGO, a crucial class of non-convex Riemannian optimization problems that underlies recent breakthroughs on globally optimal PGO. Under bounded delay, we establish the global first-order convergence of <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula> using a sufficiently small stepsize. The derived stepsize depends on the worst-case delay and inherent problem sparsity, and furthermore matches known result for synchronous algorithms when there is no delay. Numerical evaluations on simulated and real-world datasets demonstrate favorable performance compared to state-of-the-art synchronous approach, and show <inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>'s resilience against a wide range of delays in practice.
Author Tian, Yulun
How, Jonathan P.
Bedi, Amrit Singh
Koppel, Alec
Author_xml – sequence: 1
  givenname: Yulun
  orcidid: 0000-0002-9017-3022
  surname: Tian
  fullname: Tian, Yulun
  email: yulun@mit.edu
  organization: Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA
– sequence: 2
  givenname: Alec
  orcidid: 0000-0003-2447-2873
  surname: Koppel
  fullname: Koppel, Alec
  email: alec.e.koppel.civ@mail.mil
  organization: U.S. Army Research Laboratory, Adelphi, MD, USA
– sequence: 3
  givenname: Amrit Singh
  orcidid: 0000-0002-8807-2695
  surname: Bedi
  fullname: Bedi, Amrit Singh
  email: amrit0714@gmail.com
  organization: U.S. Army Research Laboratory, Adelphi, MD, USA
– sequence: 4
  givenname: Jonathan P.
  orcidid: 0000-0001-8576-1930
  surname: How
  fullname: How, Jonathan P.
  email: jhow@mit.edu
  organization: Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA
BookMark eNp9kEFLAzEQRoNUsNbeBS8LnrfOJLuJOXgoVatQqIieQ3abpSnbzZpkD_XXu7VFxIOnGYbvzTDvnAwa1xhCLhEmiCBvFq_TCQUKEwYIFPkJGVImRMoE54Nf_RkZh7ABAMypYDIfkrtp2DXl2rvGdSHRzSp50V7XtamTexuit0UXTT90wSRzr9t1smyj3dpPHa1rLshppetgxsc6Iu-PD2-zp3SxnD_Ppou0pBJjKjjlXEvQaORtAYKziudFVjFcSTR5LmhlmJGASEuQXPCqoLkGKApGDWrNRuT6sLf17qMzIaqN63zTn1Q0o1ICE8D7FBxSpXcheFOp1tut9juFoPaeVO9J7T2po6ce4X-Q0sbv16LXtv4PvDqA1hjzc0dixrKMsi_MRnUG
CODEN IRALC6
CitedBy_id crossref_primary_10_1109_TRO_2025_3526295
crossref_primary_10_1109_LRA_2021_3100938
crossref_primary_10_1109_TRO_2023_3324127
crossref_primary_10_1109_TRO_2023_3327635
crossref_primary_10_1016_j_automatica_2024_111654
crossref_primary_10_1109_MRA_2024_3352852
crossref_primary_10_1109_TRO_2021_3072346
crossref_primary_10_1109_TRO_2023_3324818
crossref_primary_10_1109_TITS_2024_3438165
crossref_primary_10_1007_s00138_021_01268_5
crossref_primary_10_1109_LRA_2020_3010216
crossref_primary_10_3390_s23052399
crossref_primary_10_1109_JSAC_2023_3242708
crossref_primary_10_1109_LRA_2024_3352361
crossref_primary_10_1109_LRA_2024_3382531
crossref_primary_10_3390_drones9070504
crossref_primary_10_1109_TRO_2024_3422003
crossref_primary_10_1109_TRO_2021_3137751
crossref_primary_10_1002_msd2_12098
crossref_primary_10_1109_TIM_2025_3565109
crossref_primary_10_1016_j_measurement_2025_118040
Cites_doi 10.1109/TAC.2014.2351912
10.1109/IROS.2015.7353543
10.1007/s10107-019-01408-w
10.1109/IROS.2010.5652875
10.1109/ICRA.2013.6631323
10.1109/ICRA.2012.6225356
10.1109/ICRA.2018.8461155
10.1109/LRA.2017.2718661
10.1109/LRA.2020.2967681
10.1109/LRA.2020.3010216
10.1177/0278364917732640
10.1137/140961134
10.1177/0278364918784361
10.1109/ICRA.2012.6225066
10.1093/imanum/drx080
10.1109/CDC.2012.6426626
10.1109/TSP.2019.2894803
10.1109/TIT.2006.874516
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/LRA.2020.3010216
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2377-3766
EndPage 5826
ExternalDocumentID 10_1109_LRA_2020_3010216
9143442
Genre orig-research
GrantInformation_xml – fundername: NASA Convergent Aeronautics Solutions project Design Environment for Novel Vertical Lift Vehicles (DELIVER)
– fundername: ARL DCIST
  grantid: W911NF-17-2-0181
GroupedDBID 0R~
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IFIPE
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c291t-76266a90a1e98b0763f65b4f31d91e5572fe3e90112c09676fb25a00bb32e1aa3
IEDL.DBID RIE
ISICitedReferencesCount 26
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000554894900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2377-3766
IngestDate Sun Jun 29 15:19:33 EDT 2025
Sat Nov 29 06:03:08 EST 2025
Tue Nov 18 21:00:09 EST 2025
Wed Aug 27 02:31:16 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-76266a90a1e98b0763f65b4f31d91e5572fe3e90112c09676fb25a00bb32e1aa3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2447-2873
0000-0001-8576-1930
0000-0002-8807-2695
0000-0002-9017-3022
PQID 2429903706
PQPubID 4437225
PageCount 8
ParticipantIDs ieee_primary_9143442
proquest_journals_2429903706
crossref_citationtrail_10_1109_LRA_2020_3010216
crossref_primary_10_1109_LRA_2020_3010216
PublicationCentury 2000
PublicationDate 2020-10-01
PublicationDateYYYYMMDD 2020-10-01
PublicationDate_xml – month: 10
  year: 2020
  text: 2020-10-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE robotics and automation letters
PublicationTitleAbbrev LRA
PublicationYear 2020
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
lian (ref10) 2015
ref15
ref14
ref11
huang (ref29) 2016
ref1
bertsekas (ref3) 1989
absil (ref16) 2009
ref19
jin (ref32) 0
ref18
niu (ref5) 0
ref23
ref26
ref20
tijms (ref25) 2004
ref22
ref21
quigley (ref30) 0
ref28
ref27
lian (ref9) 0
ref8
ref7
criscitiello (ref33) 0
ref4
liu (ref6) 2015
tian (ref2) 2019
fan (ref24) 0
sun (ref31) 0
tron (ref17) 0
References_xml – ident: ref18
  doi: 10.1109/TAC.2014.2351912
– ident: ref23
  doi: 10.1109/IROS.2015.7353543
– year: 2016
  ident: ref29
  article-title: Roptlib: An object-oriented C++ library for optimization on riemannian manifolds
– year: 2009
  ident: ref16
  publication-title: Optimization Algorithms on Matrix Manifolds
– ident: ref11
  doi: 10.1007/s10107-019-01408-w
– ident: ref20
  doi: 10.1109/IROS.2010.5652875
– ident: ref22
  doi: 10.1109/ICRA.2013.6631323
– year: 0
  ident: ref24
  article-title: Generalized proximal methods for pose graph optimization
  publication-title: Proc Int Symp Robot Res
– ident: ref21
  doi: 10.1109/ICRA.2012.6225356
– start-page: 3043
  year: 0
  ident: ref9
  article-title: Asynchronous decentralized parallel stochastic gradient descent
  publication-title: Proc 35th Int Conf Mach Learn
– year: 2015
  ident: ref6
  article-title: An asynchronous parallel stochastic coordinate descent algorithm
  publication-title: J Mach Learn Res
– ident: ref14
  doi: 10.1109/ICRA.2018.8461155
– ident: ref13
  doi: 10.1109/LRA.2017.2718661
– year: 1989
  ident: ref3
  publication-title: Parallel and Distributed Computation Numerical Methods
– start-page: 901
  year: 0
  ident: ref17
  article-title: Distributed image-based 3D localization of camera sensor networks
  publication-title: Proc 48th IEEE Conf Decis Control
– ident: ref15
  doi: 10.1109/LRA.2020.2967681
– ident: ref27
  doi: 10.1109/LRA.2020.3010216
– ident: ref1
  doi: 10.1177/0278364917732640
– year: 0
  ident: ref33
  article-title: Efficiently escaping saddle points on manifolds
  publication-title: Proc NeurIPS
– ident: ref7
  doi: 10.1137/140961134
– start-page: 693
  year: 0
  ident: ref5
  article-title: HOGWILD: A lock-free approach to parallelizing stochastic gradient descent
  publication-title: Proc 24th Int Conf Neural Inf Process Syst
– start-page: 6183
  year: 0
  ident: ref31
  article-title: Asynchronous coordinate descent under more realistic assumption
  publication-title: Proc 31st Int Conf Neural Inf Process Syst
– ident: ref12
  doi: 10.1177/0278364918784361
– year: 2019
  ident: ref2
  article-title: Distributed certifiably correct pose-graph optimization
– year: 2004
  ident: ref25
  publication-title: A First Course in Stochastic Models
– ident: ref19
  doi: 10.1109/ICRA.2012.6225066
– ident: ref28
  doi: 10.1093/imanum/drx080
– ident: ref4
  doi: 10.1109/CDC.2012.6426626
– start-page: 1724
  year: 0
  ident: ref32
  article-title: How to escape saddle points efficiently
  publication-title: Proc 34th Int Conf Mach Learn
– start-page: 2737
  year: 2015
  ident: ref10
  article-title: Asynchronous parallel stochastic gradient for nonconvex optimization
  publication-title: Proc 28th Int Conf Neural Inf Process Syst
– ident: ref8
  doi: 10.1109/TSP.2019.2894803
– ident: ref26
  doi: 10.1109/TIT.2006.874516
– year: 0
  ident: ref30
  article-title: ROS: An open-source robot operating system
  publication-title: ICRA Workshop on Open Source Software
SSID ssj0001527395
Score 2.3037853
Snippet We present Asynchronous Stochastic Parallel Pose Graph Optimization (<inline-formula><tex-math notation="LaTeX">\textsc {ASAPP}</tex-math></inline-formula>),...
We present Asynchronous Stochastic Parallel Pose Graph Optimization ([Formula Omitted]), the first asynchronous algorithm for distributed pose graph...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 5819
SubjectTerms Algorithms
Computer simulation
Convergence
Delay
Delays
distributed robot systems
localization
Manifolds
mapping
Multiple robots
Optimization
optimization and optimal control
Resilience
Robot kinematics
Simultaneous localization and mapping
SLAM
Synchronism
Trajectory analysis
Trajectory optimization
Title Asynchronous and Parallel Distributed Pose Graph Optimization
URI https://ieeexplore.ieee.org/document/9143442
https://www.proquest.com/docview/2429903706
Volume 5
WOSCitedRecordID wos000554894900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2377-3766
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001527395
  issn: 2377-3766
  databaseCode: RIE
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2377-3766
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001527395
  issn: 2377-3766
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7M4UEP_pridI4evAjWtWmbNAcPQzc96ByisFtJ0hcQZif7IXjxbzfJuqkogrdSkkf5XvteX5L3fQDHKLRiPBW-lhz9mNHE52mufIFJYtyPVDDlxCZYr5cOBrxfgdNlLwwiusNneGYv3V5-PlIzu1TW4ia5x7EJuCuM0Xmv1ud6imUS48liJzLgrZv7tqn_iClLnX41_ZZ5nJTKj_jrkkp383-PswUb5c-j1557exsqWOzA-hdKwRqctydvhbKMt6ak90SRe30xtnopQ-_ScuRaeSs0N0cT9K4sWbV3Z4LGc9mNuQuP3c7DxbVfSiT4ivBw6ptQRqnggQiRpzIwwULTRMY6CnMeWriJxghteylRplhhVEuSiCCQMiIYChHtQbUYFbgPHtOckTjX1BqQxjymBCWPlFDaVDmyDq0FfJkq-cOtjMUwc3VEwDMDeGYBz0rA63CynPEy5874Y2zNArwcV2Jbh8bCQ1n5cU0y4nJoxAJ68PusQ1iztudn7hpQnY5neASr6nX6NBk3YeX2vdN0b88HYabCKQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH6MKagHf01xOrUHL4J1bdqmzcHDUOfEOYdM2K0k6QsIs5P9EPzvTbJuKorgqaUkafle-15fkvd9ACfIlYxZwl0lGLphTCOXJZl0OUaRNj9SHksrNhF3Okm_z7olOFvUwiCi3XyG5-bUruVnQzk1U2V1poN7GGqHuxTpgzer1vqcUTFcYiyar0V6rN5-bOgMkOjE1CpY02-xx4qp_PDANqw0N_73QJuwXvw-Oo2ZvbeghPk2rH0hFazARWP8nkvDeauTeofnmdPlI6OYMnCuDEuuEbhCfXE4RufG0FU7D9ptvBT1mDvw1LzuXbbcQiTBlYT5E1c7M0o587iPLBGedheKRiJUgZ8x3wBOFAZoCkyJ1OlKTJUgEfc8IQKCPufBLpTzYY574MSKxSTMFDUDCD08JgQFCySXSuc5ogr1OXypLBjEjZDFILWZhMdSDXhqAE8LwKtwuujxOmPP-KNtxQC8aFdgW4Xa3EJp8XmNU2KjaBB7dP_3Xsew0urdt9P2befuAFbNfWY78GpQnoymeAjL8m3yPB4d2XfoAw4UxD8
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=Asynchronous+and+Parallel+Distributed+Pose+Graph+Optimization&rft.jtitle=IEEE+robotics+and+automation+letters&rft.au=Tian%2C+Yulun&rft.au=Koppel%2C+Alec&rft.au=Amrit+Singh+Bedi&rft.au=How%2C+Jonathan+P&rft.date=2020-10-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.eissn=2377-3766&rft.volume=5&rft.issue=4&rft.spage=5819&rft_id=info:doi/10.1109%2FLRA.2020.3010216&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2377-3766&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2377-3766&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2377-3766&client=summon