Abstract
OSCG is a general admissible algorithm which finds an optimal path through multiple dependent goals in a labelled directed graph. It uses constraints to turn the problem of solving multiple dependent goals into that of solving multiple independent ones. OSCG arose out of work on MARPLES, a route planning expert system. OSCG's admissibility is proven, and related and further work discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chapman, David (1987), Planning for Conjunctive Goals,AI 32,pp337–377.
Dechter R. and Pearl J. (1988), Network based heuristics for Constraint Satisfaction Problems, AI 34 (1), pp. 1–38
Fox, M. S., Sadeh N., Baykan C. (1989), Constrained Heuristic Search, IJCAI 89
Freuder, E. C. (1982), A sufficient condition of backtrack-free search, J. ACM 29 (1)
Gallo, P., Dabbene D., Luise, F., Giordanengo, P. (1989), Expert System for pilot assistance: The Challenge of an intensive prototyping. Proc. “Applications of Artificial Intelligence” VII SPIE, Orlando, Florida.
Hayes, Caroline (1987), Using Goal Interactions to Guide Planning, AAAI 87.
Hendler, J., Tate A., Drummond M. (1990) AI Planning: Systems and Techniques AI Magazine, Summer 1990.
Joslin, David, and Roach, John (1989) A Theoretical Analysis of Conjunctive-Goal Problems AI 41, pp97–106.
Kumar V. (1987), Search, Branch and Bound in Shapiro and Eckroth eds.
Mackworth A. K.(1987) Constraint Satisfaction in Shapiro and Eckroth eds.
Mackworth, A.K. and Freuder E.C. (1985) The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems AI 25(1), pp65–74.
Natarajan K. S. (1987) Optimizing Backtrack Search for All Solutions to Conjunctive Problems, IJCAI 87, pp955–958
Pearl J. (1984) Heuristics Addison-Wesley, London.
Shapiro and Eckroth (1987) (eds), Encyclopedia of Artificial Inteligence, Wiley-Interscience, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ellman, J., Mezzanatto, G. (1991). Optimal search for conjunctive goals using constraints. In: Ardizzone, E., Gaglio, S., Sorbello, F. (eds) Trends in Artificial Intelligence. AI*IA 1991. Lecture Notes in Computer Science, vol 549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54712-6_222
Download citation
DOI: https://doi.org/10.1007/3-540-54712-6_222
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54712-9
Online ISBN: 978-3-540-46443-3
eBook Packages: Springer Book Archive