Optimal search for conjunctive goals using constraints
作者： Jeremy Ellman , Giancarlo Mezzanatto
DOI: 10.1007/3-540-54712-6_222
关键词:
摘要: OSCG is a general admissible algorithm which finds an optimal path through multiple dependent goals in labelled directed graph. It uses constraints to turn the problem of solving into that independent ones. arose out work on MARPLES, route planning expert system. OSCG's admissibility proven, and related further discussed.
springer.com
sci-hub.st 参考文章(10)
K. S. Natarajan, Optimizing backtrack search for all solutions to conjunctive problems international joint conference on artificial intelligence. pp. 955- 958 ,(1987)
Caroline Hayes, Using goal interactions to guide planning national conference on artificial intelligence. pp. 224- 228 ,(1987)
Norman Sadeh, Can Baykan, Mark S. Fox, Constrained heuristic search international joint conference on artificial intelligence. pp. 309- 315 ,(1989)
Eugene C. Freuder, A Sufficient Condition for Backtrack-Free Search Journal of the ACM. ,vol. 29, pp. 24- 32 ,(1982) , 10.1145/322290.322292
Paolo Gallo, Danilo Dabbene, Federica Luise, Patrizia Giordanengo, Expert System For Pilot Assistance: The Challenge Of An Intensive Prototyping Applications of Artificial Intelligence VII. ,vol. 1095, pp. 1101- 1117 ,(1989) , 10.1117/12.969359
David Joslin, John Roach, A theoretical analysis of conjunctive-goal problems Artificial Intelligence. ,vol. 41, pp. 97- 106 ,(1989) , 10.1016/0004-3702(89)90081-7
Alan K. Mackworth, Eugene C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems Artificial Intelligence. ,vol. 25, pp. 65- 74 ,(1985) , 10.1016/0004-3702(85)90041-4
Mark Drummond, Austin Tate, James Hendler, AI planning: systems and techniques Ai Magazine. ,vol. 11, pp. 61- 77 ,(1990) , 10.1609/AIMAG.V11I2.833
David Chapman, Planning for Conjunctive Goals Artificial Intelligence. ,vol. 32, pp. 333- 377 ,(1987) , 10.1016/0004-3702(87)90092-0
Rina Dechter, Judea Pearl, Network-Based Heuristics for Constraint-Satisfaction Problems Search in Artificial Intelligence. pp. 370- 425 ,(1988) , 10.1007/978-1-4613-8788-6_11