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
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Representation of the placement problem
Tree search algorithms
Article included in this offer
"Control and systems engineering"
(
143 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
References
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
