O'Reilly logo

Quotient Space Based Problem Solving by Bo Zhang, Ling Zhang

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

6.3. The Discussion of Statistical Heuristic Search

6.3.1. Statistical Heuristic Search and Quotient Space Theory

The heuristic search generally implements on a tree. A tree is a specific case of a sequence of quotient spaces. If in a sequence of hierarchical quotient spaces, the number of elements in each level is finite, then it’s a tree. Assume that SA implements its search on a uniform m-tree. Let image be the sub-nodes in the first level. From quotient space point of view, it is equivalent to the partition image of domain , where is a set of leaf nodes ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required