In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with different methodologies. Approximate methods do not guarantee either optimality or completeness, but it has been proved that in many applications they are able to find very good, often optimal, solutions. Our proposal is to use an Ant Colony Optimization approach, based both on backward and forward search over the state space, using different pheromone models and heuristic functions in order to solve sequential optimization planning problems.
Optimal planning with ACO
MILANI, Alfredo;
2009-01-01
Abstract
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with different methodologies. Approximate methods do not guarantee either optimality or completeness, but it has been proved that in many applications they are able to find very good, often optimal, solutions. Our proposal is to use an Ant Colony Optimization approach, based both on backward and forward search over the state space, using different pheromone models and heuristic functions in order to solve sequential optimization planning problems.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.
