Abstract
In the paper a Fuzzy Multi-Agent Problem (FMAP) is discussed both in a conceptual and a programming-wise depiction. In particular, it is illustrated how FMAP stems from a Nurse Job Rostering Problem-based formulation of MAP. Finally, a workable subcase of FMAP is explored by means of PROLOG-solvers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
STPU forms an abbreviation from ‘Simple Temporal Problem under Uncertainty’ and STPP – from ‘Simple Temporal Problem with Preferences’.
- 2.
This problem is also called Nurse Rostering Problem. NSP constitutes a classical optimization problem. Its objective is to determine the rotating shifts of the nursing shifts over a scheduled period (weekly or monthly)- see: [14].
- 3.
- 4.
All of these constraints are typical for scheduling problems of this type to be known as (usually) NP-hard – see: [15].
- 5.
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.
- 6.
This binary representation can be also exchanged by a classical one: \(X_{n,d} = z\) as presented in [15].
- 7.
More precisely: multi-valued situations.
- 8.
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 use values 0, 1, 2, 3 because of restrictions imposed on PROLOG-syntax.
References
Traverso, P., Ghallab, M., Nau, D.: Automated Planning: Theory and Practice, vol. 2004. Elsevier, Amsterdam (1997)
Dechter, R., Meiri, Pearl, J.: On fuzzy temporal constraints networks. Temp. Constr. Netw. 49(1–3), 61–95 (1991)
Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal reasoning about preferences. In: Proceedings of IJCAI 2001, pp. 322–327 (2001)
Shostak, R.: Deciding linear inequalities by computing loop residues. J. ACM 28(4), 769–779 (1981)
Liao, Y., Wong, C.: An algorithm to compact a VLSI symbolic layout with mixed constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2(2), 62–69 (1983)
Leierson, C., Saxe, J.: A mixed-integer linear programming problem which is efficiently solvable. In: Proceedings 21st Annual Alerton Conference on Communications, Control, and Computing, pp. 204–213 (1983)
Vidal, T., Fargier, H.: Handling contingency in temporal constraints networks: From consistency to controllabilities. J. Exp. Tech. Artif. Intell. 11(1), 23–45 (1999)
Rossi, F., Yorke-Smith, N., Venable, K.: Temporal reasoning with preferences and uncertainty. In: Proceedings of AAAI, vol. 8, pp. 1385–1386 (2003)
Jobczyk, K., Ligeza, A.: Towards a new convolution-based approach to the specification of STPU-solutions. In: FUZZ-IEEE, pp. 782–789 (2016)
Liu, J., Jing, H., Tang, Y.: Multi-agent oriented constraints satisfaction. Artif. Intell. 136(1), 101–144 (2002)
Modi, P., Shen, W., Tambe, M., Yakoo, M.: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(2), 149–180 (2005)
Mailler, R., Lesser, V.: Asynchronous partial overlay: a new algorithm for solving distributed constraints satisfaction problems. J. Artif. Intell. Res. 25, 529–576 (2006)
Yokoo, M.: Distributed Constraints Satisfaction. Foundation of Cooperation in Multi-Agent System. Springer, Heidelberg (2001). https://doi.org/10.1007/978-3-642-59546-2
Felici, G., Gentile, C.: A polyhedral approach for the staff rostering problem. Manage. Sci. 50(3), 381–394 (2004)
Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems-a bibliographic survey. Eur. J. Oper. Res. 151(3), 447–460 (2003)
Burke, E.K., Curtois, T., Qu, R., Berghe, G.V.: A scatter search approach to the nurse rostering problem. J. Oper. Res. Soc. 61, 1667–1679 (2010)
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)
Qu, R., He, F.: A hybrid constraint programming approach for nurse rostering problems. Technical report, School of Computer Science, Nottingham (2008)
Metivier, J.-P., Boizumault, P., Loudni, S.: Solving nurse rostering problems using soft global constraints. In: Proceedings of the 15th international conference on Principles and practice of constraint programming, CP 2009, pp. 73–87 (2009)
Cetin, E., Sarucan, A.: Nurse scheduling using binary fuzzy goal programming. In: Proceedings of ICAMSAO, pp. 1–6 (2014)
Selim, H., Topaloglu, S.: Nurse scheduling using modeling approach. Fuzzy Sets Syst. 161(11), 1543–1563 (2004)
Lepegue, T., Prot, D., Bellenguez-Morineau, O.: A tour scheduling problem with fixed jobs: use of constraint programming. Practice and Theory of Automated Timetabling, pp. 29–31 (2012)
Jobczyk, K., Ligeza, B.M.A.., Karczmarczuk, J.: Fuzzy integral logic expressible by convolutions. In: Proceeding of ECAI 2014, pp. 1042–1043 (2014)
Jobczyk, K., Ligeza, A.: Dynamic epistemic preferential logic of action. ICAISC 2, 243–254 (2017)
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, to appear)
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_16
Jobczyk, K.: Temporal planning with fuzzy constraints and preferences. Normandy University (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Jobczyk, K., Ligȩza, A. (2020). A Fuzzy Multi-Agent Problem in a Conceptual and Operational Depiction. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2020. Lecture Notes in Computer Science(), vol 12416. Springer, Cham. https://doi.org/10.1007/978-3-030-61534-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-61534-5_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61533-8
Online ISBN: 978-3-030-61534-5
eBook Packages: Computer ScienceComputer Science (R0)