Optimal Planning with ACO

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. We propose several approaches 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.

• Type: Conference
• Year: 2009
• Where: AIIA
• Authors: Marco Baioletti, Alfredo Milani, Valentina Poggioni, Fabio Rossi
• Keywords: AIIA 2009, Ant Colony Optimization, Hard Computational Problem, Optimal Planning