4 results on '"Pavel Surynek"'
Search Results
2. Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories.
3. Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract).
4. Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.