The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Pavel Surynek" ( http://dblp.L3S.de/Authors/Pavel_Surynek )

  Author page on DBLP  Author page in RDF  Community of Pavel Surynek in ASPL-2

Publication years (Num. hits)
2004-2010 (16) 2011-2013 (16) 2014-2016 (18) 2017-2018 (21) 2019 (12)
Publication types (Num. hits)
article(21) inproceedings(61) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(11) SOCS(11) ICTAI(8) FLAIRS Conference(5) AAAI(3) ICAART (2)(3) IJCAI(3) KEOD(3) AAMAS(2) CP(2) ECAI(2) Fundam. Inform.(2) ICMLC(2) International Journal on Artif...(2) PRICAI(2) SARA(2) More (+10 of total 36)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 4 keywords

Results
Found 84 publication records. Showing 83 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pavel Surynek, T. K. Satish Kumar, Sven Koenig Multi-Agent Path Finding with Capacity Constraints. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Surynek Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT). Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Surynek On the Tour Towards DPLL(MAPF) and Beyond. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Vojtech Cahlík, Pavel Surynek On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. Search on Bibsonomy IJCCI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma 0001, T. K. Satish Kumar, Sven Koenig Multi-Agent Path Finding for Large Agents. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. Search on Bibsonomy ICAART (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Róbert Selvek, Pavel Surynek Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. Search on Bibsonomy KEOD The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, William Yeoh 0001 (eds.) Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019 Search on Bibsonomy SOCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Surynek Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. Search on Bibsonomy SOCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Surynek Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). Search on Bibsonomy SOCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma 0001, T. K. Satish Kumar, Sven Koenig Multi-Agent Path Finding for Large Agents. Search on Bibsonomy SOCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Surynek Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adi Botea, Davide Bonusi, Pavel Surynek Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Pavel Surynek Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Pavel Surynek A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. Search on Bibsonomy ICAART (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. Search on Bibsonomy ICTAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. Search on Bibsonomy SOCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Adi Botea, Davide Bonusi, Pavel Surynek Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. Search on Bibsonomy FLAIRS Conference The full citation details ... 2018 DBLP  BibTeX  RDF
1Pavel Surynek, Petr Michalík The joint movement of pebbles in solving the ( N2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding. Search on Bibsonomy Autonomous Agents and Multi-Agent Systems The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Marika Ivanová, Pavel Surynek Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jiri Svancara, Pavel Surynek New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. Search on Bibsonomy ICAART (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. Search on Bibsonomy ICAART (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. Search on Bibsonomy ICAART (Revised Selected Papers) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek Modeling and Solving the Multi-agent Pathfinding Problem in Picat. Search on Bibsonomy ICTAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. Search on Bibsonomy SOCS The full citation details ... 2017 DBLP  BibTeX  RDF
1Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. Search on Bibsonomy SOCS The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Surynek, Petr Michalík Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS). Search on Bibsonomy AAMAS The full citation details ... 2017 DBLP  BibTeX  RDF
1Pavel Surynek, Petr Michalík Improvements in Sub-optimal Solving of the (N2-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Pavel Surynek Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Petra Surynková, Pavel Surynek Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals. Search on Bibsonomy MMCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. Search on Bibsonomy SOCS The full citation details ... 2016 DBLP  BibTeX  RDF
1Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). Search on Bibsonomy AAMAS The full citation details ... 2016 DBLP  BibTeX  RDF
1Pavel Surynek On the Complexity of Optimal Parallel Cooperative Path-Finding. Search on Bibsonomy Fundam. Inform. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Adi Botea, Pavel Surynek Multi-Agent Path Finding on Strongly Biconnected Digraphs. Search on Bibsonomy AAAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Pavel Surynek UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. Search on Bibsonomy SOCS The full citation details ... 2015 DBLP  BibTeX  RDF
1Pavel Surynek Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Pavel Surynek, Petra Surynková, Milos Chromý The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems. Search on Bibsonomy Fundam. Inform. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Preprocessing in Propositional Satisfiability Using Bounded (2, k)-Consistency on Regions with a Locally Difficult Constraint Setup. Search on Bibsonomy International Journal on Artificial Intelligence Tools The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Solving Abstract Cooperative Path-Finding in Densely Populated Environments. Search on Bibsonomy Computational Intelligence The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More. Search on Bibsonomy MICAI (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. Search on Bibsonomy PRICAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. Search on Bibsonomy ICTAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marika Ivanová, Pavel Surynek Adversarial Cooperative Path-Finding: Complexity and Algorithms. Search on Bibsonomy ICTAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Petra Surynková Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View. Search on Bibsonomy KEOD The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Redundancy Elimination in Highly Parallel solutions of Motion Coordination Problems. Search on Bibsonomy International Journal on Artificial Intelligence Tools The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Mutex reasoning in cooperative path finding modeled as propositional satisfiability. Search on Bibsonomy IROS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Marika Ivanová, Pavel Surynek Adversarial Cooperative Path-Finding: A First View. Search on Bibsonomy AAAI (Late-Breaking Developments) The full citation details ... 2013 DBLP  BibTeX  RDF
1Pavel Surynek A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results. Search on Bibsonomy KEOD The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. Search on Bibsonomy SARA The full citation details ... 2013 DBLP  BibTeX  RDF
1Pavel Surynek Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. Search on Bibsonomy PRICAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Surynek An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors. Search on Bibsonomy ECAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tomás Balyo, Roman Barták, Pavel Surynek Shortening Plans by Local Re-planning. Search on Bibsonomy ICTAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Surynek On Propositional Encodings of Cooperative Path-Finding. Search on Bibsonomy ICTAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tomás Balyo, Roman Barták, Pavel Surynek On Improving Plan Quality via Local Enhancements. Search on Bibsonomy SOCS The full citation details ... 2012 DBLP  BibTeX  RDF
1Pavel Surynek A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. Search on Bibsonomy SOCS The full citation details ... 2012 DBLP  BibTeX  RDF
1Pavel Surynek Relocation tasks and a hierarchical subclass. Search on Bibsonomy ICMLC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Application of propositional satisfiability to special cases of cooperative path-planning. Search on Bibsonomy ICMLC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Surynek, Ivana Luksová Automated Classification of Bitmap Images using Decision Trees. Search on Bibsonomy Polibits The full citation details ... 2011 DBLP  BibTeX  RDF
1Pavel Surynek Exploiting Global Properties in Path-Consistency Applied on SAT. Search on Bibsonomy SCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. Search on Bibsonomy ICTAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Roman Barták, Ondrej Cepek, Pavel Surynek Discovering implied constraints in precedence graphs with alternatives. Search on Bibsonomy Annals OR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pavel Surynek An Optimization Variant of Multi-Robot Path Planning Is Intractable. Search on Bibsonomy AAAI The full citation details ... 2010 DBLP  BibTeX  RDF
1Pavel Surynek A novel approach to path planning for multiple robots in bi-connected graphs. Search on Bibsonomy ICRA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pavel Surynek An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning. Search on Bibsonomy ICTAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments. Search on Bibsonomy FLAIRS Conference The full citation details ... 2009 DBLP  BibTeX  RDF
1Pavel Surynek Domain-Dependent View of Multiple Robots Path Planning. Search on Bibsonomy STAIRS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Pavel Surynek Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network. Search on Bibsonomy FLAIRS Conference The full citation details ... 2008 DBLP  BibTeX  RDF
1Pavel Surynek, Lukás Chrpa, Jirí Vyskocil Solving Difficult Problems by Viewing them as Structured Dense Graphs. Search on Bibsonomy IICAI The full citation details ... 2007 DBLP  BibTeX  RDF
1Lukás Chrpa, Pavel Surynek, Jirí Vyskocil Encoding of Planning Problems and Their Optimizations in Linear Logic. Search on Bibsonomy INAP/WLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Roman Barták, Ondrej Cepek, Pavel Surynek Modelling Alternatives in Temporal Networks. Search on Bibsonomy CISched The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Pavel Surynek A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. Search on Bibsonomy CSCLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF global filtration, mutual exclusion network, search
1Pavel Surynek Solving Difficult SAT Instances Using Greedy Clique Decomposition. Search on Bibsonomy SARA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF difficult instances, search, consistency, SAT, clique
1Pavel Surynek, Roman Barták Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. Search on Bibsonomy FLAIRS Conference The full citation details ... 2007 DBLP  BibTeX  RDF
1Pavel Surynek, Roman Barták Encoding HTN Planning as a Dynamic CSP. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Roman Barták, Pavel Surynek An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. Search on Bibsonomy FLAIRS Conference The full citation details ... 2005 DBLP  BibTeX  RDF
1Pavel Surynek, Roman Barták A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #83 of 83 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license