Tree search algorithms
Optimizing the placement of irregular shapes
Article REF: S7212 V1
Tree search algorithms
Optimizing the placement of irregular shapes

Authors : Salah MAOUCHE, Catherine K. BOUNSAYTHIP, Gilles ROUSSEL

Publication date: December 10, 2000 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

4. Tree search algorithms

Before reviewing a few algorithms that can be used for the placement problem, a classification of algorithms will help clarify their presentation.

4.1 Classification

A*, Aε∗ and Rδ∗ are algorithms with deterministic strategies. Exploration respects a set of systematic rules or criteria for selecting a state or pruning a branch of the tree. They come in two types:

  • uninformed strategies, such as "depth first" or "width...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Control and systems engineering"

( 143 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact our team FAQ