In this paper we describe a first attempt to solve planning problems through an Ant Colony Optimization approach. We have implemented an ACO algorithm, called ACOPlan, which is able to optimize the solutions of propositional planning problems, with respect to the plans length. Since planning is a hard computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encouraging, because ACOPlan sometimes finds better solutions than state of art planning systems. Moreover, this algorithm seems to be easily extensible to other planning models.
An ACO approach to planning
MILANI, Alfredo;
2009-01-01
Abstract
In this paper we describe a first attempt to solve planning problems through an Ant Colony Optimization approach. We have implemented an ACO algorithm, called ACOPlan, which is able to optimize the solutions of propositional planning problems, with respect to the plans length. Since planning is a hard computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encouraging, because ACOPlan sometimes finds better solutions than state of art planning systems. Moreover, this algorithm seems to be easily extensible to other planning models.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
