Abstract
We present a methodology for the composition of rich services that exhibit temporal uncertainty and complex task dependencies. Our multi-agent approach incorporates temporal and stochastic planning paradigms and commitment-based negotiation to achieve coordinated provision of services with stochastic outcomes. This is all captured within a service-choreography protocol, by which agents can request services and receive probabilistic temporal service promises, to iteratively converge on coordinated behavior. We argue that such an approach partially decouples the problems of negotiating service interactions and computing service policies, so as to more efficiently converge on good solutions.
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
ter Beek, M.H., Bucchiarone, A., Gnesia, S.: A survey on service composition approaches: From industrial standards to formal methods. Technical Report 2006-TR-15 (2006)
Rao, J., Su, X.: A survey of automated web service composition methods. In: SWSWPC, pp. 43–54 (2004)
Papazoglou, M.P., Traverso, P., Dustdar, S., Leymann, F.: Service-oriented computing: State of the art and research challenges. Computer 40(11), 38–45 (2007)
Vere, S.A.: Planning in time: Windows and durations for activities and goals. IEEE Trans. Pattern Anal. and Machine Intelligence 5, 246–267 (1983)
Boutilier, C., Dean, T., Hanks, S.: Planning under uncertainty: Structural assumptions and computational leverage. In: Ghallab, M., Milani, A. (eds.) New Directions in AI Planning, pp. 157–172. IOS Press, Amsterdam (1996)
Tsamardinos, I., Pollack, M.: Efficient solution techniques for disjunctive temporal problems (2002)
Stergiou, K., Koubarakis, M.: Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120(1), 81–117 (2000)
Kallenberg, L.: Linear Programming and Finite Markovian Control Problems. Math. Centrum, Amsterdam (1983)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Chichester (1994)
D’Epenoux: A probabilistic production and inventory problem. Management Science 10, 98–108 (1963)
Witwicki, S., Durfee, E.: Commitment-driven distributed joint policy search. In: Proceedings of the Sixth Intl. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2007), Honolulu, HI, pp. 480–487 (2007)
Musliner, D.J., Durfee, E.H., Wu, J., Dolgov, D.A., Goldman, R.P., Boddy, M.S.: Coordinated plan management using multiagent MDPs. In: Working Notes of the AAAI Spring Symp. on Distributed Plan and Schedule Management (March 2006)
Goldman, C.V., Zilberstein, S.: Decentralized control of cooperative systems: Categorization and complexity analysis. Journal of Artificial Intelligence Research 22, 143–174 (2004)
Nair, R., Varakantham, P., Tambe, M., Yokoo, M.: Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In: AAAI 2005, pp. 133–139 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witwicki, S.J., Durfee, E.H. (2008). Commitment-Based Service Coordination. In: Kowalczyk, R., Huhns, M., Klusch, M., Maamar, Z., Vo, Q.B. (eds) Service-Oriented Computing: Agents, Semantics, and Engineering. SOCASE 2008. Lecture Notes in Computer Science, vol 5006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79968-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-79968-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79967-2
Online ISBN: 978-3-540-79968-9
eBook Packages: Computer ScienceComputer Science (R0)