Abstract
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Problems (TPPs). Whereas standard Memetic Algorithms use local search methods to improve the evolutionary solutions, and thus fail when the local method stops working on the complete problem, the Divide-and-Evolve approach splits the problem at hand into several, hopefully easier, sub-problems, and can thus solve globally problems that are intractable when directly fed into deterministic OR algorithms. But the most prominent advantage of the Divide-and-Evolve approach is that it immediately opens up an avenue for multi-objective optimization, even though the OR method that is used is single-objective. Proof of concept approach on the standard (single-objective) Zeno transportation benchmark is given, and a small original multi-objective benchmark is proposed in the same Zeno framework to assess the multi-objective capabilities of the proposed methodology, a breakthrough in Temporal Planning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brie, A.H., Morignot, P.: Genetic Planning Using Variable Length Chromosomes. In: 15th Intl Conf. on Automated Planning and Scheduling (2005)
Bylander, T.: The Computational Complexity of Propositional STRIPS planning. Artificial Intelligence 69(1-2), 165–204 (1994)
Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)
Desquilbet, C.: Détermination de trajets optimaux par algorithmes génétiques. Rapport de stage d’option B2 de l’Ecole Polytechnique. Palaiseau, France, Advisor: Marc Schoenauer (Juin 1992) (in French)
Fikes, R., Nilsson, N.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 1, 27–120 (1971)
Fox, M., Long, D.: The Automatic Inference of State Invariants in TIM. Journal of Artificial Intelligence Research 9, 367–421 (1998)
Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research 20, 61–124 (2003)
Geffner, H.: Perspectives on Artificial Intelligence Planning. In: Proc. AAAI-2002, pp. 1013–1023 (2002)
Grefenstette, J.J.: Incorporating Problem Specific Knowledge in Genetic Algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 42–60. Morgan Kaufmann, San Francisco (1987)
Hart, W.E., Krasnogor, N., Smith, J.E. (eds.): Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol. 166. Springer, Heidelberg (2005)
Koehler, J., Hoffmann, J.: On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm. JAIR 12, 338–386 (2000)
Korf, R.: Planning as Search: A Quantitative Approach. Artificial Intelligence 33, 65–88 (1987)
McDermott, D.: PDDL – The Planning Domain Definition language (1998), At http://ftp.cs.yale.edu/pub/mcdermott
Merz, P., Freisleben, B.: Fitness Landscapes and Memetic Algorithm Design. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 245–260. McGraw-Hill, London (1999)
Schlabach, J.L., Hayes, C.C., Goldberg, D.E.: FOX-GA: A Genetic Algorithm for Generating and Analyzing Battlefield Courses of Action. Evolutionary Computation 7(1), 45–68 (1999)
Smith, D., Weld, D.S.: Temporal Planning with Mutual Exclusion Reasoning. In: Proceedings of IJCAI-1999, pp. 326–337 (1999)
Spector, L.: Genetic Programming and AI Planning Systems. In: Proc. AAAI 1994, pp. 1329–1334. AAAI/MIT Press (1994)
Vidal, V., Geffner, H.: Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. In: Proceedings of AAAI-2004, pp. 570–577 (2004)
Weld, D.S.: An Introduction to Least Commitment Planning. AI Magazine 15(4), 27–61 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schoenauer, M., Savéant, P., Vidal, V. (2006). Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2006. Lecture Notes in Computer Science, vol 3906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730095_21
Download citation
DOI: https://doi.org/10.1007/11730095_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33178-0
Online ISBN: 978-3-540-33179-7
eBook Packages: Computer ScienceComputer Science (R0)