東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Rigid formations and control of dist...

McCoy, Lester.

FindBook

Google Book

Amazon

博客來

Rigid formations and control of distributed groups of mobile robots.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Rigid formations and control of distributed groups of mobile robots./
作者:	McCoy, Lester.
面頁冊數:	125 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-04, Section: B, page: .
Contained By:	Dissertation Abstracts International72-04B.
標題:	Engineering, Mechanical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3445693
ISBN:	9781124491455

Rigid formations and control of distributed groups of mobile robots.
McCoy, Lester.

Rigid formations and control of distributed groups of mobile robots. - 125 p.

Source: Dissertation Abstracts International, Volume: 72-04, Section: B, page: .

Thesis (Ph.D.)--Boston University, 2011.

Planar rigid formations are of great interest in the field of robotics. In this dissertation, we model the interaction between robots using concepts from group theory and graph theory, and present an algorithmic approach for the enumeration of all minimally-rigid, acyclic, directed graphs. Minimally-rigid formations are those in which all inter-agent distances between robots must remain fixed, but would fail to be rigid through the removal of an edge (realized as a controlled relative distance between a pair of agents). Minimally rigid formations make maximally parsimonious use of relative configuration sensing, and are useful as a means of avoiding possible sensor based instabilities due to the presence of calibration errors and noise in the measurements. We show that there is exponential complexity in the number of possible formations as the number of agents increases. We describe a constructive procedure by which all minimally-rigid, acyclic directed graphs can be created starting with a single directed edge. An algorithm for enumerating all such formations is given. We also show that the formation graphs can be separated into 2 n-2 formation skeletons called stratification classes. A computer algorithm to solve the enumeration problem is discussed in detail and explicit results are given for low-order formations.

ISBN: 9781124491455Subjects--Topical Terms:

783786
Engineering, Mechanical.

Rigid formations and control of distributed groups of mobile robots.
LDR:03304nam 2200289 4500 001 1402416
005 20111028103953.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9781124491455
035 $a (UMI)AAI3445693
035 $a AAI3445693
040 $a UMI $c UMI
100 1 $a McCoy, Lester. $3 1681604
245 1 0 $a Rigid formations and control of distributed groups of mobile robots.
300 $a 125 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-04, Section: B, page: .
500 $a Adviser: John Baillieul.
502 $a Thesis (Ph.D.)--Boston University, 2011.
520 $a Planar rigid formations are of great interest in the field of robotics. In this dissertation, we model the interaction between robots using concepts from group theory and graph theory, and present an algorithmic approach for the enumeration of all minimally-rigid, acyclic, directed graphs. Minimally-rigid formations are those in which all inter-agent distances between robots must remain fixed, but would fail to be rigid through the removal of an edge (realized as a controlled relative distance between a pair of agents). Minimally rigid formations make maximally parsimonious use of relative configuration sensing, and are useful as a means of avoiding possible sensor based instabilities due to the presence of calibration errors and noise in the measurements. We show that there is exponential complexity in the number of possible formations as the number of agents increases. We describe a constructive procedure by which all minimally-rigid, acyclic directed graphs can be created starting with a single directed edge. An algorithm for enumerating all such formations is given. We also show that the formation graphs can be separated into 2 n-2 formation skeletons called stratification classes. A computer algorithm to solve the enumeration problem is discussed in detail and explicit results are given for low-order formations.
520 $a Next, we discuss the embeddings of these minimally rigid formations into various geometric shapes via the use of planar point lattices. By doing so, we investigate how the number of possible formations changes given constraints placed upon the overall geometry of the formation. We present embedding results subject to edge length constraints. This thesis also describes several problems in the controlled aggregation of robots to create minimally rigid formations. We develop a non-holonomic controller which will guide a robot from an initial location to a set distance away from a pair of other robots. We investigate stability properties of this control law and provide simulation results investigating agents in triangular configurations. Using formation shape deformation metrics, we explore how the properties of a class of distributed sensing control laws behave under changes in the lead robot trajectory in a triangular formation. This thesis concludes with an application in which a switched mode control law can be used to guide a robot through a lattice of obstacles.
590 $a School code: 0017.
650 4 $a Engineering, Mechanical. $3 783786
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0548
690 $a 0771
710 2 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 72-04B.
790 1 0 $a Baillieul, John, $e advisor
790 $a 0017
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3445693