國立虎尾科技大學 |

Algorithms and Systems for Scalable Multi-agent Geometric Estimation.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Algorithms and Systems for Scalable Multi-agent Geometric Estimation./
Author:	Tian, Yulun.
Description:	1 online resource (355 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
Contained By:	Dissertations Abstracts International85-10B.
Subject:	Applied mathematics. -
Online resource:	click for full text (PQDT)
ISBN:	9798381955521

Algorithms and Systems for Scalable Multi-agent Geometric Estimation.
Tian, Yulun.

Algorithms and Systems for Scalable Multi-agent Geometric Estimation. - 1 online resource (355 pages)

Source: Dissertations Abstracts International, Volume: 85-10, Section: B.

Thesis (Ph.D.)--Massachusetts Institute of Technology, 2023.

Includes bibliographical references

Collaborative geometric estimation, which enables multiple agents to construct globally consistent geometric models of the environment (e.g., maps and robot poses) from noisy local measurements, is a crucial capability for multi-agent systems. However, achieving scalable collaborative estimation in the real world is challenging. On one hand, solving the underlying geometric optimization problems is hard due to the coupling among agents and poor numerical conditioning. On the other hand, real-world communication networks impose operational constraints (e.g., in the form of available bandwidth) that need to be accounted for during deployment.This thesis develops algorithms and systems toward enabling scalable collaborative geometric estimation, with a focus on tackling the aforementioned technical challenges. The first part of this thesis considers geometric estimation under a fully distributed communication architecture, in which agents directly communicate with each other without relying on a central server. To this end, this thesis presents distributed pose graph optimization algorithms with the goals of achieving certifiable global optimality and convergence under asynchronous communication. Leveraging the developed algorithms, this thesis then develops a complete system for distributed simultaneous localization and mapping (SLAM), and demonstrates the proposed system in large-scale urban environments where up to 8 ground robots traverse a total distance close to 8 km. The second part of this thesis tackles geometric estimation under a server-client architecture, where a server coordinates communication during collaborative optimization. To this end, this thesis presents a communication-efficient solver that enables large-scale collaborative mapping with significantly reduced communication. Furthermore, specialized solvers for collaborative rotation averaging and translation estimation are developed, which exploit spectral graph theoretic methods to achieve fast convergence. These algorithmic contributions, together with open-source code and datasets, facilitate the development of scalable multi-agent perception systems in complex environments.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798381955521Subjects--Topical Terms:

1069907
Applied mathematics.
Subjects--Index Terms:

Simultaneous localization and mapping Index Terms--Genre/Form:

554714
Electronic books.

Algorithms and Systems for Scalable Multi-agent Geometric Estimation.
LDR:03571ntm a22003737 4500 001 1151221
005 20241104055831.5
006 m o d
007 cr bn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798381955521
035 $a (MiAaPQ)AAI31091287
035 $a (MiAaPQ)MIT1721_1_152675
035 $a AAI31091287
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Tian, Yulun. $3 1477949
245 1 0 $a Algorithms and Systems for Scalable Multi-agent Geometric Estimation.
264 0 $c 2023
300 $a 1 online resource (355 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
500 $a Advisor: How, Jonathan P.;Jadbabaie, Ali;Carlone, Luca.
502 $a Thesis (Ph.D.)--Massachusetts Institute of Technology, 2023.
504 $a Includes bibliographical references
520 $a Collaborative geometric estimation, which enables multiple agents to construct globally consistent geometric models of the environment (e.g., maps and robot poses) from noisy local measurements, is a crucial capability for multi-agent systems. However, achieving scalable collaborative estimation in the real world is challenging. On one hand, solving the underlying geometric optimization problems is hard due to the coupling among agents and poor numerical conditioning. On the other hand, real-world communication networks impose operational constraints (e.g., in the form of available bandwidth) that need to be accounted for during deployment.This thesis develops algorithms and systems toward enabling scalable collaborative geometric estimation, with a focus on tackling the aforementioned technical challenges. The first part of this thesis considers geometric estimation under a fully distributed communication architecture, in which agents directly communicate with each other without relying on a central server. To this end, this thesis presents distributed pose graph optimization algorithms with the goals of achieving certifiable global optimality and convergence under asynchronous communication. Leveraging the developed algorithms, this thesis then develops a complete system for distributed simultaneous localization and mapping (SLAM), and demonstrates the proposed system in large-scale urban environments where up to 8 ground robots traverse a total distance close to 8 km. The second part of this thesis tackles geometric estimation under a server-client architecture, where a server coordinates communication during collaborative optimization. To this end, this thesis presents a communication-efficient solver that enables large-scale collaborative mapping with significantly reduced communication. Furthermore, specialized solvers for collaborative rotation averaging and translation estimation are developed, which exploit spectral graph theoretic methods to achieve fast convergence. These algorithmic contributions, together with open-source code and datasets, facilitate the development of scalable multi-agent perception systems in complex environments.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Computer science. $3 573171
650 4 $a Information technology. $3 559429
653 $a Simultaneous localization and mapping
653 $a Server-client architecture
655 7 $a Electronic books. $2 local $3 554714
690 $a 0489
690 $a 0984
690 $a 0364
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Massachusetts Institute of Technology. $b Department of Aeronautics and Astronautics. $3 1464825
773 0 $t Dissertations Abstracts International $g 85-10B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31091287 $z click for full text (PQDT)