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

DOI10.1016/0020-0190(96)00047-6zbMATH Open0875.68771OpenAlexW2090333777MaRDI QIDQ671265FDOQ671265

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

• Real-time heuristic search
• Searching in the plane
• Shortest paths without a map
• Walking an unknown street with bounded detour
• Depth-first iterative-deepening: An optimal admissible tree search
• Title not available (Why is that?)
• Agent searching in a tree and the optimality of iterative deepening

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)