An optimal solution method for large-scale multiple traveling salesmen problems
Operations Research
Introduction to algorithms
From Tom Thumb to the Dockers: some experiments with foraging robots
Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive behavior
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Coordination techniques for distributed artificial intelligence
Foundations of distributed artificial intelligence
Proceedings of the fifth international conference on Autonomous agents
An intelligent zone-based delivery scheduling approach
Computers in Industry
Solution of a Min-Max Vehicle Routing Problem
INFORMS Journal on Computing
ICAL 2003 Proceedings of the eighth international conference on Artificial life
Continual coordination through shared activities
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Component scheduling for chip shooter machines: a hybrid genetic algorithm approach
Computers and Operations Research
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Social coordination without communication in multi-agent territory exploration tasks
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Multi-party communication and information-need anticipation by experience
Web Intelligence and Agent Systems
Hi-index | 0.01 |
This paper investigates low-cost strategies for the multiagent object collection task, in which multiple agents work together to collect a set of items distributed throughout an environment. Several agent architectures are examined, including simple reactive architectures, more complex deliberative architectures, and "predictive" versions of both of these that take other agents into account when choosing targets for collection. A series of "yardstick" experiments demonstrate that the simple agent types perform very well relative to agents that employ much more computationally expensive approaches. Subsequent large-scale simulations that substantially increase the number of agents and collection items demonstrate that both reactive strategies scale well to more realistic task sizes, with the predictive version performing significantly better than the non-predictive ones.