Agent searching in a tree and the optimality of iterative deepening

DOI10.1016/0004-3702(94)90066-3zbMath0824.68098OpenAlexW2084717646MaRDI QIDQ1341670

Pallab Dasgupta, Partha Pratim Chakrabarti, S. C. de Sarkar

Publication date: 9 January 1995

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90066-3

zbMATH Keywords

agent searching

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Related Items (9)

Anytime search in dynamic graphs ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ Agent search in uniform b-ary trees: Multiple goals and unequal costs ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization ⋮ A correction to: ``Agent searching in a tree and the optimality of iterative deepening ⋮ Controlling the learning process of real-time heuristic search

Cites Work

• Unnamed Item
• Linear-space best-first search
• Searching in the plane
• Shortest paths without a map
• Depth-first iterative-deepening: An optimal admissible tree search
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Heuristic search in restricted memory
• On the asymptotic performance of IDA
• Parallel searching in the plane
• Real-time heuristic search

This page was built for publication: Agent searching in a tree and the optimality of iterative deepening