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. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Baioletti, M., Milani, A., Poggioni, V., & Rossi, F. (2009). An ACO approach to planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5482 LNCS, pp. 73–84). https://doi.org/10.1007/978-3-642-01009-5_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
