SYNERGY: A Linear Planner Based on Genetic Programming
| dc.creator | Muslea, Ion | |
| dc.date | 1998-10-16 | |
| dc.date.accessioned | 2026-07-07T03:23:45Z | |
| dc.date.available | 2026-07-07T03:23:45Z | |
| dc.description | In this paper we describe SYNERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world it is planning for, SYNERGY uses artificial selection, recombination and fitness measure to generate linear plans that solve conjunctive goals. We ran SYNERGY on several domains (e.g., the briefcase problem and a few variants of the robot navigation problem), and the experimental results show that our planner is capable of handling problem instances that are one to two orders of magnitude larger than the ones solved by UCPOP. In order to facilitate the search reduction and to enhance the expressive power of SYNERGY, we also propose two major extensions to our planning system: a formalism for using hierarchical planning operators, and a framework for planning in dynamic environments. | |
| dc.description | 13 pages, European Conference on Planning 1997 | |
| dc.identifier | https://arxiv.org/abs/cs/9810016 | |
| dc.identifier | http://arxiv.org/abs/cs/9810016 | |
| dc.identifier | "Recent Advances in AI Planning" (Sam Steel & Rachid Alami eds.), p. 312-325, Springer 1997 (LNAI 1348) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33063 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.8 | |
| dc.title | SYNERGY: A Linear Planner Based on Genetic Programming | |
| dc.type | text |