We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...