Advertisement

Large Pheromones: A Case Study with Multi-agent Physical A*

  • Ariel Felner
  • Yaron Shoshani
  • Israel A. Wagner
  • Alfred M. Bruckstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE T-SMC, Part B 26(1), 29–41Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams. Wiley, Chichester (1992)zbMATHGoogle Scholar
  7. 7.
    Wagner, A., Bruckstein, A.M.: ANTS: Agents, networks, trees, and subgraphs. Future Generation Computer Systems Journal 16(8), 915–926 (2000)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Yanovski, V.M., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37, 165–186 (2003)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ariel Felner
    • 1
    • 2
  • Yaron Shoshani
    • 2
  • Israel A. Wagner
    • 3
    • 4
  • Alfred M. Bruckstein
    • 4
  1. 1.Dept. of Information Systems EngineeringBen-Gurion University of the Negev Beer-ShevaIsrael
  2. 2.Dept. of Computer ScienceBar-Ilan UniversityRamat-GanIsrael
  3. 3.IBM Haifa LabsMATAMHaifaIsrael
  4. 4.Dept. of Computer Science, TechnionHaifaIsrael

Personalised recommendations