Advertisement
Published in:
2014 | OriginalPaper | Chapter
Rule Based Stochastic Tree Search
Authors : Mukund Kumar, Matthew I. Campbell, Corinna Königseder, Kristina Shea
Published in: Design Computing and Cognition '12
Publisher: Springer Netherlands
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
This work presents a new search process for composite decision processes (CDPs; also known as a tree-search problems [1]) that is especially suited to problems represented by grammars. Many of the methods that are used to find an optimal or near-optimal solution in a large tree have been developed for path-planning problems (like A* [2]) and thus have requirements that are not well suited to design problems. With the recent attention on grammars in design, we find that design trees are often produced but difficult to search. Since existing path-planning methods are sensitive to the size of the space, and often put a low priority on the number of objective function evaluations, it is imperative to develop new search methods that can find the best solution within a large tree by doing the least number of evaluations as possible. In a previous paper, an interactive algorithm for searching in a graph grammar representation was presented.