東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Motion coordination for mobile robot...

Ganguli, Anurag.

FindBook

Google Book

Amazon

博客來

Motion coordination for mobile robotic networks with visibility sensors.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Motion coordination for mobile robotic networks with visibility sensors./
作者:	Ganguli, Anurag.
面頁冊數:	159 p.
附註:	Adviser: Francesco Bullo.
Contained By:	Dissertation Abstracts International69-02B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3301134
ISBN:	9780549465652

Motion coordination for mobile robotic networks with visibility sensors.
Ganguli, Anurag.

Motion coordination for mobile robotic networks with visibility sensors. - 159 p.

Adviser: Francesco Bullo.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.

The subject of this dissertation is motion coordination for mobile robotic networks with visibility sensors. Such networks consist of robotic agents equipped with sensors that can measure distances to the environment boundary and to other agents within line of sight. We look at two fundamental coordination problems: (i) deploying over an unknown nonconvex environment to achieve complete visibility, and (ii) gathering all agents initially scattered over the environment at a single location.

ISBN: 9780549465652Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Motion coordination for mobile robotic networks with visibility sensors.
LDR:03810nam 2200313 a 45 001 946928
005 20110523
008 110523s2007 ||||||||||||||||| ||eng d
020 $a 9780549465652
035 $a (UMI)AAI3301134
035 $a AAI3301134
040 $a UMI $c UMI
100 1 $a Ganguli, Anurag. $3 1270345
245 1 0 $a Motion coordination for mobile robotic networks with visibility sensors.
300 $a 159 p.
500 $a Adviser: Francesco Bullo.
500 $a Source: Dissertation Abstracts International, Volume: 69-02, Section: B, page: 1198.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
520 $a The subject of this dissertation is motion coordination for mobile robotic networks with visibility sensors. Such networks consist of robotic agents equipped with sensors that can measure distances to the environment boundary and to other agents within line of sight. We look at two fundamental coordination problems: (i) deploying over an unknown nonconvex environment to achieve complete visibility, and (ii) gathering all agents initially scattered over the environment at a single location.
520 $a As a special case of problem (i), we first address the problem of optimally locating a single robotic agent in a nonconvex environment. The agent is modeled as a point mass with continuous first-order dynamics. We propose a nonsmooth gradient algorithm for the problem of maximizing the area of the region visible to the observer in a non-self-intersecting nonconvex polygon. First, we show that the visible area is almost everywhere a locally Lipschitz function of the observer location. Second, we provide a novel version of the LaSalle Invariance Principle for discontinuous vector fields and for Lyapunov functions with a finite number of discontinuities. Finally, we establish the asymptotic convergence properties of the nonsmooth gradient algorithm and we illustrate numerically its performance.
520 $a Second, we address problem (i) by proposing a novel algorithm to the deploy a group of robotic agents in an unknown nonconvex environment to achieve complete visibility. The agents are point masses with discrete-time first-order dynamics. The agents operate asynchronously and two agents can communicate when mutually visible. We also address this deployment problem under the additional constraint that the visibility graph of the final agent locations is connected. We provide distributed algorithms that are guaranteed to solve the two deployment problems if a sufficient number of agents is available. Remarkably, this number is identical to the upper bound established in the famous art gallery problem, i.e., the number of agents sufficient to achieve complete visibility in a known environment through centralized computation. We additionally provide time complexity bounds for the proposed algorithms.
520 $a Third, we address problem (ii) by proposing a novel motion coordination algorithm for a group of robotic agents to achieve rendezvous, that is, to move to a common location inside a nonconvex environment. The robots move synchronously in discrete time, they have a range-limited visibility sensor, and no communication ability is required. The algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. We rigorously establish the correctness of the algorithm and we illustrate through simulations the algorithm's performance in asynchronous setups with sensor measurement and control errors.
590 $a School code: 0090.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0544
690 $a 0771
710 2 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 69-02B.
790 $a 0090
790 1 0 $a Bullo, Francesco, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3301134