Turbo Planning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Turbo Planning

Résumé

The complexity of planning problems comes from the size of the state graph of the systems, which suggests to consider factored (or distributed) solutions. We previously proposed a solution of this kind which revealed to be very efficient on problems where components have a sparse interaction. This work explores a step further in this direction. The idea is to extend the celebrated turbo algorithms, extremely successful to decode large-scale sparse error correcting codes. The paper proposes an adaptation of this technique to the setting of cost-optimal factored planning, and illustrates its behavior on large randomly generated systems.
Fichier principal
Vignette du fichier
WODES2012.pdf (230.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01699581 , version 1 (02-02-2018)

Identifiants

Citer

Loïg Jezequel, Eric Fabre. Turbo Planning. Wodes 2012 - 11th International Workshop on Discrete Event Systems, Oct 2012, Guadalajara, Mexico. pp.301 - 306, ⟨10.3182/20121003-3-MX-4033.00049⟩. ⟨hal-01699581⟩
108 Consultations
71 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More