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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baioletti, M., Milani, A., Poggioni, V., Rossi, F.: An ACO approach to planning. In: Proc of the 9th European Conference on Evolutionary Computation in Combinatorial Optimisation, EVOCOP 2009 (2009)
Baioletti, M., Milani, A., Poggioni, V., Rossi, F.: Ant search strategies for planning optimization. Accepted to International Conference on Planning and Scheduling, ICAPS 2009 (2009)
Baioletti, M., Milani, A., Poggioni, V., Rossi, F.: PlACO: Planning with Ants. In: Proc of The 22nd International FLAIRS Conference. AAAI Press, Menlo Park (2009)
Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank Based Version of the Ant System - A Computational Study. Central European Journal for Operations Research and Economics 7, 25–38 (1999)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Gerevini, A., Serina, I.: LPG: a Planner based on Local Search for Planning Graphs. In: Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002). AAAI Press, Toulouse (2002)
Haslum, P., Bonet, B., Geffner, H.: New Admissible Heuristics for Domain-Independent Planning. In: Proc. of AAAI 2005, pp. 1163–1168 (2005)
Helmert, M., Do, M., Refanidis, I.: International Planning Competition IPC-2008, The Deterministic Part (2008), http://ipc.icaps-conference.org/
Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann, San Francisco (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baioletti, M., Milani, A., Poggioni, V., Rossi, F. (2009). Optimal Planning with ACO. In: Serra, R., Cucchiara, R. (eds) AI*IA 2009: Emergent Perspectives in Artificial Intelligence. AI*IA 2009. Lecture Notes in Computer Science(), vol 5883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10291-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-10291-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10290-5
Online ISBN: 978-3-642-10291-2
eBook Packages: Computer ScienceComputer Science (R0)