Abstract
We present a work-in-progress on distributed planning, which relies on the “planning as satisfiability” paradigm. It allows for multi-agent cooperative planning by joining SAT-based planning and a particular approach to distributed propositional satisfiability. Each agent is thus enabled to plan on its own and communicate with other agents during the planning process, in such a way that synchronized and possibly cooperative plans come out as a result. We discuss in some details both piers of our construction: SAT-based planning techniques and distributed approaches to satisfiability. Then, we propose how to join them by presenting a working example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benedetti, M.: A New Way of Distributing Satisfiability. In: Arabnia, H.R. (ed.) Proceedings of the International Conference on Artificial Intelligence (IC-AI 2001), vol. 1, pp. 295–300. CSREA (2001)
Benedetti, M.: Bridging Refutation and Search in Propositional Satisfiability. PhD Thesis, Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma “La Sapienza” (2001)
Berre, D.L.: Sat live! page: a dynamic collection of links on sat-related research (2000), http://www.satlive.org
Bohm, M., Speckenmeyer, E.: A fast parallel SAT-solver – efficient workload balancing. Technical Report 94-159, University of Cologne (1994)
Bonacina, M.P.: A taxonomy of parallel strategies fo deduction. Technical Report May 1999, Department of Computer Science, University of Iowa (1999)
Botelho, S., Alami, R.: Multi-robot Cooperative Plan Enhancement. pp. 100–110 (1999)
Carlucci Aiello, L., Nardi, D., Schaerf, M.: Reasoning about Knowledge and Ignorance. In: Proceedings of the International Conference on Fifth Generation Computer Systems 1988 (FGCS 1988), pp. 618–627. ICOT Press (1988)
Carlucci Aiello, L., Nardi, D., Schaerf, M.: Reasoning about Reasoning in a Meta-Level Architecture. International Journal of Applied Intelligence 1, 55–67 (1991)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, pp. 151–158 (1971)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5, 394–397 (1962)
des Jardins, M., Durfee, E., Ortiz, C.L.J., Wolverton, M.: A Survey of Research in Distributed. Continual Planning 20(4), 13–22 (1999)
Durfee, E.H.: Planning in Distributed Artificial Intelligence. In: O’Hare, G., Jennings, N. (eds.) Foundations of Distributed Artificial Intelligence, pp. 231–245. Wiley & Sons, Chichester (1996)
Ernst, M., Millstein, T., Weld, D.: Automatic SAT-compilation of planning problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1169–1177 (1997)
Hoos, H., Stützle, T.: Satlib – the satisfiability library (1998), http://www.informatik.tu-darmstadt.de/AI/SATLIB
Jurkowiak, B., Li, C.M., Utard, G.: Parallelizing Satz Using Dynamic Workload Balancing. In: Proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT 2001). Electronic Notes in Discrete Mathematics, vol. 9, pp. 205–211. Elsevier Science, Amsterdam (2001)
Kautz, H., Selman, B.: Planning as Satisfiability, pp. 359–363 (1992)
Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359–363 (1992)
Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stichastic search. In: Proceedings of the 12th European Conference on Artificial Intelligence, pp. 1194–1201 (1996)
Kautz, H., Selman, B.: Blackbox: A new approach to the application of theorem proving to problem solving. In: AIPS 1998 Workshop on Planning and Combinatorial Search, pp. 58–60 (1998)
Levin, L.: Universal Sequential Search Problems. Problems of Information Trasmission 9, 265–266 (1973)
Garey, D.J.M.R.: Computers and Intractability: A Guide to the Theory of NPcompleteness. W. H. Freeman and Company, New York (1979)
Okushi, F.: Parallel cooperative propositional theorem proving. Artificial Intelligence 26, 59–85 (1999)
Weld, D.S.: Recent Advances in AI Planning. 20, 93–123 (Summer 1999)
Zhang, H., Bonacina, M.P., Hsiang, J.: Psato: a distributed propositional prover and its application to quasigroup. Journal of Symbolic Computation 21, 543–560 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Benedetti, M., Aiello, L.C. (2005). SAT-Based Cooperative Planning: A Proposal. In: Hutter, D., Stephan, W. (eds) Mechanizing Mathematical Reasoning. Lecture Notes in Computer Science(), vol 2605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32254-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-32254-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25051-7
Online ISBN: 978-3-540-32254-2
eBook Packages: Computer ScienceComputer Science (R0)