Abstract
We show that the search technique of dynamic programming models a form of multiagent computation characterized by the interaction of cooperating/competing agents. For this reason, dynamic programming algorithms can be easily implemented in an object-oriented concurrent language environment. We illustrate this by a simple example implemented in the object-oriented concurrent language LO, involving the finding of the best path from the initial to the final vertex in a network where the connecting edges are associated with cost weights.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.M. Andreoli. Proposition pour une synthèse des paradigmes de la programmation logique et de la programmation par objets, 1990. Thèse d'Informatique de l'Université de Paris VI (Paris, France).
J.M. Andreoli and R. Pareschi. LO and behold! concurrent structured processes. In Proc. of OOPSLA/ECOOP'90, Ottawa, Canada, 1990.
J.M. Andreoli and R. Pareschi. Communication as fair distribution of knowledge. In Proc. of OOPSLA'91, Phoenix, U.S.A., 1991.
J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, To appear, 1991. (Special issue, Selected papers from ICLP'90).
J.P. Banâtre, A. Coutant, and D. Le Metayer. A parallel machine for multiset transformation and its programming style. Future Generation Computer Systems, 4, 1988.
J. Ferber and E. Jacopin. The framework of eco problem solving. In Proc. of MAAMAW'90, 1990.
J.Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrcoli, JM., Pareschi, R., Bourgois, M. (1992). Dynamic programming as multiagent programming. In: Tokoro, M., Nierstrasz, O., Wegner, P. (eds) Object-Based Concurrent Computing. ECOOP 1991. Lecture Notes in Computer Science, vol 612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55613-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-55613-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55613-8
Online ISBN: 978-3-540-47260-5
eBook Packages: Springer Book Archive