Publication at Faculty of Mathematics and Physics |
2012
Abstract
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.