On the Benefit of Sub-Optimality within the Divide-and-Evolve Scheme

Jacques Bibai 1, 2 Pierre Savéant 1 Marc Schoenauer 2 Vidal Vincent 3
2 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. DaE optimizes either the number of actions, or the total cost of actions, or the total makespan, by generating ordered sequences of intermediate goals via artificial evolution. The evolutionary part of DaE is based on the Evolving Objects (EO) library, and can theorically use any embedded planner. However, since the introduction of this approach only one embedded planner has been used: the temporal optimal planner CPT. In this paper, we built a new version of DaE based on time-based Atom Choice and we embarked another planner (the sub-optimal planner YAHSP) in order to test the technical robustness of the approach and to compare the impact of using an optimal planner versus using a sub-optimal planner for all kinds of planning problems.
Document type :
Conference papers
Complete list of metadatas

Contributor : Jacques Bibai <>
Submitted on : Tuesday, January 5, 2010 - 1:56:19 PM
Last modification on : Monday, December 9, 2019 - 5:24:06 PM
Long-term archiving on: Thursday, June 17, 2010 - 10:19:20 PM


Files produced by the author(s)




Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vidal Vincent. On the Benefit of Sub-Optimality within the Divide-and-Evolve Scheme. 10th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2010 ), Apr 2010, Istanbul, Turkey. pp.23-34, ⟨10.1007/978-3-642-12139-5_3⟩. ⟨inria-00443984⟩



Record views


Files downloads