Agent search in uniform b-ary trees: Multiple goals and unequal costs

DOI10.1016/0020-0190(96)00047-6MaRDI QIDQ671265zbMATH 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(96)00047-6

zbMATH Keywords

AlgorithmsBacktracking searchOn-line search

Mathematics Subject Classification ID

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

Cites work

• Agent searching in a tree and the optimality of iterative deepening
• Depth-first iterative-deepening: An optimal admissible tree search
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• Real-time heuristic search
• Searching in the plane
• Shortest paths without a map
• Walking an unknown street with bounded detour

This page was built for publication: Agent search in uniform b-ary trees: Multiple goals and unequal costs

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