Agent searching in a tree and the optimality of iterative deepening
type: Item
instance of: scholarly article
title: Agent searching in a tree and the optimality of iterative deepening
zbMATH Open document ID: 0824.68098
DOI: 10.1016/0004-3702(94)90066-3
author: Pallab Dasgupta
author: P. P. Chakrabarti
author: S. De Sarkar
published in: Artificial Intelligence
publication date: 1995-01-09T00:00:00Z
Mathematics Subject Classification ID: 68T01
zbMATH DE Number: 708645
zbMATH Keywords: agent searching
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90066-3
OpenAlex ID: W2084717646
cites work: Searching in the plane
cites work: Parallel searching in the plane
cites work: Heuristic search in restricted memory
cites work: Q4012191
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Real-time heuristic search
cites work: Linear-space best-first search
cites work: On the asymptotic performance of IDA
cites work: Shortest paths without a map
cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
description: scientific article; zbMATH DE number 708645