225 results on '"Pavel Surynek"'
Search Results
2. Action Duration Generalization for Exact Multi-Agent Collective Construction.
3. Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract).
4. Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract).
5. Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning.
6. Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding.
7. Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method.
8. Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop.
9. Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding.
10. Multi-agent Path Finding for Indoor Quadcopters.
11. Problem Compilation for Multi-Agent Path Finding: a Survey.
12. Highways in Warehouse Multi-Agent Path Finding: A Case Study.
13. Parameter Setting in SAT Solver using Machine Learning Techniques.
14. Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques.
15. Action Duration Generalization for Exact Multi-Agent Collective Construction.
16. Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic.
17. Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding.
18. Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract).
19. Lazy Compilation in Classical Planning (Extended Abstract).
20. Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract).
21. Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach.
22. Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes.
23. Adversarial Multi-Agent Path Finding is Intractable.
24. Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning.
25. Hierarchical Control of Swarms during Evacuation.
26. Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering.
27. Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach.
28. Mutex Propagation for SAT-based Multi-agent Path Finding.
29. Bounded Suboptimal Token Swapping.
30. At-Most-One Constraints in Efficient Representations of Mutex Networks.
31. Multi-Agent Path Finding with Mutex Propagation.
32. Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective.
33. Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective.
34. Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots.
35. Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding.
36. Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT).
37. On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared.
38. Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior.
39. DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies.
40. Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories.
41. Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT.
42. ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding.
43. Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation.
44. Heuristically Guided Compilation for Multi-Agent Path Finding.
45. Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters.
46. Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach.
47. Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding.
48. Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations.
49. Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories.
50. On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.