東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Multiple robot coordination: A math...

Peng, Jufeng.

Linked to FindBook

Google Book

Amazon

博客來

Multiple robot coordination: A mathematical programming approach.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Multiple robot coordination: A mathematical programming approach./
Author:	Peng, Jufeng.
Description:	145 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2107.
Contained By:	Dissertation Abstracts International66-04B.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3173279
ISBN:	054210685X

Multiple robot coordination: A mathematical programming approach.
Peng, Jufeng.

Multiple robot coordination: A mathematical programming approach. - 145 p.

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

Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2005.

This thesis focuses on the optimal coordination of multiple robot systems with dynamics along specified paths using mathematical programming. These multiple robot coordination problems are motivated by wide applications, including automated guided vehicle coordination in industries, droplet coordination in digital microfluidic systems, and manipulator coordination in car assembly lines. Previous work on optimal coordination of robots either ignored robot dynamics or focused almost exclusively on dual robot systems.

ISBN: 054210685XSubjects--Topical Terms:

515831
Mathematics.

Multiple robot coordination: A mathematical programming approach.
LDR:02988nmm 2200301 4500 001 1817028
005 20060816133906.5
008 130610s2005 eng d
020 $a 054210685X
035 $a (UnM)AAI3173279
035 $a AAI3173279
040 $a UnM $c UnM
100 1 $a Peng, Jufeng. $3 1906393
245 1 0 $a Multiple robot coordination: A mathematical programming approach.
300 $a 145 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2107.
500 $a Adviser: Srinivas Akella.
502 $a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2005.
520 $a This thesis focuses on the optimal coordination of multiple robot systems with dynamics along specified paths using mathematical programming. These multiple robot coordination problems are motivated by wide applications, including automated guided vehicle coordination in industries, droplet coordination in digital microfluidic systems, and manipulator coordination in car assembly lines. Previous work on optimal coordination of robots either ignored robot dynamics or focused almost exclusively on dual robot systems.
520 $a Initially we assume that each robot's path is specified. We first develop a mixed integer nonlinear program (MINLP) model for coordinating multiple robots with double integrator dynamics. We demonstrate the convexity and differentiability of the nonlinear constraints in this MINLP and provide several global optimality conditions for multiple robot coordination with dynamics. We then develop two mixed integer linear program (MILP) models to approximate the MINLP model. In addition, we find the computational complexity and show a shortest path structure and a network flow structure for multiple robot coordination. To coordinate multiple manipulators with given initial trajectories, we exploit the time-scaling law to build MILP and MINLP models that uniformly scale the trajectories, minimize the system cost, satisfy complex manipulator dynamics, and avoid collisions. In addition, we develop a mixed integer conic program (MICP) model that is guaranteed to find the globally optimal design for time-scaled planar manipulator systems. We demonstrate our approaches for multiple robot coordination with extensive implementation results.
520 $a Computing collision zones and detecting collisions are crucial for coordinating multiple robots. The last topic of the thesis is concerned with collision detection and proximity queries for objects represented as superconics, which are a generalization of convex superellipsoids. We design an efficient algorithm for computing the minimum distance between two superconics using second order cone programs.
590 $a School code: 0185.
650 4 $a Mathematics. $3 515831
650 4 $a Applied Mechanics. $3 1018410
690 $a 0405
690 $a 0346
710 2 0 $a Rensselaer Polytechnic Institute. $3 1019062
773 0 $t Dissertation Abstracts International $g 66-04B.
790 1 0 $a Akella, Srinivas, $e advisor
790 $a 0185
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3173279