SAT-Based Cooperative Planning: A Proposal

We present a work-in-progress on distributed planning, which relies on the “planning as satisfiability” paradigm. It allows for multiagent 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.