Skip to main content

2018 | OriginalPaper | Buchkapitel

A Multi-Agent Problem in a New Depiction

verfasst von : Krystian Jobczyk, Antoni Ligȩza

Erschienen in: Artificial Intelligence and Soft Computing

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

This paper contains a new depiction of the Multi-Agent Problem as motivated by the so-called Nurse Rostering Problem, which forms a workable subcase of this general problem of Artificial Intelligence. Multi-Agent Problem will be presented as a scheduling problem with an additional planning component. The next, the problem will be generalized and different constraints will be put forward. Finally, some workable subcases of Multi-Agent Problem will be implemented in PROLOG-solvers.

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!

Fußnoten
1
All of these constraints are typical for scheduling problems of this type to be known as (usually) NP-hard – see: [4].
 
2
This fact plays no important role as the main objective of this juxtaposition consists in the quantitative representation alone, which will be later combined with qualitative temporal constraints (of Allen’s sort) for a use of further investigations.
 
3
This binary representation can be also exchanged by a classical one: \(X_{n,d} = z\) as presented in [4].
 
4
More precisely: multi-valued situations.
 
5
As mentioned, we rather prefer to think about these values as normalized to [0, 1] – as \(\frac{1}{3}, \frac{2}{3}\) etc. instead of 1, 2, or 3. We make use values 0, 1, 2, 3 because of restrictions imposed on PROLOG-syntax.
 
Literatur
1.
Zurück zum Zitat Armstrong, W.: Determinates of the utility function. Econ. J. 49, 453–467 (1939)CrossRef Armstrong, W.: Determinates of the utility function. Econ. J. 49, 453–467 (1939)CrossRef
2.
Zurück zum Zitat Armstrong, W.: Uncertainty and the utility function. Econ. J. 58, 1–10 (1949)CrossRef Armstrong, W.: Uncertainty and the utility function. Econ. J. 58, 1–10 (1949)CrossRef
3.
Zurück zum Zitat Burke, E.K., Curtois, T., Qu, R., Vanden Berghe, G.: A scatter search approach to the nurse rostering problem. J. Oper. Res. Soc. 61, 1667–1679 (2010)CrossRef Burke, E.K., Curtois, T., Qu, R., Vanden Berghe, G.: A scatter search approach to the nurse rostering problem. J. Oper. Res. Soc. 61, 1667–1679 (2010)CrossRef
4.
Zurück zum Zitat Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems—a bibliographic survey. Eur. J. Oper. Res. 151, 447–460 (2003)MathSciNetCrossRef Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems—a bibliographic survey. Eur. J. Oper. Res. 151, 447–460 (2003)MathSciNetCrossRef
5.
Zurück zum Zitat Davidson, D.: Hempel on explaining action. In: Essays on Actiona and Events, pp. 261–275 (1976)CrossRef Davidson, D.: Hempel on explaining action. In: Essays on Actiona and Events, pp. 261–275 (1976)CrossRef
6.
Zurück zum Zitat Dechter, R., Meiri, I., Pearl, J.: On fuzzy temporal constraints networks. Temporal Constraints Netw. 49(1–3), 61–95 (1991)MATH Dechter, R., Meiri, I., Pearl, J.: On fuzzy temporal constraints networks. Temporal Constraints Netw. 49(1–3), 61–95 (1991)MATH
7.
Zurück zum Zitat Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004)MathSciNetCrossRef Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004)MathSciNetCrossRef
8.
Zurück zum Zitat Halpern, J.Y.: Defining relative likehood in partially-ordered preferential structure. J. Artif. Intell. Res. 7, 1–24 (1997)CrossRef Halpern, J.Y.: Defining relative likehood in partially-ordered preferential structure. J. Artif. Intell. Res. 7, 1–24 (1997)CrossRef
9.
Zurück zum Zitat Jobczyk, K., Ligeza, A.: Fuzzy-temporal approach to the handling of temporal interval relations and preferences. In: Proceeding of INISTA, pp. 1–8 (2015) Jobczyk, K., Ligeza, A.: Fuzzy-temporal approach to the handling of temporal interval relations and preferences. In: Proceeding of INISTA, pp. 1–8 (2015)
10.
Zurück zum Zitat Jobczyk, K., Ligeza, A.: A general method of the hybrid controller construction for temporal planning with preferences. In: Proceeding of FedCSIS, pp. 61–70 (2016) Jobczyk, K., Ligeza, A.: A general method of the hybrid controller construction for temporal planning with preferences. In: Proceeding of FedCSIS, pp. 61–70 (2016)
11.
Zurück zum Zitat Jobczyk, K., Ligeza, A.: Multi-valued Halpern-Shoham logic for temporal Allen’s relations and preferences. In: Proceedings of the Annual International Conference of Fuzzy Systems (FuzzIEEE) (2016, page to appear) Jobczyk, K., Ligeza, A.: Multi-valued Halpern-Shoham logic for temporal Allen’s relations and preferences. In: Proceedings of the Annual International Conference of Fuzzy Systems (FuzzIEEE) (2016, page to appear)
12.
Zurück zum Zitat Jobczyk, K., Ligeza, A.: Towards a new convolution-based approach to the specification of STPU-solutions. In: FUZZ-IEEE, pp. 782–789 (2016) Jobczyk, K., Ligeza, A.: Towards a new convolution-based approach to the specification of STPU-solutions. In: FUZZ-IEEE, pp. 782–789 (2016)
13.
Zurück zum Zitat Jobczyk, K., Ligȩza, A., Bouzid, M., Karczmarczuk, J.: Comparative approach to the multi-valued logic construction for preferences. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2015. LNCS (LNAI), vol. 9119, pp. 172–183. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19324-3_16CrossRef Jobczyk, K., Ligȩza, A., Bouzid, M., Karczmarczuk, J.: Comparative approach to the multi-valued logic construction for preferences. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2015. LNCS (LNAI), vol. 9119, pp. 172–183. Springer, Cham (2015). https://​doi.​org/​10.​1007/​978-3-319-19324-3_​16CrossRef
14.
Zurück zum Zitat Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal reasoning about preferences. In: Proceedings of IJCAI-01, pp. 322–327 (2001) Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal reasoning about preferences. In: Proceedings of IJCAI-01, pp. 322–327 (2001)
15.
Zurück zum Zitat Leierson, C.E., Saxe, J.B.: A mixed-integer linear programming problem which is efficiently solvable. In: Proceedings 21st Annual Allerton Conference on Communications, Control, and Computing, pp. 204–213 (1983) Leierson, C.E., Saxe, J.B.: A mixed-integer linear programming problem which is efficiently solvable. In: Proceedings 21st Annual Allerton Conference on Communications, Control, and Computing, pp. 204–213 (1983)
16.
Zurück zum Zitat Liao, Y.Z., Wong, C.K.: An algorithm to compact a VLSI symbolic layout with mixed constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2(2), 62–69 (1983)CrossRef Liao, Y.Z., Wong, C.K.: An algorithm to compact a VLSI symbolic layout with mixed constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2(2), 62–69 (1983)CrossRef
18.
Zurück zum Zitat Qu, R., He, F.: A hybrid constraint programming approach for nurse rostering problems. Technical report, School of Computer Science, Nottingham (2008) Qu, R., He, F.: A hybrid constraint programming approach for nurse rostering problems. Technical report, School of Computer Science, Nottingham (2008)
19.
Zurück zum Zitat Ramsey, F.: A mathematical theory and saving. Econ. J. 38, 543–59 (1928)CrossRef Ramsey, F.: A mathematical theory and saving. Econ. J. 38, 543–59 (1928)CrossRef
20.
Zurück zum Zitat Rossi, F., Yorke-Smith, N., Venable, K.: Temporal reasoning with preferences and uncertainty. In: Proceedings of AAAI, vol. 8, pp. 1385–1386 (2003) Rossi, F., Yorke-Smith, N., Venable, K.: Temporal reasoning with preferences and uncertainty. In: Proceedings of AAAI, vol. 8, pp. 1385–1386 (2003)
21.
22.
Zurück zum Zitat Traverso, P., Ghallab, M., Nau, D.: Automated Planning: Theory and Practice. Elsevier, New York City (2004, 1997) Traverso, P., Ghallab, M., Nau, D.: Automated Planning: Theory and Practice. Elsevier, New York City (2004, 1997)
23.
Zurück zum Zitat van Benthem, J.: Dynamic logic for belief revision. J. Appl. Non-Class. Log. 17(2), 119–155 (2007)MathSciNetMATH van Benthem, J.: Dynamic logic for belief revision. J. Appl. Non-Class. Log. 17(2), 119–155 (2007)MathSciNetMATH
24.
Zurück zum Zitat van Benthem, J., Gheerbrant, A.: Game: solution, epistemic dynamics, and fixed-point logics. Fundam. Inform. 100, 19–41 (2010)MathSciNetMATH van Benthem, J., Gheerbrant, A.: Game: solution, epistemic dynamics, and fixed-point logics. Fundam. Inform. 100, 19–41 (2010)MathSciNetMATH
25.
Zurück zum Zitat Vidal, T., Fargier, H.: Handling contingency in temporal constraints networks: from consistency to controllabilities. J. Exp. Tech. Artif. Intell. 11(1), 23–45 (1999)CrossRef Vidal, T., Fargier, H.: Handling contingency in temporal constraints networks: from consistency to controllabilities. J. Exp. Tech. Artif. Intell. 11(1), 23–45 (1999)CrossRef
Metadaten
Titel
A Multi-Agent Problem in a New Depiction
verfasst von
Krystian Jobczyk
Antoni Ligȩza
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-91262-2_58