A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints

Abstrakt

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

Klíčová slova

• SAT-Based
• Cooperative
• Path-FInding