Utility of pathmax in partial order heuristic search

DOI10.1016/0020-0190(95)00086-RMaRDI QIDQ1352123zbMATH OpenOpenAlexFDO

Authors Pallab Dasgupta, P. P. Chakrabarti, S. De Sarkar

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00086-r

zbMATH Keywords

Artificial intelligenceMultiobjective optimizationHeuristic search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Inconsistent heuristics in theory and practice
• scientific article; zbMATH DE number 1322819
• scientific article; zbMATH DE number 4097148
• A case of pathology in multiobjective heuristic search
• Generalized best-first search strategies and the optimality of A*

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• A heuristic search algorithm with modifiable estimate
• Generalized best-first search strategies and the optimality of A*
• Heuristic search in restricted memory
• Multiobjective A*
• On the complexity of admissible search algorithms
• On the optimality of A
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

Cited in

(4)

• Inconsistent heuristics in theory and practice
• Lower bound sets for biobjective shortest path problems
• A percentile system optimization approach with and without path enumeration
• Vectorial pattern databases

This page was built for publication: Utility of pathmax in partial order heuristic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352123)