Learning to Solve Planning Problems Efficiently by Means of Genetic Programming

Evolutionary Computation

Volumn 9, Issue 4, 2001, Pages 387-420

  Aler, Ricardo ^a   Borrajo, Daniel ^a   Isasi, Pedro ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Evolving heuristics; Genetic planning; Genetic programming; Planning; Search

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING;

BLOCKS WORLDS; DECLARATIVE PROBLEM SOLVING; EVOLVING HEURISTIC; GENETIC OPERATORS; GENETIC PLANNING; PERFORMANCE; PLANNING DOMAINS; PLANNING PROBLEM; PLANNING SYSTEMS; SEARCH;

GENETIC PROGRAMMING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAM; DECISION TREE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION TREES; SOFTWARE;

EID: 0035650721     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/10636560152642841     Document Type: Article

References (53)

1. Aler, R., Borrajo, D., and Isasi, P. (1998a). Evolving heuristics for planning. Lecture Notes in Computer Science, 1447:745–754.
2. Aler, R., Borrajo, D., and Isasi, P. (1998b). Genetic programming and deductive-inductive learning: A multistrategy approach. In Shavlik, J., editor, Proceedings of the Fifteenth International Conference on Machine Learning, pages 10–18, Morgan Kaufmann, San Francisco, California.
3. Aler, R., Borrajo, D., and Isasi, P. (2001). Grammars for learning control knowledge with gp. In Greenwood, G., editor, Proceedings of the Conference on Evolutionary Computation, pages 1220– 1227, IEEE Press, Piscataway, New Jersey.
4. Andre, D. and Teller, A. (1999). Evolving Team Darwin United. Lecture Notes in Computer Science, 1604:346–351.
5. Angeline, P. J. and Pollack, J. B. (1992). The evolutionary induction of subroutines. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, pages 236–241, Lawrence Erlbaum, Hillsdale, New Jersey.
6. Bennett III, F. H. (1996). Automatic creation of an efficient multi-agent architecture using genetic programming with architecture-altering operations. In Koza, J. R. et al., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 30–38, MIT Press, Cambridge, Massachusetts.
7. Berlanga, A. (2000). Dinámica evolutiva/involutiva para la obtención de soluciones generales en com-putación evolutiva (Evolutive/Involutive Dynamics for obtaining general solutions in evolutionary computing). Ph.D. thesis, Computer Science, Universidad Carlos III de Madrid, Madrid, Spain.
8. Blum, A. L. and Furst, M. L. (1995). Fast planning through planning graph analysis. In Mellish, C. S., editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1636–1642, Morgan Kaufmann, San Francisco, California.
9. Bonet, B. and Geffner, H. (1999). Planning as heuristic search: New results. Lecture Notes in Computer Science, 1809:360–372.
10. Borrajo, D. and Veloso, M. (1997). Lazy incremental learning of control knowledge for efficiently obtaining quality plans. AI Review Journal. Special Issue on Lazy Learning, 11(1-5):371–405.
11. Borrajo, D., Vegas, S., and Veloso, M. (2001). Quality-based learning for planning. In Working notes of the International Joint Conference on Artificial Intelligence Workshop on Planning with Resources, pages 9–17, IJCAI Press.
12. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165–204.
13. Cohen, P. R. (1995). Empirical Methods for Artificial Intelligence. Massachusetts Institute of Technology, Cambridge, Massachusetts.
14. Estlin, T. A. (1998). Using Multi-Strategy Learning to Improve Planning Efficiency and Quality. Ph.D. thesis, Department of Computer Sciences, University of Texas, Austin, Texas.
15. Estlin, T. A. and Mooney, R. J. (1997). Learning to improve both efficiency and quality of planning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 1227– 1233, Morgan Kaufmann, San Francisco, California.
16. Fikes, R. and Nilsson, N. (1971). A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189–208.
17. Fink, E. and Veloso, M. (1996). Formalizing the PRODIGY planning algorithm. In Ghallab, M. and Milani, A., editors, New Directions in AI Planning, pages 261–272. IOS Press, Amsterdam, The Netherlands.
18. Freeman, J. J. (1998). A linear representation for GP using context free grammars. In Koza, J. R. et al., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 72–77, Morgan Kaufmann, San Francisco, California.
19. Gathercole, C. and Ross, P. (1994). Some training subset selection methods for supervised learning in genetic programming. Lecture Notes in Computer Science, 866:312–321.
20. Gupta, N. and Nau, D. (1992). On the complexity of blocks-world planning. Artificial Intelligence, 56:223–254.
21. Handley, S. G. (1994). The automatic generations of plans for a mobile robot via genetic programming with automatically defined functions. In Kinnear, K. E., editor, Advances in Genetic Programming, chapter 18, pages 391–407. MIT Press, Cambridge, Massachusetts.
22. Kambhampati, S. (1989). Flexible Reuse and Modification in Hierarchical Planning: A ValidationStruc-ture Based Approach. Ph.D. thesis, Computer Vision Laboratory, Center for Automation Research, University of Maryland, College Park, Maryland.
23. Kambhampati, S. (1999). Improving Graphplan’s search with EBL & DDB techniques. In Dean, T., editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 982–987, Morgan Kaufmann, San Francisco, California.
24. Katukam, S. and Kambhampati, S. (1994). Learning explanation-based search control rules for partial order planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 582–587, AAAI Press, Menlo Park, California.
25. Koza, J. R. (1989). Hierarchical genetic algorithms operating on populations of computer programs. In Sridharan, N. S., editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, volume 1, pages 768–774. Morgan Kaufmann, San Francisco, California.
26. Koza, J. R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, Massachusetts.
27. Koza, J. R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts.
28. Koza, J. R. (1995). Evolving the architecture of a multi-part program in genetic programming using architecture-altering operations. In McDonnell, J. R., Reynolds, R. G., and Fogel, D. B., editors, Evolutionary Programming IV Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 695–717, MIT Press, Cambridge, Massachusetts.
29. Koza, J. R. and Andre, D. (1995). Evolution of both the architecture and the sequence of work-performing steps of a computer program using genetic programming with architecture-altering operations. In Siegel, E. V. and Koza, J. R., editors, Working Notes for the AAAI Symposium on Genetic Programming, pages 50–60, AAAI press, Menlo Park, California.
30. Koza, J. R. et al. (1999). Genetic Programming III. Morgan Kaufmann, San Francisco, California.
31. Langdon, W. B. (1995). Pareto, population partitioning, price and genetic programming. Research Note RN/95/29, University College London, London, UK.
32. Langdon, W. B. and Nordin, J. P. (2000). Seeding GP populations. Lecture Notes in Computer Science, 1802:304–315.
33. Leckie, C. and Zukerman, I. (1998). Inductive learning of search control rules for planning. Arti-ficial Intelligence, 1(2):63–98.
34. Louis, S. J. and Zhang, Y. (1999). A sequential similarity metric for case injected genetic algorithms applied to TSPs. In Banzhaf, W. et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 377–384, Morgan Kaufmann, San Francisco, California.
35. McDermott, D. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109:1–361.
36. Minton, S. and Zweben, M. (1993). Learning, planning and scheduling: An overview. In Minton, S., editor, Machine Learning Methods for Planning, chapter 8. Morgan Kaufmann, San Francisco, California.
37. Montana, D. J. (1995). Strongly typed genetic programming. Evolutionary Computation, 3(2):199– 230.
38. Muslea, I. (1997). SINERGY: A linear planner based on genetic programming. In Steel, S., editor, Recent Advances in AI Planning. Fourth European Conference on Planning, number 1348 in Lecture Notes in Artificial Intelligence, pages 312–324, Springer-Verlag, Berlin, Germany.
39. O’Reilly, U.-M. and Oppacher, F. (1994). Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. Technical Report 94-04-021, Santa Fe Institute, Santa Fe, New Mexico.
40. O’Reilly, U.-M. and Oppacher, F. (1995). Hybridized crossover-based search techniques for program discovery. Technical Report 95-02-007, Santa Fe Institute, Santa Fe, New Mexico.
41. O’Reilly, U.-M. and Oppacher, F. (1996). A comparative analysis of GP. In Angeline, P. J. and Kinnear, K. E., editors, Advances in Genetic Programming 2, chapter 2, pages 23–44. MIT Press, Cambridge, Massachusetts.
42. Penberthy, J. S. and Weld, D. S. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Nebel, B., Rich, C., and Swartout, W., editor, Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pages 103–114, Morgan Kaufmann, San Francisco, California.
43. Pérez, M. A. and Carbonell, J. G. (1994). Control knowledge to improve plan quality. In Hammond, K. J., editor, Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pages 323–328, AAAI Press, Menlo Park, California.
44. Quinlan, R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California.
45. Slaney, J. and Thiebaux, S. (2001). Blocks world revisited. Artificial Intelligence, 125:119–153.
46. Spector, L. (1994). Genetic programming and AI planning systems. In Proceedings of Twelfth National Conference on Artificial Intelligence, pages 1329–1334, MIT Press, Cambridge, Massachusetts.
47. Veloso, M. (1994). Planning and Learning by Analogical Reasoning. Springer Verlag, Berlin, Germany.
48. Veloso, M. M. and Carbonell, J. G. (1993). Derivational analogy in PRODIGY: Automating case acquisition, storage, and utilization. Machine Learning, 10(3):249–278.
49. Veloso, M. et al. (1995). Integrating planning and learning: The PRODIGY architecture. Journal of Experimental and Theoretical AI, 7:81–120.
50. Westerberg, C. H. and Levine, J. (2000). Genplan: Combining genetic programming and planning. In Proceedings of Nineteenth Workshop of the UK Planning and Scheduling Special Interest Group, pages 270–281.
51. Whigham, P. A. (1996). Search bias, language bias, and genetic programming. In Koza, J. R. et al., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 230–237, MIT Press, Cambridge, Massachusetts.
52. Wong, M. L. and Leung, K. S. (1995). Combining genetic programming and inductive logic programming using logic grammars. In 1995 IEEE Conference on Evolutionary Computation, volume 2, pages 733–736, IEEE Press, Piscataway, New Jersey.
53. Wong, M. L. and Leung, K. S. (1997). Evolutionary program induction directed by logic grammars. Evolutionary Computation, 5(2):143–180.