Admissibility of AO* when heuristics overestimate

Authors:
P. P. Chakrabarti;S. Ghose;S. C. DeSarkar
Affiliations:
Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India
Venue:
Artificial Intelligence
Year:
1987

Heuristic search in cyclic AND/OR graphs

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Sequential Decision Models for Expert System Optimization

IEEE Transactions on Knowledge and Data Engineering
Anytime search in dynamic graphs

Artificial Intelligence
Anytime heuristic search

Journal of Artificial Intelligence Research
A heuristic search approach to planning with continuous resources in stochastic domains

Journal of Artificial Intelligence Research
Towards finding optimal solutions with non-admissible heuristics: a new technique

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

Hi-index	0.00