Skip to main content
SpringerLink
Log in

An Event-Driven Algorithm for Agents on the Web

  • Chapter
Knowledge Processing and Decision Making in Agent-Based Systems

Part of the book series: Studies in Computational Intelligence ((SCI,volume 170))

Abstract

This chapter describes how meta-agents in a multi-agent system can be used to effectively search for services in networks with an event-driven algorithm. These services can be attained in a range of different ways, including a simultaneous combination of several services in order to optimize costs and time. A challenge with a network is finding and extracting an optimal combination of the different services to implement a complex requested service. To solve this problem, it is possible to develop multi-agent systems in which the task steers the agents. While finding information on the web, the search path becomes an event-driven algorithm. The algorithm acts as a search method to extract information from several different services. Once built up, the algorithm can guide future search and optimize the searching.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apelkrans, M., Håkansson, A.: Information coordination using Meta-Agents in Information Logistics Processes. In: 12th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, KES 2008, September 3-5, Zagreb, Croatia (2008)

    Google Scholar 

  2. Akl, S.G., Bernard, D.T., Jordan, R.J.: Design and implementation of a parallel tree search algorithm. IEEE transactions on Pattern Analysis and Machine Intelligence PAMI-4, 192–203 (1982)

    Article  Google Scholar 

  3. Baudet, G.M.: The Design and Analysis of Algorithms for Asynchronous Multiprocessors. Ph D Thesis, Carnegie-Mellon University, Pittsburgh, PA (1978)

    Google Scholar 

  4. Bentley, J.L.: A parallel algorithm for constructing minimum spanning trees. Journal of the ACM 27(1), 51–59 (1980)

    MathSciNet  Google Scholar 

  5. Berman, K., Paul, J.: Algorithms: Sequential, Parallel, and Distributed. Course Technology, 1st edn. (2004)

    Google Scholar 

  6. Brungger, A., Marzetta, J., Clausen, J., Perregaard, M.: Solving large-scale QAP problems in parallel with the search library zram. Journal of Parallel and Distributed Computing 50, 157–169 (1998)

    Article  Google Scholar 

  7. Chakrabarti, S., van den Berg, M., Dom, B.: Focused crawling: A new approach to topic-specific web resource discovery. Computer Networks 31(11-16), 1623–1640 (1999)

    Article  Google Scholar 

  8. Chelberg, D., Welch, L., Lakshmikumar, A., Gillen, M., Zhou, Q.: Meta-Reasoning For a Distributed Agent Architecture. In: System Theory, Proceedings of the 33rd Southeastern Symposium, pp. 377–381 (2001)

    Google Scholar 

  9. Cheong, F.-C.: Internet Agents: Spiders, Wanderers, Brokers, and Bots. New Riders Pub., Indianapolis (1996)

    Google Scholar 

  10. Cormen, T.H., Leiserson, C.E., Riverst, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2006)

    Google Scholar 

  11. Costantini, S.: Meta-reasoning: a survey. In: Kakas, A., Sadri, F. (eds.) Computational Logic: From Logic Programming into the Future: Special volume in honour of Bob Kowalski. Springer, Berlin (in print, 2002), http://zen.ece.ohiou.edu/~robocup/papers/HTML/SSST/SSST.html

    Google Scholar 

  12. Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problem. Operations Research 2, 803–834 (1983)

    Article  Google Scholar 

  13. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  14. Dunkels, A., Schmidt, O., Voigt, T., Ali, M.: Protothreads: simplifying event-driven programming of memory-constrained embedded systems. In: Proceedings of the Fourth ACM Conference on Embedded Networked Sensor Systems, Boulder, Colorado, USA (2006)

    Google Scholar 

  15. Ferg, S.: Event-Driven Programming: Introduction, Tutorial, History (2006-02-08), http://TutorialEventDrivenProgramming.sourceforge.net

  16. Finkel, R.A., Fishburn, J.P.: Parallelism in alpha-beta search. Artificial Intelligence 19, 89–106 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gendron, B., Crainic, T.G.: Parallel Branch-And-Bound Algorithms: Survey and Synthesis Operations Research  42(6), 1042–1066 (1994)

    Google Scholar 

  18. Genesereth, M.R., Ketchpel, S.P.: Software Agents. Communication of the ACM 37(7), 18–21 (1994)

    Article  Google Scholar 

  19. Gibbons, A.: Algorithmic graph theory. Cambridge University Press, Cambridge (1985)

    MATH  Google Scholar 

  20. Grama, A., Gupta, A., Karypis, G., Vipin, K.: Introduction to Parallel Computation, 2nd edn., Ch. 11. Pearon Addison Wesley, Reading (2003)

    Google Scholar 

  21. Hermans, B.: Intelligent Software Agents on the Internet, Ch. 1-3. First Monday 2(3) (1997)

    Google Scholar 

  22. Horowitz, E., Sahni, S., Rajasekaran, S.: Computer Algorithms C++: C++ and Pseudo code Versions, 2nd Rev. edn., December 15, p. 769. W. H. Freeman (1996)

    Google Scholar 

  23. Håkansson, A., Hartung, R.: Using Meta-Agents for Multi-Agents in Networks. In: Proceedings of the 2007 International Conference on Artificial Intelligence, ICAI 2007, vol. II, pp. 561–567. CSREA Press (2007)

    Google Scholar 

  24. Håkansson, A., Hartung, R.: Calculating optimal decision using Meta-level agents for Multi-Agents in Networks. In: Proceedings of Knowledge-Based and Intelligent Information & Engineering Systems, 11th International Conference. LNCS, pp. 180–188. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Håkansson, A., Hartung, R.: Autonomously creating a hierarchy of intelligent agents using clustering in a multi-agent system. In: The 2008 International Conference on Artificial Intelligence, ICAI 2008, Las Vegas, Nevada, USA, July 14–17 (submitted, 2008)

    Google Scholar 

  26. Håkansson, A., Hartung, R.L.: An approach to event-driven algorithm for intelligent agents in multi-agent systems. In: Nguyen, N.T., Jo, G.S., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2008. LNCS, vol. 4953, pp. 411–420. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  27. Ishida, T.: Real-Time Search for Autonomous Agents and Multi-Agent Systems. Journal of Autonomous Agents and Multi-Agent Systems 1(2), 139–167 (1998)

    Article  MathSciNet  Google Scholar 

  28. Jade, Java Agent Development Framework (2008-03-15), http://jade.tilab.com/

  29. Kanal, L.N., Kumar, V.: Search in Artificial Intelligence. Springer, New York (1988)

    MATH  Google Scholar 

  30. Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 668–677. ACM Press, New York (1998)

    Google Scholar 

  31. Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1956)

    Article  MathSciNet  Google Scholar 

  32. Kumar, V., Rao, V.N.: Parallel depth-first search, part II: Analysis. International Journal of Parallel Programming 16(6), 501–519 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  33. Kumar, V., Singh, V.: Scalability of parallel algorithms for the all-pairs shortest path problem. Journal of Parallel and Distributed Computing 13(2), 124–128 (1991)

    Article  Google Scholar 

  34. Kumar, V., Ramesh, K., Rao, V.N.: Parallel best-first search of state-space graphs: A summary of results. In: Processings of the 1988 National Conference on Artificial Intelligence, pp. 122–126 (1988)

    Google Scholar 

  35. Luger, G.F.: Artificial Intelligence – Structures and strategies for Complex Problem Solving, 4th edn. Pearson Education, London (2002)

    Google Scholar 

  36. Maes, P., Guttman, R.H., Moukas, A.G.: Agents that buy and sell. Communications of the ACM archive 42(3), 81–92 (1999)

    Article  Google Scholar 

  37. Menczer, F.: ARACHNID: Adaptive Retrieval Agents Choosing Heuristic Neighbourhoods for Information Discovery. In: Fisher, D. (ed.) Proceedings of the 14th International Conference on Machine Learning, ICML 1997 (1997)

    Google Scholar 

  38. Menczer, F., Pant, G., Srinivasan, P.: Topical Web Crawlers: Evaluating Adaptive Algorithms. ACM transactions on Internet Technology (TOIT) 4(4), 378–419 (2004)

    Article  Google Scholar 

  39. Miller, D.L., Pekny, J.F.: The role of performance metrics for parallel mathematical programming algorithms. ORSA Journal on Computing 5(1) (1993)

    Google Scholar 

  40. Mohan, J.: Experience with two parallel programs solving the travelling salesman problem. In: Proceeding of the 1983 International Conference on Parallel Processing, pp. 191–193 (1983)

    Google Scholar 

  41. Mornien, B., Vornberger, O.: Parallel processing of combinatorial search trees. In: Proceedings of International Workshop on Parallel Algorithms and Architectures (1987)

    Google Scholar 

  42. Nisan, N.: Algorithms for Selfish Agents – Mechanism Design for Distributed Computation. In: Proceedings of Annual Symposium on Theoretical Aspects of Computer Science Trier, pp. 1–15 (1999)

    Google Scholar 

  43. Page, L.; Brin, S.; Motwani, R.; Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web (1999) (2008-03-09), http://dbpubs.stanford.edu/pub/1999-66

  44. Paige, R.C., Kruskal, C.P.: Parallel algorithms for shortest path problems. In: Proceedings of 1989 International Conference of Parallel Processing, pp. 14–19 (1989)

    Google Scholar 

  45. Pearl, J.: Heuristics-Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)

    Google Scholar 

  46. Peng, C.-H., Wang, B.-F., Wang, J.-S.: Recognizing unordered depth-first search of an undirected graph in parallel. IEEE Transactions on Parallel and Distributed Systems 11(6), 559–570 (2000)

    Article  MathSciNet  Google Scholar 

  47. Pfeifer, A., Ururahy, C., Rodriguez, N., Ierusalimschy, R.: Event-Driven Programming for Distributed Multimedia Applications. In: Distributed Computing Systems Workshops Proceedings. 22nd International Conference on Distributed Computing Systems, pp. 583–584 (2002)

    Google Scholar 

  48. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Google Scholar 

  49. Rippel, E., Bar-Gill, A., Shimkin, N.: Fast Graph-Search Algorithms for General-Aviation Flight Trajectory Generation. Journal of guidance control and dynamics, American inst of aeronautics and astronautics 28(4), 801–811 (2005)

    Google Scholar 

  50. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Inc., Englewood Cliffs (1995)

    MATH  Google Scholar 

  51. Sedgewick, R.: Algorithms in Java, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley Longman Publishing Co, Inc. (2003)

    Google Scholar 

  52. Skiena, S.: The Algorithm Design Manual, 1st edn. Springer, Heidelberg (1998)

    Google Scholar 

  53. Sauer, J., Appelrath, H.-J.: Scheduling the Supply Chain by Teams of Agents. In: The 36th Annual Hawaii International Conference on System Sciences, 81 (2003)

    Google Scholar 

  54. Winston, P.H.: Artificial Intelligence, 3rd edn. Addison-Wesley, Reading (1992)

    Google Scholar 

  55. Wooldridge, M.: An Introduction to MultiAgent Systems. John Wiley & Sons Ltd, Chichester (2002)

    Google Scholar 

  56. Wooldridge, M., Jennings, N.R.: Intelligent agents: Theory and practice. Knowledge Engineering Review 10(2) (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Computer Science, Uppsala University, P.O. Box 513, S-751 20, Uppsala, Sweden

    Anne Håkansson

Authors
  1. Anne Håkansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of South Australia, Mawson Lakes Campus, South Australia, SA 5095, Adelaide City, Australia

    Lakhmi C. Jain

  2. Institute of Informatics, Wroclaw University of Technology, Str. Janiszewskiego 11/17, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Håkansson, A. (2009). An Event-Driven Algorithm for Agents on the Web. In: Jain, L.C., Nguyen, N.T. (eds) Knowledge Processing and Decision Making in Agent-Based Systems. Studies in Computational Intelligence, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88049-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88049-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88048-6

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation