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

DOI10.1016/0020-0190(96)00047-6zbMath0875.68771OpenAlexW2090333777MaRDI QIDQ671265

Pallab Dasgupta, Partha Pratim Chakrabarti, S. C. 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

• Unnamed Item
• Searching in the plane
• Shortest paths without a map
• Depth-first iterative-deepening: An optimal admissible tree search
• Walking an unknown street with bounded detour
• Agent searching in a tree and the optimality of iterative deepening
• Real-time heuristic search

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