Français
3. Representation of the placement problem
Placement is an ordered combination of shapes. All combinations can be represented by a tree-structured state graph. The optimal placement problem then becomes a problem of finding the optimal path between the root of the tree, where no shape is placed, and a leaf of the tree, whose corresponding placement occupies the minimum area. To solve this optimization problem numerically, we need to define a state representation for traversing the search space and adopt a state exploration algorithm.
3.1 State graphs and placement
Here we recall some definitions ...
The Ultimate Scientific and Technical Reference
This article is included in
Control and systems engineering
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Representation of the placement problem
Tree search algorithms
References
The Ultimate Scientific and Technical Reference
