東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Collaborative Multi-Robot Autonomy V...

Shorinwa, Ola.

FindBook

Google Book

Amazon

博客來

Collaborative Multi-Robot Autonomy Via Distributed Optimization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Collaborative Multi-Robot Autonomy Via Distributed Optimization./
作者:	Shorinwa, Ola.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2023,
面頁冊數:	229 p.
附註:	Source: Dissertations Abstracts International, Volume: 85-11, Section: B.
Contained By:	Dissertations Abstracts International85-11B.
標題:	Robots. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31049705
ISBN:	9798382641263

Collaborative Multi-Robot Autonomy Via Distributed Optimization.
Shorinwa, Ola.

Collaborative Multi-Robot Autonomy Via Distributed Optimization. - Ann Arbor : ProQuest Dissertations & Theses, 2023 - 229 p.

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

Thesis (Ph.D.)--Stanford University, 2023.

The high complexity of real-world tasks necessitates the deployment of multi-robot teams, equipped with different onboard sensors and capabilities. Typically, no robot has all the capabilities required to complete the specified task; as a result, the multi-robot team must collaboratetogether to realize the shared objective.This thesis presents distributed algorithms that enable multi-robot teams to operate autonomously while working collaboratively. Specifically, we leverage distributed optimization to derive efficient algorithms that enable multi-robot autonomy in core robotics applications, such as autonomous transportation, search-and-rescue problems, and collaborative object manipulation. Our algorithms are fully-distributed (i.e., our algorithms do not require a central node (station) for any computation or coordination). Rather, each robot communicates with its one-hop(immediate) neighbors over a peer-to-peer communication network.We introduce a distributed optimization algorithm for problems consisting of optimization variables that can be partitionedamong the robots. The proposed algorithm enables robots to avoid unnecessary optimization over irrelevant problem variables, resulting in greater computation and communication efficiency. Problems of this form are prevalent in the field of robotics, e.g., trajectory optimization. We present specialized algorithms for contact-implicit trajectory optimization and model predictive control. Our distributed contact-implicit optimization algorithm enables each robot to make and break contact, as required, to perform complex object manipulation tasks through narrow areas. Further, our distributed algorithm for model predictive control enables each robot to compute the required forces and torques needed to successfully complete a specified multi-robot task. Our algorithms eliminate the need for each robot to compute the torques of other robots, which may not be directly relevant to its performance on the given task. In addition, we present distributed algorithms for multi-robot target tracking and task assignment. Through maximum a-posteriori optimization, we derive a distributed trajectory estimation algorithm that enables each robot to estimate the trajectory of the target without sharing its local (potentially high-dimensional) observations. In addition, we introduce three algorithms for the multi-robot task assignment problem. These algorithms are designed for a broad class of multi-robot systems, considering the broad range of computation and communication resources available to multi-robot teams. In our distributed algorithms, each robot does not share its local problem data (including its local observations) and its objective and constraint functions. Rather, each robot communicates its local problem variable, which is of a generally lower-dimension, reducing the computation and communication overhead associated with our algorithms.

ISBN: 9798382641263Subjects--Topical Terms:

529507
Robots.

Collaborative Multi-Robot Autonomy Via Distributed Optimization.
LDR:03999nmm a2200349 4500 001 2402957
005 20241104055828.5
006 m o d
007 cr#unu||||||||
008 251215s2023 ||||||||||||||||| ||eng d
020 $a 9798382641263
035 $a (MiAaPQ)AAI31049705
035 $a (MiAaPQ)STANFORDbh271xw1994
035 $a AAI31049705
040 $a MiAaPQ $c MiAaPQ
100 1 $a Shorinwa, Ola. $3 3773219
245 1 0 $a Collaborative Multi-Robot Autonomy Via Distributed Optimization.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 229 p.
500 $a Source: Dissertations Abstracts International, Volume: 85-11, Section: B.
500 $a Advisor: Schwager, Mac;Lall, Sanjay;Cutkosky, Mark.
502 $a Thesis (Ph.D.)--Stanford University, 2023.
520 $a The high complexity of real-world tasks necessitates the deployment of multi-robot teams, equipped with different onboard sensors and capabilities. Typically, no robot has all the capabilities required to complete the specified task; as a result, the multi-robot team must collaboratetogether to realize the shared objective.This thesis presents distributed algorithms that enable multi-robot teams to operate autonomously while working collaboratively. Specifically, we leverage distributed optimization to derive efficient algorithms that enable multi-robot autonomy in core robotics applications, such as autonomous transportation, search-and-rescue problems, and collaborative object manipulation. Our algorithms are fully-distributed (i.e., our algorithms do not require a central node (station) for any computation or coordination). Rather, each robot communicates with its one-hop(immediate) neighbors over a peer-to-peer communication network.We introduce a distributed optimization algorithm for problems consisting of optimization variables that can be partitionedamong the robots. The proposed algorithm enables robots to avoid unnecessary optimization over irrelevant problem variables, resulting in greater computation and communication efficiency. Problems of this form are prevalent in the field of robotics, e.g., trajectory optimization. We present specialized algorithms for contact-implicit trajectory optimization and model predictive control. Our distributed contact-implicit optimization algorithm enables each robot to make and break contact, as required, to perform complex object manipulation tasks through narrow areas. Further, our distributed algorithm for model predictive control enables each robot to compute the required forces and torques needed to successfully complete a specified multi-robot task. Our algorithms eliminate the need for each robot to compute the torques of other robots, which may not be directly relevant to its performance on the given task. In addition, we present distributed algorithms for multi-robot target tracking and task assignment. Through maximum a-posteriori optimization, we derive a distributed trajectory estimation algorithm that enables each robot to estimate the trajectory of the target without sharing its local (potentially high-dimensional) observations. In addition, we introduce three algorithms for the multi-robot task assignment problem. These algorithms are designed for a broad class of multi-robot systems, considering the broad range of computation and communication resources available to multi-robot teams. In our distributed algorithms, each robot does not share its local problem data (including its local observations) and its objective and constraint functions. Rather, each robot communicates its local problem variable, which is of a generally lower-dimension, reducing the computation and communication overhead associated with our algorithms.
590 $a School code: 0212.
650 4 $a Robots. $3 529507
650 4 $a Graphs. $3 3685259
650 4 $a Communication. $3 524709
650 4 $a Assignment problem. $3 3682740
650 4 $a Autonomous vehicles. $3 2179092
650 4 $a Robotics. $3 519753
650 4 $a Transportation. $3 555912
690 $a 0459
690 $a 0796
690 $a 0771
690 $a 0709
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 85-11B.
790 $a 0212
791 $a Ph.D.
792 $a 2023
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31049705