The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch and Bound Procedures +

Vipin Kumar, Laveen Kanal

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.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.