Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving

Abstrakt

A new approach to cooperative path-planning is presented. The makespan of a solution to a path-planning instance is op-timized by a SAT solver.

Klíčová slova

• Cooperative
• Path-FInding
• SAT