Skip to main content

2015 | OriginalPaper | Buchkapitel

Research of Task Allocation Strategy for Moving Image Matching Based on Multi-agent

verfasst von : Bin Shao, Zhimin Yan

Erschienen in: Transactions on Edutainment XI

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper moving image matching task allocation strategies based on the Multi-Agent system are discussed. Combined with genetic algorithm and simulated annealing algorithm, it gives out a new moving image pattern match-ing task allocation strategies based on the Multi-Agent system. Due to the unique nature of genetic algorithms and simulated annealing algorithm, makes the task allocation algorithm presented in this paper has new features that is different from the traditional method.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Holland, J.H.: Adaptation in Natural and Artificial System. University of Michigan Press, Ann Ardor (1975) Holland, J.H.: Adaptation in Natural and Artificial System. University of Michigan Press, Ann Ardor (1975)
2.
Zurück zum Zitat Shao, B., Wang, G.: Judge of performance in the multi-agent system. Microelectron. Comput. 20(8), 80–81 (2003) Shao, B., Wang, G.: Judge of performance in the multi-agent system. Microelectron. Comput. 20(8), 80–81 (2003)
3.
Zurück zum Zitat Shao, B., Jiang, Y., Shen, Q.: The multi-agent simulation and philosophy on economic game. J. Inf. Comput. Sci. 12(6), 2305–2309 (2009) Shao, B., Jiang, Y., Shen, Q.: The multi-agent simulation and philosophy on economic game. J. Inf. Comput. Sci. 12(6), 2305–2309 (2009)
4.
Zurück zum Zitat Mecar, I., Devlic, A.: Agent-oriented semantic discovery and matchmaking of Web services. In: 8th International Conference on Telecommunications- ConTEL, pp. 603–607 (2005) Mecar, I., Devlic, A.: Agent-oriented semantic discovery and matchmaking of Web services. In: 8th International Conference on Telecommunications- ConTEL, pp. 603–607 (2005)
5.
Zurück zum Zitat Bin, L., Wen-Feng, L., Yu, Z.: Study on modeling of container terminal logistics system using agent-based computing and knowledge discovery. In: Proceedings of International Symposium and Advances in Computer and Sensor Networks and Systems, pp. 164–171. Aardvark Global Publishing, Slat Lake City, USA (2008) Bin, L., Wen-Feng, L., Yu, Z.: Study on modeling of container terminal logistics system using agent-based computing and knowledge discovery. In: Proceedings of International Symposium and Advances in Computer and Sensor Networks and Systems, pp. 164–171. Aardvark Global Publishing, Slat Lake City, USA (2008)
6.
Zurück zum Zitat Gajpal, Y., Rajendran, C., Ziegler, H.: An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs. Int. J. Adv. Manuf. Technol. 30(5–6), 416–424 (2006)CrossRef Gajpal, Y., Rajendran, C., Ziegler, H.: An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs. Int. J. Adv. Manuf. Technol. 30(5–6), 416–424 (2006)CrossRef
7.
Zurück zum Zitat Ying, K.-C., Lin, S.-W.: Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 33(7–8), 793–802 (2007)CrossRef Ying, K.-C., Lin, S.-W.: Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 33(7–8), 793–802 (2007)CrossRef
8.
Zurück zum Zitat El-Menshawy, M., Bentahar, J., El-Kholy, W., Dssouli, R.: Verifying conformance of multi-agent commitment-based protocols. Expert Syst. Appl. 40, 122–138 (2013)CrossRef El-Menshawy, M., Bentahar, J., El-Kholy, W., Dssouli, R.: Verifying conformance of multi-agent commitment-based protocols. Expert Syst. Appl. 40, 122–138 (2013)CrossRef
9.
Zurück zum Zitat Lomuscio, A., Qu, H., Solanki, M.: Towards verifying contract regulated service composition. Auton. Agent. Multi-Agent Syst. 24, 345–373 (2012)CrossRef Lomuscio, A., Qu, H., Solanki, M.: Towards verifying contract regulated service composition. Auton. Agent. Multi-Agent Syst. 24, 345–373 (2012)CrossRef
10.
Zurück zum Zitat Telang, P., Singh, M.: Specifying and verifying cross-organizational business models: An agent oriented approach. IEEE Trans. Serv. Comput. 5, 305–318 (2012)CrossRef Telang, P., Singh, M.: Specifying and verifying cross-organizational business models: An agent oriented approach. IEEE Trans. Serv. Comput. 5, 305–318 (2012)CrossRef
Metadaten
Titel
Research of Task Allocation Strategy for Moving Image Matching Based on Multi-agent
verfasst von
Bin Shao
Zhimin Yan
Copyright-Jahr
2015
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-48247-6_6