Abstract
This paper considers the problem of temporal scheduling of actions in a cooperative activity under time constraints. In order to carry out their cooperative activity the agents perform collaborative planning that includes processes that are responsible for identifying recipes, assigning actions to agents and determining the time of the actions. A recipe for an action consists of subactions which may be either basic actions or complex actions.
This work is supported in part by NSF under Grant No. IIS-9907482.
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
B. Grosz and S. Kraus. Collaborative plans for complex group action. AIJ,86, 1996.
M. Hadad, S. Kraus, Y. Gal,and R. Lin. Time reasoning for a collaborative planning agent in a dynamic environment. Annals of Math. and AI,2001. http://www.cs.biu.ac.il/sarit/articles.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hadad, M., Kraus, S. (2001). A Mechanism for Temporal Reasoning by Collaborative Agents. In: Klusch, M., Zambonelli, F. (eds) Cooperative Information Agents V. CIA 2001. Lecture Notes in Computer Science(), vol 2182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44799-7_25
Download citation
DOI: https://doi.org/10.1007/3-540-44799-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42545-8
Online ISBN: 978-3-540-44799-3
eBook Packages: Springer Book Archive