The composite decision process: a unifying formulation for heuristic search, dynamic programming and branch & bound procedures

Vipin Kumar, Laveen N. Kanal · National Conference on Artificial Intelligence · 1983

In this short paper we present a brief exposition of a composite decision process - our unifying formulation of search procedures - which provides new insights concerning the relationships among heuristic search, dynamic programming and branch and bound procedures.

Read the paper · More papers on PaperTik