Abstract
Physical A* (PHA*) and its multi-agent version MAPHA* [3,4] are algorithm that find the shortest path between two points in an unknown real physical environment with one or many mobile agents. Previous work assumed a complete sharing of knowledge between agents. Here we apply this algorithm to a more restricted model of communication which we call large pheromones, where agents communicate by writing and reading data at nodes of the graph that constitutes their environment. Unlike small pheromones where only a limited amount of data can be written at each node, the large pheromones model assumes no limitation on the size of the pheromones and thus each agent can write its entire knowledge at a node. We show that with this model of communication the behavior of a multi-agent system is almost as good as with complete knowledge sharing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery 32(3), 505–536 (1985)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE T-SMC, Part B 26(1), 29–41
Felner, A., Stern, R., Ben-Yair, A., Kraus, S., Netanyahu, N.: Pha*: Finding the shortest path with a* in unknown physical environments. Accepted to JAIR (2003)
Felner, A., Stern, R., Kraus, S.: PHA*: Performing A* in unknown physical environments. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, pp. 240–247 (2002)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SCC-4(2), 100–107 (1968)
Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams. Wiley, Chichester (1992)
Wagner, A., Bruckstein, A.M.: ANTS: Agents, networks, trees, and subgraphs. Future Generation Computer Systems Journal 16(8), 915–926 (2000)
Yanovski, V., Wagner, I.A., Bruckstein, A.M.: Vertex-ant-walk: A robust method for efficient exploration of faulty graphs. Annals of Mathematics and Artificial Intelligence 31(1-4), 99–112 (2001)
Yanovski, V.M., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37, 165–186 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felner, A., Shoshani, Y., Wagner, I.A., Bruckstein, A.M. (2004). Large Pheromones: A Case Study with Multi-agent Physical A*. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive