Distributed task assignment for mobile agents

被引：35

作者：

Moore, Brandon J. ^{[1
]}

Passino, Kevin M. ^{[1
]}

机构：

[1] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2007年 / 52卷 / 04期

关键词：

Computer simulation - Convergence of numerical methods - Distributed parameter control systems - Monte Carlo methods;

D O I：

10.1109/TAC.2007.894545

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This note demonstrates how the distributed auction algorithm can be modified to assign mobile agents to spatially distributed tasks despite communication delays and the fact that agent movement may cause the benefit associated with each possible agent-task assignment to vary during the execution of the algorithm. Bounds on the convergence time of the algorithm and the sub-optimality of the resulting solution are provided. Monte Carlo simulations are provided to show the conditions under which the modified distributed auction can outperform centralized calculation.

引用

页码：749 / 753

页数：5

共 8 条

[1]

Bertsekas D., 1997, INTRO LINEAR OPTIMIZ

[2]

Bertsekas D., 2015, Parallel and distributed computation: numerical methods

[3]

Bertsekas D.P., 1998, NETWORK OPTIMIZATION

[4] PARALLEL SYNCHRONOUS AND ASYNCHRONOUS IMPLEMENTATIONS OF THE AUCTION ALGORITHM [J].

BERTSEKAS, DP ;

CASTANON, DA .

PARALLEL COMPUTING, 1991, 17 (6-7) :707-732

[5]

BERTSEKAS DP, LIDSP2108 MIT

[6]

Castañón DA, 2003, 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, P13

[7] ON CURVES OF MINIMAL LENGTH WITH A CONSTRAINT ON AVERAGE CURVATURE, AND WITH PRESCRIBED INITIAL AND TERMINAL POSITIONS AND TANGENTS [J].

DUBINS, LE .

AMERICAN JOURNAL OF MATHEMATICS, 1957, 79 (03) :497-516

[8]

SCHUMACHER C, 2002, P AIAA GUID NAV CONT, P2002

← 1 →