On Propositional Encodings of Cooperative Path-finding

Abstrakt

The approach to solving cooperative-path finding (CPF) as propositional satisfiability (SAT) is revisited in this paper. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested.

Klíčová slova

• Cooperative
• Path-Finding
• SAT