A DECISION STRUCTURE USING GENERALIZED AND OR TREES CONTAINING CHANCE NODES Academic Article

abstract

• A decision structure was developed which generalizes the well known AND/OR trees to include "CHANCE" nodes. A CHANCE node is a generalization of an AND node and its associated value is defined as the expected value of the successors. A search algorithm was developed for this decision structure. The algorithm utilizes an informed model, which encodes heuristic information as upper and lower bounds for non-terminal nodes. These "CHANCE/OR" trees pertain to a large variety of decision processes involving limited look-ahead, and reasoning under uncertainty, e.g. strategic decision making, short-term planning, etc. The search algorithm was implemented and tested against a direct extension of the - pruning procedure. The results of 1440 runs of the algorithms based on various matrices and tree configurations were analyzed and discussed. The computational results show that the proposed algorithm can sufficiently solve trees of various configurations within reasonable computer time. 1994.

authors

• Leon, Victor

published proceedings

• COMPUTERS & INDUSTRIAL ENGINEERING

author list (cited authors)

• WU, S. D., & LEON, V. J.

citation count

• 0

complete list of authors

• WU, SD||LEON, VJ

publication date

• January 1994

publisher

• Elsevier  Publisher

published in

• Computers and Industrial Engineering  Journal

keywords

• Networking And Information Technology R&d
• Patient Safety

Digital Object Identifier (DOI)

• 10.1016/0360-8352(94)90034-5

start page

• 151

end page

• 171

volume

• 26

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2F0360-8352%2894%2990034-5