The following pages link to Pavel Surynek (Q613780):
Displaying 11 items.
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals (Q1690343) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- On the Complexity of Optimal Parallel Cooperative Path-Finding (Q2805441) (← links)
- (Q3112595) (← links)
- (Q3455636) (← links)
- SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS (Q3462275) (← links)
- Solving Multi-agent Path Finding on Strongly Biconnected Digraphs (Q4580265) (← links)
- Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (Q5076310) (← links)
