Abstract
A critical issue in patient planning is to determine whether the medical processes of a patient can be completed by a time constraint based on the available resources in hospitals. The problem is a Temporal Constraint Satisfaction Problem (TCSP). The objectives of this paper are to propose a viable and systematic approach to develop a distributed cooperative problem solver for TCSP and estimate the shortest and the longest completion time for handling a patient in the presence of uncertainty based on Multi-agent systems (MAS) architecture. Our approach combines MAS with a subclass of time Petri net (TPN) models to solve TCSP. Existing analysis methods of TPN based on state classes cannot be applied directly due to distributed architecture of MAS. In this paper, a temporal analysis method based on MAS architecture is proposed. Our temporal analysis method efficiently deduces the earliest and latest completion time of a patient based on interaction between agents.
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
Preview
Unable to display preview. Download preview PDF.
References
Decker, K., Li, J.: Coordinated hospital patient scheduling. In: International Conference on Multi Agent Systems, Paris, July 3-7, pp. 104–111 (1998)
Kutanoglu, E., David Wu, S.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions 31, 813–826 (1999)
Oddi, A., Cesta, A.: Toward interactive scheduling systems for managing medical resources. Artificial Intelligence in Medicine 20, 113–138 (2000)
Daknou, A., Zgaya, H., Hammadi, S., Hubert, H.: A dynamic patient scheduling at the emergency department in hospitals. In: IEEE Workshop on Health Care Management, Venice, February 18-20, pp. 1–6 (2010)
Spyropoulos, C.D.: AI planning and scheduling in the medical hospital environment. Artificial Intelligence in Medicine 20, 101–111 (2000)
Nilsson, N.J.: Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, Inc., SanFrancisco (1998)
Ferber, J.: Multi-Agent Systems, An Introduction to Distributed Artificial Intelligence. Addison-Wesley, Reading (1999)
Durfee, E.H., Lesser, V.R., Corkill, D.D.: Trends in cooperative distributed problem solving. IEEE Transactions on Knowledge and Data Engineering 1(1), 63–83 (1989)
Russel, S.J., Norvig, P.: Artificial Intelligence—A Modern Approach, 2nd edn. Pearson Education Asia Limited (2006)
Workflow Management Coalition, XPDL support and resources (2009), http://www.wfmc.org/xpdl.html
Object Management Group, Business process modeling notation (2009), http://www.bpmn.org
OASIS, Web services business process execution language version 2.0 (2009), http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html
Merlin, P., Farbor, D.: Recoverability of communication protocols. IEEE Trans. on Communications 24(9), 1036–1043 (1976)
Smith, R.G.: The Contract net protocol: high-level communication and control in a distributed problem solver. IEEE Transactions on Computers 29, 1104–1113 (1980)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Berthomieu, B., Menasche, M.: An Enumerative Approach for Analyzing Time Petri Nets. In: Proc. Ninth International Federation of Information Processing (IFIP) World Computer Congress, vol. 9, pp. 41–46 (September 1983)
Conry, S.E., Kuwabara, K., Lesser, V.R., Meyer, R.A.: Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man and Cybernetics 21(6), 1462–1477 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsieh, FS., Lin, JB. (2012). Temporal Reasoning in Multi-agent Workflow Systems Based on Formal Models. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28487-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-28487-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28486-1
Online ISBN: 978-3-642-28487-8
eBook Packages: Computer ScienceComputer Science (R0)