论文信息 - Distributed Task Assignment for Mobile Agents

Distributed Task Assignment for Mobile Agents

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

Kevin M. Passino | Brandon J. Moore | K. Passino | B. Moore

[1] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[2] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[3] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .

[4] L. Dubins. On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[5] D.A. Castanon,et al. Distributed algorithms for dynamic reassignment , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6] Dimitri P. Bertsekas,et al. Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[7] Dimitri P. Bertsekas,et al. Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[8] Steven R. Rasmussen,et al. Task Allocation for Wide Area Search Munitions via Iterative Network Flow , 2002 .