Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning

Abstrakt

A problem of cooperative path-planning is addressed from the perspective of propositional satisfiability in this paper. Two new encodings of the problem as SAT are proposed and evalu-ated.

Klíčová slova

• Cooperative
• Path-Finding
• SAT
• Encoding