Publications



Bibliography Links


DBLP Semantic Scholar Google Scholar Research Gate ACM Profile


Color Legend

  LNCS/LNAI      AAAI       IEEE       IOS      Thesis     Tech. report     Chapter     Impact     Journal  


2018

102.
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs
Adi Botea, Davide Bonusi, Pavel Surynek. Journal of Artificial Intelligence Research (JAIR), AAAI Press, 2018, in press, [Accepted 2018].
[ ]
101.
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents
Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen. Proceedings of the 31st International Florida Artificial Intelligence Research Society Conference (FLAIRS 2018), Melbourne, FL, USA, AAAI Press, 2018, in press.
full text pdf ]
100.
Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination
Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama. Proceedings of the 10th International Conference on Agents and Artificial Intelligence (ICAART 2018), pp. 184-191, Funchal, Madeira, Portugal, SciTe Press, 2018, ISBN 978-989-758-275-2.
full text pdf ]


2017

99.
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
Pavel Surynek. Annals of Mathematics and Artificial Intelligence (AMAI), Volume 81, Issue 3-4, pp. 329-375, Springer, 2017, ISSN: 1012-24432.
preprint pdf ]
98.
Independence Detection in SAT-based Multi-Agent Path Finding
Pavel Surynek, Jiří Švancara, Ariel Felner, Eli Boyarski. Proceedings of the 31st Annual Conference of The Japanese Society for Artificial Intelligence (JSAI 2017), Nagoya, Japan, The Japanese Society for Artificial Intelligence, 2017.
full text pdf ]
97.
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), pp. 169-170, Pittsburgh, PA, USA, AAAI Press, 2017.
full text pdf | extended abstract pdf | annex pdf ]
96.
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek. Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), pp. 29-37, Pittsburgh, PA, USA, AAAI Press, 2017.
full text pdf ]
95.
Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding
Pavel Surynek, Petr Michalík. Proceedings of the 16th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017), pp. 856-857, Sao Paulo, Brazil, IFAAMAS/ACM, 2017.
full text (extended version) pdf | extended abstract pdf | annex pdf ]
94.
New Flow-based Heuristic for Search Algorithms Solving Multi-Agent Path Finding
Jiří Švancara, Pavel Surynek. Proceedings of the 9th International Conference on Agents and Artificial Intelligence (ICAART 2017), pp. 451-458, Proto, Portugal, SciTe Press, 2017, ISBN 978-989-758-219-6.
full text pdf ]
93.
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding: A Novel SAT-Based Optimal MAPF Solver
Pavel Surynek, Jiří Švancara, Ariel Felner, Eli Boyarski. Proceedings of the 9th International Conference on Agents and Artificial Intelligence (ICAART 2017), pp. 85-95, Porto, Portugal, SciTe Press, 2017, ISBN 978-989-758-219-6.
full text pdf | annex pdf ]


2016

92.
The Joint Movement of Pebbles in Solving the (N2-1)-Puzzle Suboptimally and its Applications in Rule-Based Cooperative Path-Finding
Pavel Surynek, Petr Michalík. Autonomous Agents and Multi-Agent Systems (JAAMAS), Volume 31, Issue 3, pp. 715-763, IFAAMAS/Springer, 2017, ISSN: 1387-2532, [Accepted 2016].
full text pdf | annex pdf ]
91.
Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), pp. 810-818, Hague, Netherlands, IOS Press, 2016.
full text pdf | annex pdf ]
90.
Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 4th ICAPS Workshop on Distributed and Multi-Agent Planning (DMAP 2016), pp. 66-72, London, United Kingdom, ČVUT/BGU, 2016.
full text pdf ]
89.
Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 2nd IJCAI Workshop on Multi-Agent Path Finding (WOMPF 2016), 9 pages, New York, USA, CMU/USC, 2016.
full text pdf ]
88.
An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 9th Annual Symposium on Combinatorial Search (SoCS 2016), pp. 145-147, Tarrytown, NY, USA, AAAI Press, 2016.
full text pdf | annex pdf ]
87.
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. Proceedings of the 15th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), pp. 1435-1436, Singapore, IFAAMAS/ACM, 2016.
full text pdf | annex pdf ]
86.
Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals
Petra Surynková, Pavel Surynek. Mathematical Methods for Curves and Surfaces - 9th International Conference (MMCS 2016), Revised Selected Papers, pp. 296-311, Tonsberg, Norway, Lecture Notes in Computer Science, Volume 10521, Springer, 2016, ISBN 978-3-319-67884-9.
preprint pdf ]


2015

85.
Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally
Pavel Surynek. Proceedings of the 24rd International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 1916-1922, Buenos Aires, Argentina, IJCAI/AAAI Press, 2015. {acceptance rate = 28.8%}
full text pdf | full text ps | presentation pdf | poster pdf ]
84.
UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding
Pavel Surynek. Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015), pp. 236-237, Ein Gedi, the Dead Sea, Israel, AAAI Press, 2015.
full text pdf | full text ps | presentation pdf | poster pdf ]
83.
Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors
Pavel Surynek. Association for Logic Programming (ALP) Newsletter, Issue March/April 2015, Association for Logic Programming, 2015.
full text pdf | full text ps | web link ]
82.
Multi-Agent Path Finding on Biconnected Directed Graphs
Adi Botea, Pavel Surynek. Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 2024-2030, Austin, TX, USA, AAAI Press, 2015. {acceptance rate = 26.67%}
full text pdf | full text ps | presentation pdf | poster pdf ]


2014

81.
Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More
Pavel Surynek. Proceedings of the 13th Mexican International Conference on Artificial Intelligence (MICAI 2014), Part II, pp. 410-425, Tuxtla Gutiérrez, Mexico, Lecture Notes in Computer Science, Volume 8857, Springer, 2014, ISBN 978-3-319-13649-3.
full text pdf | full text ps | presentation pdf ]
80.
A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well
Pavel Surynek. Proceedings of the 13th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2014), pp. 827-833, Gold Coast, Australia, Lecture Notes in Computer Science, Volume 8862, Springer, 2014, ISBN 978-3-319-13559-5.
full text pdf | full text ps ]
79.
Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability
Pavel Surynek. Proceedings of the 17th Czech-Japan Seminar on Data Analysis and Decision Making (CJS 2014), 18 pages, Kitakyushu, Japan, Waseda University, 2014.
full text pdf | full text ps | presentation pdf ]
78.
Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs
Pavel Surynek. Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI 2014), pp. 875-882, Limassol, Cyprus, IEEE Press, 2014, ISBN 978-1-4799-6572-4. {acceptance rate = 32.83%}
full text pdf | full text ps | presentation pdf ]
77.
Adversarial Cooperative Path-finding: Complexity and Algorithms
Marika Ivanová, Pavel Surynek. Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI 2014), pp. 75-82, Limassol, Cyprus, IEEE Press, 2014, ISBN 978-1-4799-6572-4. {acceptance rate = 32.83%}
full text pdf | full text ps | presentation pdf ]
76.
On the Complexity of Optimal Parallel Cooperative Path-Finding
Pavel Surynek. Fundamenta Informaticae, Volume 137, Number 4, pp. 517-548, IOS Press, 2015, ISSN 0169-2968, [Accepted 2014].
full text pdf | full text ps ]
75.
Theoretical Challenges in Knowledge Discovery in Big Data: a logic reasoning and a graph theoretical point of view
Pavel Surynek, Petra Surynková. Proceedings of the 6th International Conference on Knowledge Engineering and Ontology Development (KEOD 2014), Rome, Italy, SCITEPRESS, 2014.
full text pdf | full text ps ]
74.
The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems
Pavel Surynek, Petra Surynková, Miloš Chromý. Fundamenta Informaticae, Volume 135, Number 3, pp. 295-308, IOS Press, 2014, ISSN: 0169-2968 [Accepted, 2014].
full text pdf | full text ps ]


2013

73.
Mutex Reasoning in Cooperative Path Finding Modeled as Propositional Satisfiability
Pavel Surynek. Proceedings of the 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), pp. 4326-4331, Tokyo, Japan, IEEE Press, 2013.
full text pdf | full text ps | presentation pdf ]
72.
Optimální kooperativní hledání cest řešené pomocí výrokové splnitelnosti
(Optimal Cooperative Path Planning through Propositional Satisfiability Solving)
Pavel Surynek. Proceedings of the Conference Znalosti 2013, pp. 44-53, Ostrava, Czech Republic, VŠB-Technical University Ostrava, 2013, ISBN 978-80-248-3189-3.
full text pdf | full text ps | presentation pdf ]
71.
A Survey of Collaborative Web Search: Through Collaboration among Search Engine Users to More Relevant Results
Pavel Surynek. Proceedings of the 5th International Conference on Knowledge Engineering and Ontology Development (KEOD 2013), pp. 331-336, Vilamoura, Algarve, Portugal, SCITEPRESS, 2013, ISBN 978-989-8565-81-5. {acceptance rate = 35.0%}.
full text pdf | full text ps | presentation pdf ]
70.
Propositional Satisfiability Benchmarks Constructed from Multi-Robot Path Planning on Graphs
Pavel Surynek. Proceedings of SAT Competition 2013 : Solver and Benchmark Descriptions (SAT Competition 2013), pp. 122-123, Department of Computer Science Series of Publications B, vol. B-2013-1, University of Helsinki, Helsinki, 2013.
full text pdf | full text ps | benchmarks zip ]
69.
Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup
Pavel Surynek. International Journal on Artificial Intelligence Tools (IJAIT), Volume 23, Number 01 (29 pages), World Scientific, 2014, ISSN 0218-2130, [Accepted, 2013].
full text pdf | full text ps ]
68.
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases
Pavel Surynek. Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation (SARA 2013), Leavenworth, WA, USA, AAAI Press, 2013, ISBN 978-1-57735-630-1.
full text pdf | full text ps | presentation pdf ]
67.
Adversarial Cooperative Path-Finding: A First View
Marika Ivanová, Pavel Surynek. The 27th AAAI Conference on Artificial Intelligence (AAAI 2013), Bellevue, WA, USA, late breaking track, technical report, AAAI Press, 2013. {acceptance rate = 46.0%}
full text pdf | full text ps | presentation pdf | poster pdf ]
66.
Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems
Pavel Surynek. International Journal on Artificial Intelligence Tools (IJAIT), Volume 22, Number 05 (19 pages), World Scientific, 2013, ISSN 0218-2130, [Accepted, 2013].
full text pdf | full text ps ]


2012

65.
Solving Abstract Cooperative Path-Finding in Densely Populated Environments
Pavel Surynek. Computational Intelligence (COIN), Volume 30, Issue 2, pp. 402-450, 2014, Wiley, ISSN 1467-8640, [Accepted, 2012].
full text pdf | full text ps ]
64.
On Propositional Encodings of Cooperative Path-finding
Pavel Surynek. Proceedings of the 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 524-531, Athens, Greece, IEEE Press, 2012, ISBN 978-0-7695-4915-6.
full text pdf | full text ps | presentation pdf ]
63.
Shortening Plans by Local Re-Planning
Tomáš Balyo, Roman Barták, Pavel Surynek. Proceedings of the 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 1022-1028, Athens, Greece, IEEE Press, 2012, ISBN 978-0-7695-4915-6.
co-author's web (Tomáš Balyo) | co-author's web (Roman Barták) ]
62.
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints
Pavel Surynek. Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), Niagara Falls, Ontario, Canada, AAAI Press, 2012.
full text pdf | full text ps | poster pdf ]
61.
On Improving Plan Quality via Local Enhancements
Tomáš Balyo, Roman Barták, Pavel Surynek. Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), Niagara Falls, Ontario, Canada, AAAI Press, 2012.
co-author's web (Tomáš Balyo) | co-author's web (Roman Barták) ]
60.
An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors
Pavel Surynek. Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 927-928, Montpellier, France, IOS Press, 2012, ISBN 978-1-61499-097-0. {acceptance rate = 32.30%}
full text pdf | full text ps | poster pdf ]
59.
Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning
Pavel Surynek. Proceedings of the International Conference on Machine Learning and Cybernetics (ICMLC 2012), pp. 507-512, Xian, China, IEEE Association, 2012, ISBN 978-1-4673-1486-2.
full text pdf | full text ps | presentation pdf ]
58.
Relocation Tasks and a Hierarchical Subclass
Pavel Surynek. Proceedings of the International Conference on Machine Learning and Cybernetics (ICMLC 2012), pp. 666-669, Xian, China, IEEE Association, 2012, ISBN 978-1-4673-1486-2.
full text pdf | full text ps | presentation pdf ]
57.
Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving
Pavel Surynek. Proceedings of the 26th Annual Conference of The Japanese Society for Artificial Intelligence (JSAI 2012), Yamaguchi, Japan, The Japanese Society for Artificial Intelligence, 2012.
full text pdf | full text ps | presentation pdf ]
56.
Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving
Pavel Surynek. Proceedings of the 12th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2012), Kuching, Malaysia, pp. 564-576, Lecture Notes in Computer Science 7458, Springer, 2012, ISBN 978-3-642-32694-3. {acceptance rate = 25.00%}
full text pdf | full text ps | presentation pdf ]


2011

55.
An Improved Sub-optimal Algorithm for Solving (N2-1)-Puzzle
Pavel Surynek. Technical Report, ITI Series, 2011-543 (19 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2011.
full text pdf | full text ps ]
54.
Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup
Pavel Surynek. Technical Report, ITI Series, 2011-537 (40 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2011.
full text pdf | full text ps ]
53.
Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems
Pavel Surynek. Proceedings of the 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2011), Boca Raton, FL, USA, pp. 701-708, IEEE Press, 2011, ISBN 978-0-7695-4596-7, ISSN 1082-3409. {acceptance rate = 27.91%}
full text pdf | full text ps | presentation pdf ]
52.
Automated Classification of Bitmap Images Using Decision Trees
Pavel Surynek, Ivana Lukšová. Proceedings of the 10th Mexican International Conference on Artificial Intelligence (MICAI 2011) / Polibits Journal - Issue 44, Puebla, Mexico, pp. 11-18, Centro de Innovación y Desarrollo Tecnológico en Cómputo, 2011, ISSN 1870-9044. (Best Poster Award)
full text pdf | full text ps | presentation pdf | poster pdf ]
51.
Between Path-Consistency and Higher Order Consistencies in Boolean Satisfiability
Pavel Surynek. Proceedings of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, 2011 (CSCLP 2011), York, United Kingdom, pp. 120-134, University of York, 2011.
full text pdf | full text ps | presentation pdf ]
50.
Exploiting Global Properties in Path-Consistency Applied on SAT
Pavel Surynek. Proceedings of the 11th Scandinavian Conference on Artificial Intelligence (SCAI 2011), Trondheim, Norway, pp. 90-99, IOS Press, 2011, ISBN 978-1-60750-753-6, ISSN 0922-6389.
full text pdf | full text ps | presentation pdf ]
49.
Extrakce a zpracování příznaků pro automatickou klasifikaci bitmapových obrázků
(Attribute Extraction and Processing for Automated Classification of Bitmap Images)
Pavel Surynek, Ivana Lukšová. Proceedings of the Conference Znalosti 2011, Stará Lesná, Slovakia, pp. 170-181, VŠB - Technical University of Ostrava, Czech Republic, 2011, in Czech, ISBN 978-80-248-2369-0.
full text pdf | full text ps | presentation pdf ]


2010

48.
An Adaptation of Path Consistency for Boolean Satisfiability: a Theoretical View of the Concept
Pavel Surynek. Proceedings of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, 2010 (CSCLP 2010), Berlin, Germany, pp. 16-30, Fraunhofer FIRST, 2010.
full text pdf | full text ps | presentation pdf ]
47.
An Adaptation of Path Consistency for Boolean Satisfiability
Pavel Surynek. Proceedings of the 13th Czech-Japan Seminar on Data Analysis and Decision Making in Service Science (CJS 2010), Otaru, Japan, pp. 79-84, Otaru University of Commerce, 2010.
full text pdf | full text ps | presentation pdf ]
46.
Multi-robot Path Planning
Pavel Surynek. Chapter in the Book "Multi-Robot Systems, Trends and Development", Editor: Toshiyuki Yasuda, pp. 267-290 (24 pages / 586 pages), InTech - Open Access Publisher, Vienna, Austria, 2011, ISBN 978-953-307-425-2, [Accepted 2010].
[open access | full text pdf | full text ps ]
45.
Abstract Path Planning for Multiple Robots: An Empirical Study
Pavel Surynek. Technical Report, ITI Series, 2010-504 (75 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2010.
full text pdf | full text ps ]
44.
Abstract Path Planning for Multiple Robots: A Theoretical Study
Pavel Surynek. Technical Report, ITI Series, 2010-503 (34 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2010.
full text pdf | full text ps ]
43.
Improving Solutions of Problems of Motion on Graphs by Redundancy Elimination
Pavel Surynek, Petr Koupý. Proceedings of the ECAI 2010 Workshop on Spatio-Temporal Dynamics (ECAI STeDy 2010), Lisbon, Portugal, pp. 37-42, SFB/TR 8 Reports, Universität Bremen, Germany, 2010.
full text pdf | full text ps | presentation pdf ]
42.
An Optimization Variant of Multi-Robot Path Planning is Intractable
Pavel Surynek. Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, GA, USA, pp. 1261-1263, AAAI Press, 2010, ISBN 978-1-57735-463-5. {acceptance rate = 26.59%}
full text pdf | full text ps | poster pdf ]
41.
Vizualizace jako prostředek k získání znalostí o kvalitě řešení problémů pohybu po grafu
(Visualization as a tool for acquiring knowledge about the quality of solutions of problems of motion on graphs)
Pavel Surynek, Petr Koupý. Proceedings of the Conference Znalosti 2010, Faculty of Management, VŠE Prague, Jindřichův Hradec, Czech Republic, pp. 129-141, Nakladatelství Oeconomica Jindřichův Hradec, 2010, in Czech, ISBN 978-80-245-1636-3.
full text pdf | full text ps | presentation pdf | project web ]


2009

40.
An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning
Pavel Surynek. Proceedings of the 21st International Conference on Tools with Artificial Intelligence (ICTAI 2009), Newark, NJ, USA, pp. 151-158, IEEE Press, 2009, ISBN 978-0-7695-3920-1, ISSN 1082-3409. {acceptance rate = 26.34%}
full text pdf | full text ps | presentation pdf ]
39.
On Pebble Motion on Graphs and Abstract Multi-robot Path Planning
Pavel Surynek. Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control (ICAPS GenPlan 2009), Thessaloniki, Greece, 2009, pp. 2-9, University of Macedonia.
full text pdf | full text ps | presentation pdf ]
38.
Plánování cest pro mnoho robotů
Pavel Surynek. Sborník konference Současné trendy teoretické informatiky (STTI 2009), Praha, ITI Series, 2009-446, p. 45-45, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2009.
full text pdf | full text ps | presentation pdf ]
37.
Making Solutions of Multi-robot Path Planning Problems Shorter Using Weak Transpositions and Critical Path Parallelism
Pavel Surynek. Proceedings of the 2009 International Symposium on Combinatorial Search (SoCS 2009), Lake Arrowhead, CA, USA (6 pages), University of Southern California, 2009.
full text pdf | full text ps | poster pdf ]
36.
Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in θ-like Environments
Pavel Surynek. Proceedings of the 22nd International Florida Artificial Intelligence Research Society Conference (FLAIRS 2009), Sanibel Island, FL, USA, pp. 207-212, AAAI Press, 2009, ISBN 978-1-57735-419-2.
full text pdf | full text ps | presentation pdf ]
35.
A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs
Pavel Surynek. Proceedings of the 2009 IEEE International Conference on Robotics and Automation (ICRA 2009), Kobe, Japan, pp. 3613-3619, IEEE Press, 2009, ISBN 978-1-4244-2789-5, ISSN 1050-4729.
full text pdf | full text ps | presentation pdf | digest pdf ]
34.
Finding Sub-optimal Solutions for Problems of Path Planning for Multiple Robots in θ-like Environments
Pavel Surynek. Technical Report, ITI Series, 2007-430 (15 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2009.
full text pdf | full text ps ]
33.
Path Planning for Multiple Robots in Bi-connected Environments
Pavel Surynek. Technical Report, ITI Series, 2009-431 (17 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2009.
full text pdf | full text ps ]
32.
Efektivní heuristika pro SAT založená na znalosti komponent souvislosti grafu problému
(An Efficient Heuristic for SAT Exploiting Connected Components of the Problem)
Tomáš Balyo, Pavel Surynek. Proceedings of the Conference Znalosti 2009, Faculty of Information Technology, BUT, Brno, Czech Republic, pp. 35-46, Slovenská technická univerzita v Bratislavě, 2009, in Czech, ISBN 978-80-227-3015-0.
full text pdf | full text ps | presentation pdf ]


2008

31.
Discovering Implied Constraints in Precedence Graphs with Alternatives
Roman Barták, Ondřej Čepek, Pavel Surynek. Annals of Operations Research (ANOR 2010), Volume 180, Number 1, pp. 233-263, Springer, 2010, ISSN: 0254-5330, [Accepted 2008].
co-author's web (Roman Barták) | co-author's web (Ondřej Čepek) ]
30.
Finding Plans for Rearranging Robots in θ-like Environments
Pavel Surynek. Proceedings of the 27th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2008), Edinburgh, United Kingdom, pp. 128-129, Heriot-Watt University, 2008, ISSN 1368-5708.
full text pdf | full text ps | presentation pdf ]
29.
Constraint Programming in Planning
Pavel Surynek. Doctoral Dissertation, 136 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2008.
full text pdf | full text ps | abstract pdf | abstract ps | presentation pps | thesis web page ]
28.
Domain-Dependent View of Multiple Robots Path Planning
Pavel Surynek. Proceedings of the 4th European Starting AI Researcher Symposium (STAIRS 2008), Patras, Greece, pp. 175-186, IOS Press, 2008, ISBN 978-1-58603-893-9.
full text pdf | full text ps | presentation pps ]
27.
Making Path Consistency Stronger for SAT
Pavel Surynek. Proceedings of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2008), ISTC-CNR, Rome, Italy, 2008.
full text pdf | full text ps | presentation pps ]
26.
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
Pavel Surynek. Recent Advances in Constraints 2007 (RAC 2007), Post-proceedings of CSCLP 2007 Workshop, Lecture Notes in Artificial Intelligence 5129, pp. 142-157, Springer, 2008, ISBN 978-3-540-89811-5.
full text pdf | full text ps ]
25.
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
Pavel Surynek. Proceedings of the 21st International Florida Artificial Intelligence Research Society Conference (FLAIRS 2008), Miami, FL, USA, pp. 561-566, AAAI Press, 2008, ISBN 978-1-57735-365-2.
full text pdf | full text ps | presentation pps ]


2007

24.
Solving Difficult Problems by Viewing them as Structured Dense Graphs
Pavel Surynek, Lukáš Chrpa, Jiří Vyskočil. Proceedings of the 3rd Indian International Conference on Artificial Intelligence (IICAI 2007), Pune, India, pp. 84-103, 2007, ISBN 978-0-9727412-2-4.
co-author's web (Lukáš Chrpa) | co-author's web (Jiří Vyskočil) ]
23.
Tractable Class of a Problem of Finding Supports
Pavel Surynek, Roman Barták. Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Doctoral Programme, Providence, RI, USA, pp. 169-174, 2007.
full text pdf | full text ps | presentation pps ]
22.
Solving Difficult SAT Instances Using Greedy Clique Decomposition
Pavel Surynek. Proceedings of the 7th Symposium on Abstraction, Reformulation, and Approximation (SARA 2007), Whistler, Canada, Lecture Notes in Artificial Intelligence 4612, pp. 359-374, Springer, 2007, ISBN 978-3-540-73579-3.
full text pdf | full text ps | presentation pps ]
21.
Encoding of Planning Problems and Their Optimizations in Linear Logic.
Lukáš Chrpa, Pavel Surynek, Jiří Vyskočil. Applications of Declarative Programming and Knowledge Management, 17th International Conference and 21st Workshop on Logic Programming (INAP/WLP 2007), Würzburg, Germany, Lecture Notes in Computer Science 5437, pp. 54-68, Springer 2009, ISBN 978-3-642-00674-6.
co-author's web (Lukáš Chrpa) | co-author's web (Jiří Vyskočil) ]
20.
Projection Global Consistency: An Application in AI Planning
Pavel Surynek. Proceedings of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2007), Rocquencourt, France, pp. 61-75, INRIA, 2007.
full text pdf | full text ps | presentation pps ]
19.
Řešení obtížných případů problému splnitelnosti Booleovských formulí
Pavel Surynek. Sborník konference Současné trendy teoretické informatiky (STTI 2007), Praha, ITI Series, 2007-347, p. 36-36, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps | presentation pps ]
18.
Maintaining Arc-consistency over Mutex Relations in Planning Graphs during Search
Pavel Surynek, Roman Barták. Proceedings of the 20th International Florida Artificial Intelligence Research Society Conference (FLAIRS 2007), Key West, FL, USA, pp. 134-139, AAAI Press, 2007, ISBN 978-1-57735-319-5. (Best Student Paper Award)
full text pdf | full text ps | presentation pps ]
17.
Modelling Alternatives in Temporal Networks
Roman Barták, Ondřej Čepek, Pavel Surynek. Proceedings of 2007 IEEE Symposium on Computational Intelligence in Scheduling (CISched 2007), Honolulu, Hawaii, USA, pp. 129-136, IEEE Press, 2007, ISBN 1-4244-0698-6.
co-author's web (Roman Barták) | co-author's web (Ondřej Čepek) ]
16.
Discovering Equivalence Classes in Precedence Graphs
Roman Barták, Ondřej Čepek, Pavel Surynek. Proceedings of of the Conference Znalosti 2007, pp. 17-28, VŠB - Technical University of Ostrava, Česká republika, 2007, ISBN 978-80-248-1279-3.
co-author's web (Roman Barták) | co-author's web (Ondřej Čepek) ]
15.
Solving Difficult Problems by Viewing them as Structured Dense Graphs
Pavel Surynek, Lukáš Chrpa, Jiří Vyskočil. Technical Report, ITI Series, 2007-350 (21 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
co-author's web (Lukáš Chrpa) | co-author's web (Jiří Vyskočil) | full text pdf | full text ps ]
14.
Solving Difficult SAT Instances Using Greedy Clique Decomposition
Pavel Surynek. Technical Report, ITI Series, 2007-340 (15 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]
13.
Tractable Classes of a Problem of Finding Supporting Actions for a Goal in AI Planning
Pavel Surynek. Technical Report, ITI Series, 2007-338 (9 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]
12.
Projection Global Consistency: An Application in AI Planning
Pavel Surynek. Technical Report, ITI Series, 2007-333 (20 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]
11.
Maintaining Arc-consistency over Mutex Relations in Planning Graphs during Search
Pavel Surynek. Technical Report, ITI Series, 2007-328 (9 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]
10.
Constraint Based Reasoning over Mutex Relations in Planning Graphs during Search
Pavel Surynek. Technical Report, ITI Series, 2007-329 (16 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]


2006

9.
Modelling Alternatives in Temporal Networks
Roman Barták, Ondřej Čepek, Pavel Surynek. Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2006), Nottingham, United Kingdom, pp. 121-128, University of Nottingham, 2006, ISSN 1368-5708.
co-author's web (Roman Barták) | co-author's web (Ondřej Čepek) ]
8.
Constraint Based Reasoning over Mutex Relations in GraphPlan Algorithm
Pavel Surynek. Proceedings of the 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming (CSCLP 2006), Caparica, Portugal, pp. 231-245, FCT/UNL, 2006.
full text pdf | full text ps | presentation pps ]
7.
On State Management in Plan-Space Planning from CP Perspective
Pavel Surynek. Proceedings of the ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, Cumbria, United Kingdom, pp. 23-30, 2006.
full text pdf | full text ps | presentation pps ]


2005

6.
Encoding HTN Planning as a Dynamic CSP
Pavel Surynek, Roman Barták. Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain, Lecture Notes in Computer Science 3709, p. 868-868, Springer-Verlag, 2005, ISBN 3-540-29238-1.
full text pdf | full text ps | presentation pps ]
5.
Dynamické problémy s podmínkami (Dynamic constraint satisafction problems)
Pavel Surynek. Thesis to fullfil a requirement for the degree of doctor of natural sciences - RNDr., 180 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2005.
full text pdf | full text ps | thesis web page ]
4.
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems
Roman Barták, Pavel Surynek. Proceedings of the 18th International Florida Artificial Intelligence Research Society Conference (FLAIRS 2005), Clearwater, FL, USA, pp. 161-166, AAAI Press, 2005, ISBN 1-57735-234-3.
full text pdf | full text ps | presentation pps ]


2004

3.
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction
Pavel Surynek, Roman Barták. Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, Canada, Lecture Notes in Computer Science 3258, pp. 767-771, Springer-Verlag, 2004, ISBN 3-540-23241-9.
full text pdf | full text ps | presentation pps ]
2.
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction
Pavel Surynek, Roman Barták. Technical report, ITI Series, 2007-205 (15 pages), Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
full text pdf | full text ps ]


2003

1.
Řešení dynamických problémů s podmínkami (Solving dynamic constraint satisafction problems)
Pavel Surynek. Master thesis, 100 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2003.
full text pdf | full text ps | presentation pps | thesis web page ]