Abstract
In multi-component systems, individual components must be assigned to the tasks that they are to perform. In many applications, there are several possible task decompositions that could be used to achieve the task, and there are limited resources available throughout the system. We present a technique for making task assignments under these conditions. Constraint satisfaction is used to assign components to particular tasks. The task decomposition is selected using heuristics to suggest a decomposition for which an assignment can be found efficiently. We have applied our technique to the problem of task assignment in systems of underwater robots and instrument platforms working together to collect data in the ocean.
This work was funded in part by contract N0001-14-96-1-5009 from the Office of Naval Research. Thanks to Dick Blidberg, Steve Chappell, Jim Kadin, and the UMaine CDPS group for many insightful comments on this work.
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
Curtin, T.B., Bellingham, J.G., Catipovic, J., Webb, D.: Autonomous oceanographic sampling networks. Oceanography. 6 (1993)
Fox, M.S., Sadeh, N., Bayken, C.: Constrained heuristic search. In: Eleventh International Joint Conference on Artificial Intelligence. (1989) 309–315
Turner, R.M., Turner, E.H.: Organization and reorganization of autonomous oceanographic sampling networks. In: International Conference on Robotics and Autonmation. (to appear)
Smith, R.G.: The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Transactions on Computers. 12 (1980) 1104–1113
Durfee, E.H., Lesser V.R.: Negotiating task decomposition and allocation using partial global planning. In: Gasser, L., Huhns, M. N. (eds.): Distributed Artificial Intelligence. Morgan Kaufmann Publishers, Inc., San Mateo, CA (1989) 229–243
Sadeh, N., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence. 86 (1996) 1–41
Baykan, C.A., Fox, M.S.: Constraint techniques for spatial planning. In: ten Hagen, P.J. W., Veerkamp, P. J. (eds.): Intelligent CAD Systems III: Practical Experience and Evaluation. Springer-Verlag, New York (1991) 187–204
Sathi, N., Fox, M.S., Goyal, R., Kott, A.S.: Resource configuration and allocation: A case study of constrained heuristic search. IEEE Expert. 7 (1992) 26–35
Turner, E.H., Turner, R.M.: Selecting task decompositions for constrained heuristic search (in preparation)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Turner, E.H., Turner, R.M. (1998). A constraint-based approach to assigning system components to tasks. In: Mira, J., del Pobil, A.P., Ali, M. (eds) Methodology and Tools in Knowledge-Based Systems. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64582-9_761
Download citation
DOI: https://doi.org/10.1007/3-540-64582-9_761
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64582-5
Online ISBN: 978-3-540-69348-2
eBook Packages: Springer Book Archive