Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving

Abstrakt

A novel approach to cooperative path-planning is presented. A SAT solver is used not to solve the whole instance but for optimizing the makespan of a sub-optimal solution.

Klíčová slova

• Cooperative
• Path-Planning