Skip to main content

What ants cannot do

  • Conference paper
  • First Online:
Distributed Software Agents and Applications (MAAMAW 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1069))

Abstract

What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity principle that complex goals can only be achieved if either the agents or their environment has a complexity of matching stature. This has consequences for research programs in distributed artificial intelligence, robotics and connectionism. After presenting a qualitative theory of complexity of agent systems, we also critically investigate the claims and the realities behind reactive agents, the subsumption architecture (Brooks), and the view of plans as resources (Agre, Chapman, Suchman). Finally, the implications of the complexity conservation principle for the foundations of cosmology and complexity of the universe are discussed. Puzzles appear whose possible solution relates the uncertainty principle of quantum mechanics with the second law of thermodynamics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agre, P., ”What are plans for?”, AI Magazine, 1991.

    Google Scholar 

  2. Brooks, R.A., ”Symbolic Error Analysis and Robot Planning,” INTERNATIONAL Journal of Robotics Research,1, No. 4, pp. 29–68, 1982.

    Google Scholar 

  3. Brooks, R., ”A Robust Layered Control System for a Mobile Robot,” IEEE Journal of Robotics and Automation, vol. RA-2, No. 1, March 1986

    Google Scholar 

  4. Chaitin, G.J., ”On the length of programs for computing finite binary sequences,” J. ACM, vol. 13, pp. 547–569, October 1966.

    Google Scholar 

  5. Y. Demazeau & J-P. Mueller (eds.), Decentralized AI, Vol. I, Elsevier Science Publishers (North Holland), 1990.

    Google Scholar 

  6. Y. Demazeau & J-P. Mueller (eds.), Decentralized AI, Vol. II, Elsevier Science Publishers (North Holland), 1992.

    Google Scholar 

  7. Holland, J. H., Adaption in Natural and Artificial Systems, Ann Arbor, University of Michigan Press, 1975.

    Google Scholar 

  8. Khinchin, A.I., Mathematical Foundations of Statistical Mechanics, Dover Publ., New York, 1949.

    Google Scholar 

  9. Kolmogorov, A.N., ”Three Approaches to the definition of the concept’ quantity of information',” Probl. Peredachi Inform., vol. 1, pp. 3–11, 1965.

    Google Scholar 

  10. Kolmogorov, A.N., ”Logical basis for information theory and probability theory”, IEEE Trans. Information Theory, vol. IT-14, pp. 662–664, September 1968.

    Google Scholar 

  11. Shannon, C.E., ”The Mathematical Theory of Communication”, Bell Syst, Techn. Journ., vol. 27, 379–423; 623–656, 1948.

    Google Scholar 

  12. Smoot, G.F., et al., Astrophysical Journal, vol. 396, L1–L5, 1992.

    Google Scholar 

  13. Waldrop, M.M., Complexity, The Emerging Science at the Edge of Order and Chaos, Simon & Schuster, New York, 1992.

    Google Scholar 

  14. Werner, E., ”The Modal Logic of Games”, WISBER Report B48, University of Hamburg, Hamburg, Germany 1988.

    Google Scholar 

  15. Werner, E., ”Tensed Modal Logic”, WISBER Report B49, University of Hamburg, Hamburg, Germany, 1989a.

    Google Scholar 

  16. Werner, E., ”Cooperating Agents: A Unified Theory of Communication and Social Structure”, Distributed Artificial Intelligence, Vol. 2, M. Huhns & L. Gasser (eds.), Morgan Kaufmann and Pitman Publishers, London, pp. 3–36, 1989b.

    Google Scholar 

  17. Werner, E., ”What Can Agents Do Together? A Semantics of Cooperative Ability”, ECAI-90, Proceedings of the 9th European Conference on Artificial Intelligence, Stockholm, Sweden, Pitman Publishers, pp. 694–701, 1990.

    Google Scholar 

  18. Werner, E., ”A Unified View of Information, Intention, and Ability”, Decentralized AI, Vol. II, Y. Demazeau & J-P. Muller (eds.), Elsevier Science Publishers (North Holland), 1992.

    Google Scholar 

  19. Werner, E., ”Logical Foundations of Distributed Artificial Intelligence”, Foundations of Distributed Artificial Intelligence, G. Ohare & N. Jennings (eds.), John Wiley, forthcoming, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

John W. Perram Jean-Pierre Müller

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Werner, E. (1996). What ants cannot do. In: Perram, J.W., Müller, JP. (eds) Distributed Software Agents and Applications. MAAMAW 1994. Lecture Notes in Computer Science, vol 1069. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61157-6_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-61157-6_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61157-8

  • Online ISBN: 978-3-540-68335-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics