Abstract
Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associated tests and treatments have become interrelated, the current ad hoc patient scheduling solutions have been observed to break down. We propose a multi-agent solution using the Generalized Partial Global Planning (GPGP) approach that preserves the existing human organization and authority structures, while providing better system-level performance (increased hospital unit throughput and decreased patient stay time). To do this, we extend GPGP with a new coordination mechanism to handle mutually exclusive resource relationships. Like the other GPGP mechanisms, the new mechanism can be applied to any problem with the appropriate resource relationship. We evaluate this new mechanism in the context of the hospital patient scheduling problem, and examine the effect of increasing interrelations between tasks performed by different hospital units.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Bresina, W. Edgington, K. Swanson, and M. Drummond, Operational closed-loop observation scheduling and execution,. in Proc.AAAI-96 Workshop on Theories of Planning, Action, and Control, 1996.
C. Castelfranchi, Commitments from individual intentions to groups and organizations,. in M. Prietula, ed., AI and Theories of Groups & Organizations: Conceptual and Empirical Research. AAAI Workshop, 1993, Working Notes.
P. R. Cohen and H. J. Levesque, Intention is choice with commitment,. Artif.Intell. Vol. 42, pp. 213–261, 1990.
S. E. Conry, K. Kuwabara, V. R. Lesser, and R. A. Meyer, Multistage negotiation for distributed constraint satisfaction,. IEEE Trans.Syst.Man Cybernet. Vol. 21, November 1991.
K. S. Decker, Environment Centered Analysis and Design of Coordination Mechanisms,. Ph.D. thesis, University of Massachusets, 1995. http://dis.cs.umass.edu/-decker/thesis.html.
K. S. Decker, Task environment centered simulation,. in M. Prietula, K. Carley, and L. Gasser, ed., Simulating Organizations: Computational Models of Institutions and Groups, AAAI Press/MIT Press, 1997, pp. 105–131.
K. S. Decker and V. R. Lesser, An approach to analyzing the need for meta-level communication,. in Proc.13th Int.Joint Conf.Artif.Intell., Chambéry, France, August 1993, pp. 360–366.
K. S. Decker and V. R. Lesser, A one-shot dynamic coordination algorithm for distributed sensor networks,. in Proc.11th Nat.Conf.Artif.Intell., Washington, July 1993, pp. 210–216.
K. S. Decker and V. R. Lesser, Quantitative modeling of complex computational task environments, in Proc.11th Nat.Conf.Artif.Intell., Washington, July 1993, pp. 217–224.
K. S. Decker and V. R. Lesser, Designing a family of coordination algorithms,. in Proc.First Int. Conf.Multi-Agent Syst., San Francisco, June 1995, AAAI Press, pp. 73–80.Longer version available as UMass CS-TR 94–14.
K. S. Decker and K. Sycara, Intelligent adaptive information agents,. J.Intell.Inform.Syst. Vol. 9, pp. 239–260, 1997.
E. H. Durfee and V. R. Lesser, Using partial global plans to coordinate distributed problem solvers,. in Proc.10th Int.Joint Conf.Artif.Intell., August 1987.
K. Erol, D. Nau, and J. Hendler, Semantics for hierarchical task-network planning,. Technical report CS-TR-3239, UMIACS-TR-94–31, Computer Science Dept., University of Maryland, 1994.
L. Garrido and K. Sycara, Multi-agent meeting scheduling: Preliminary experimental results,. in Proc.2nd Int.Conf.Multi-Agent Syst. Kyoto, June 1996, AAAI Press.
J. Graham and K. S. Decker, Towards a distributed, environment-centered agent framework,. in Proc.1999 Int.Workshop Agent Theories, Architectures, and Languages (ATAL-99), 1999.
N. R. Jennings, Commitments and convections: The foundation of coordination in multi-agent systems,. Knowledge Eng.Rev. Vol. 8, pp. 223–250, 1993.
C. A. Knoblock, Building a planner for information gathering: A report from the trenches,. in Proc.3rd Int.Conf.Artif.Intell.Planning Syst.(AIPS96), 1996, AAAI Press.
A. Kumar and P. S. Ow, A study of distributed problem solving for patient scheduling,. in Proc. ORSA/TIMS, Washington, DC, 1988.
B. Lâassri, H. Lâassri, and V. R. Lesser, Negotiation and its role in cooperative distributed problem solving,. in Proc.10th Int.Workshop Distributed AI, Texas, October 1990. Also COINS TR-90–39.
H. J. Levesque, P. R. Cohen, and J. H. T. Nunes, On acting together,. in Proc.8th Nat.Conf.Artif. Intell. July 1990, pp. 94–99.
J. Liu and K. Sycara, Distributed problem solving through coordination in a society of agents,. in Proc.13th Int.Workshop on Distributed AI, Seattle, WA, July 1994, pp. 190–206. AAAI Press Technical Report WS-94–02.
J. Liu and Sycara. Exploiting problem structure for distributed constraint optimization,. in Proc. First Int.Conf.Multi-Agent Syst., San Francisco, June 1995, pp. 246–253, AAAI Press.
P. S. Ow, M. J. Prietula, and W. Hsu, Configuring knowledge-based systems to organizational structures: Issues and examples in multiple agent support,. In L. F. Pau, J. Motiwalla, Y. H. Pao, and H. H. Teh, ed. Expert Systems in Economics, Banking, and Management, North-Holland: Amsterdam, 1989, pp. 309–318.
M. V. Nagendra Prasad, K. S. Decker, A. Garvey, and V. R. Lesser, Exploring organizational designs with tÆms: A case study of distributed data processing,. in Proc.2nd Int.Conf.Multi-agent Systems, Kyoto, Japan, December 1996.
M. V. Nagendra Prasad and V. R. Lesser, Learning situation-speci_c coordination in generalized partial global planning,. in AAAI Spring Symp.Adaptation, Co-evolution and Learning in Multiagent Syst., Stanford, March 1996.
J. S. Rosenschein and G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation among Computers, MIT Press: Cambridge, MA, 1994.
S. Sen and E. Durfree, Unsupervised surrogate agents and search bias change in flexible distributed scheduling,. in Proc.First Int.Conf.Multi-Agent Syst., San Francisco, June 1995, pp. 336–343. AAAI Press.
R. Simmons, Structured control for autonomous robots,. IEEE Trans.Robot.Autom. Vol. 10, February 1994.
T. Sugawara and V. R. Lesser, On-line learning of coordination plans,. Computer Science Technical Report 93–27, University of Massachusetts, 1993.
A. Tanenbaum, Synchronization in distributed systems,. Modern Operating Systems, Prentice Hall, 1992.
A. Tanenbaum, The medium access sublayer,. Computer Networks, Prentice Hall, 1994.
T. Wagner, A. Garvey, and V. Lesser, Complex goal criteria and its application in design-to-criteria scheduling,. in Proc.14th Nat.Conf.Artif.Intell., Providence, July 1997.
M. P. Wellman and J. Doyle, Modular utility representation for decision-theoretic planning,. in Proc.First Int.Conf.Artif.Intell.Planning Syst., June 1992, pp. 236–242.
M. Williamson, K. S. Decker, and K. Sycara, Executing decision-theoretic plans in multiagent environments,. in AAAI Fall Symposium on Plan Execution, November 1996. AAAI Report FS-96–01.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Decker, K., Li, J. Coordinating Mutually Exclusive Resources using GPGP. Autonomous Agents and Multi-Agent Systems 3, 133–157 (2000). https://doi.org/10.1023/A:1010074611407
Issue Date:
DOI: https://doi.org/10.1023/A:1010074611407