Pavel Surynek | Curriculum Vitae

Pavel Surynek | Curriculum Vitae
February 2016
Personal Details
Name:
Pavel Surynek, Ph.D.
Position:
Assistant Professor
Institution: Charles University Prague
Faculty of Mathematics and Physics
Department of Theoretical Computer Science
and Mathematical Logic
Malostranské naměstí 25
118 00 Praha 1, Czech Republic
Birth:
06/30/1979, Vlašim, Czech Republic
Telephone: +420 221 914 139 (office)
+420 728 061 994 (home)
E-mail:
pavel.surynek@mff.cuni.cz
URL:
http://ktiml.mff.cuni.cz/~surynek
Education
10.2005 – 09.2008
Ph.D., Artificial Intelligence
Charles University in Prague, Czech Republic
Faculty of Mathematics and Physics
Dissertation thesis: Constraint Programming in Planning
Thesis advisor: Roman Barták, Professor
03.2005
Doctor of Natural Sciences (RNDr.), Theoretical Computer Science
Charles University in Prague, Czech Republic
Faculty of Mathematics and Physics
Thesis: Dynamic Constraint Satisfaction Problems
09.1998 – 01.2004
M.Sc., Theoretical Computer Science
Charles University in Prague, Czech Republic
Faculty of Mathematics and Physics,
Master thesis: Solving Dynamic Constraint Satisfaction Problems
Professional Experience
01.2009 – present
Assistant Professor (tenure track)
Charles University Prague, Czech Republic
Faculty of Mathematics and Physics
 Responsible for doing research in artificial intelligence (multi-agent path
finding, planning in robotics, propositional satisfiability, constraint programming) and teaching fundamental computer science courses (theory of
formal languages, decision procedures). Full participation in faculty service
– membership in examination committees, thesis reviewing committees,
public relations service. Participation in artificial intelligence research
projects.
08.2011 – 09.2012
JSPS Postdoctoral Fellow, Visiting Researcher (1 year)
Kobe University, Japan
Graduate School of Maritime Sciences,
Page 1 of 13
Intelligent Informatics Laboratory
Fellowship supervisor: Katsutoshi Hirayama, Professor
 Research in multi-agent path finding, robot navigation, ship avoidance, and
propositional satisfiability. Participation in solving research projects.
09.2006 – 09.2008
Research Fellow (temporary position)
Faculty of Mathematics and Physics
Charles University Prague, Czech Republic
 Research in application of constraint programming in domain independent
automated planning. Development of scheduling applications in Prolog.
06.2004 – 06.2005
Software Analyst (position in industry)
UniControls, a.s., Praha, Czech Republic
 Responsible for the analysis, design, and development of train communication system with special regard on security issues specified by EU train traffic regulation body. Programming in C language for special on-board train
hardware.
06.2000 – 06.2001
Software Developer (position in industry)
Definity Systems, Benešov, Czech Republic
 Development of database applications for car industry (Škoda Auto). Programming in C++.
Awards and Fellowships

Japan Society for the Promotion of Science Postdoctoral Fellowship 2011
Award given by:
Japan Society for the Promotion of Science, 2011.

Annual Award of the Bernard Bolzano Foundation 2008
Competing work: Collection of 4 papers on Artificial Intelligence Planning
Award given by: Charles University in Prague,
Faculty of Mathematics and Physics, 2008.

MICAI 2011 Best Poster Award - second place
Competing work: Automated Classification of Bitmap Images Using Decision Trees
Award given by: Program Committee of MICAI 2011, 10th Mexican International
Conference on Artificial Intelligence and the Mexican Society of Artificial
Intelligence (SMIA), 2011.
Special Courses
2011
2011
2007
2006
2006
2005
First International SAT/SMT Solver Summer School,
Cambridge, MA, USA
Transnational Technology Transfer Manager - Junior (TTM-J),
Prague, Czech Republic
Third International Summer School on Constraint Programming,
Lloret de Mar, Spain
Second International Summer School on Constraint Programming,
Samos, Greece
ICAPS Summer School on Planning,
Cumbria, United Kingdom
First International Summer School on Constraint Programming,
Aquafreda di Maratea, Italy (highest score in the final exam)
Page 2 of 13
Grant Projects
2011 – 2012
Principal Researcher
Project title: Propositional Satisfiability in Multi-agent Planning
Type:
Grant in aid for scientific research
Provider: Japan Society for the Promotion of Science
Value:
1.000.000 JPY
2009 – 2011
Principal Researcher
Project title: Constraint Programming and Boolean Satisfiability
for Artificial Intelligence
Type:
Post-doctoral project
Provider: Czech Science Foundation
Value:
40.000 EUR
2010 - 2014
Member
Project title: PlanEx: Bridging Planning and Execution
Type:
Senior research project
Provider: Czech Science Foundation
Value:
100.000 EUR
2007 – 2009
Member
Project title: Dynamic Aspects of Scheduling
Type:
Senior research project
Provider: Czech Science Foundation
Value:
60.000 EUR
2006 – 2008
Principal Researcher
Project title: Constraint Satisfaction in Planning
Type:
Doctoral project
Provider: Grant Agency of Charles University
Value:
30.000 EUR
2005 – 2008
Member
Project title: Collegium Informaticum
Type:
Doctoral project
Provider: Czech Science Foundation
Value:
10.000 EUR
Programme Committee and Editorial Board Membership











International Journal of Artificial Intelligence and Application, Science & Engineering Research
Support soCiety, Australia
AAAI 2016: 30th AAAI Conference on Artificial Intelligence
ICAART 2015: 8th International Conference on Agents and Artificial Intelligence
AAMAS 2015: 14th International Conference on Autonomous Agents and Multiagent Systems
ECAI 2014: 21st European Conference on Artificial Intelligence
ICAART 2014: International Conference on Agents and Artificial Intelligence 2014
AAMAS 2014: 13th International Conference on Autonomous Agents and Multiagent Systems
ICAART 2013: International Conference on Agents and Artificial Intelligence 2013
IJCAI 2013: 23rd International Joint Conference on Artificial Intelligence
ICAART 2013: 6th International Conference on Agents and Artificial Intelligence
AIA 2012: Artificial Intelligence and Application 2012
Page 3 of 13



ICAART 2012: International Conference on Agents and Artificial Intelligence 2012
AAAI 2011: 25th AAAI Conference on Artificial Intelligence
ICAART 2011: International Conference on Agents and Artificial Intelligence 2011
Article Reviewing




















IEEE Transactions on Automation Science and Engineering (T-ASE 2015)
IEEE International Conference on Automation Science and Engineering (CASE 2014)
Robotics and Computer Integrated Manufacturing (RCIM)
International Journal of Computer Mathematics (IJCM)
2013 IEEE International Conference on Robotics and Automation (ICRA 2013)
Theoretical Computer Science 2011 (TAMC 2010 Special Issue)
Week of Doctoral Students 2011 (WDS 2011)
Principles and Practice of Constraint Programming (CP 2011)
Constraints: An International Journal 2010
Week of Doctoral Students 2010 (WDS 2010)
Advances in Artificial Intelligence 2010
Annual Conference on Theory and Applications of Models of Computation 2010 (TAMC 2010)
Constraints: An International Journal 2010
FLAIRS Program Committee member (FLAIRS 2010 - Special track Artificial Intelligence Planning
and Scheduling)
Journal Kybernetika 2008
Week of Doctoral Students 2009 (WDS 2009)
International Joint Conference on Artificial Intelligence 2009 (IJCAI 2009)
Week of Doctoral Students 2008 (WDS 2008)
Principles and Practice of Constraint Programming (CP 2007)
Recent Advances in Constraints 2007 (RAC 2007), CSCLP 2007 post-proceedings
Invited and Special Talks

Artificial Intelligence and Computer Driven Society
An invited talk at the University of Hyogo, May 2012, Japan.

Cooperative Path-finding as Satisfiability
A talk at the 4th CSPSAT Seminar, May 2012, Kobe University, Japan.

Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems
A talk at the CSP Seminar at Graduate School of Maritime Sciences, October 2011, Kobe University, Japan.

Global Consistencies in Boolean Satisfiability
An invited talk at the 2nd CSPSAT Seminar 2010, Information Science and Technology Center of
the Kobe University, November 2010, Kobe University, Japan.

Path-planning for Multiple Robots
An invited talk at the 2nd CSPSAT Seminar 2010, Information Science and Technology Center of
the Kobe University, November 2010, Kobe University, Japan.

Centralized Multi-agent Path Planning
An invited talk at the Seminar of Agent Technology Center, June 2010, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic.

Path Planning for Multiple Robots
Page 4 of 13
A talk at the 18th Annual Conference Week of Doctoral Students 2009, June 2009, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic.

Plánování cest pro mnoho robotů (Multi-robot path planning)
A talk at the Seminar on Artificial Intelligence, April 2009, Faculty of Mathematics and Physics,
Charles University, Prague, Czech Republic.
Taught Subjects at Charles University
Teaching load: 4 classes / year










Theory of Formal Languages
Decision Procedures and Verification
Seminar on Artificial Intelligence
Propositional and Predicate Logic
Seminar on Satisfiability
Algorithms and Data Structures
Automata and Grammars
Non-procedural Programming
Individual Software Project
Programming
lecture and seminar (2013 - present)
lecture and seminar (2009 - present)
student seminar (2009 - present)
seminar (2009 - present)
student seminar (2008 - present)
seminar (2008 - 2009)
seminar (2006 - present)
seminar (2006 - 2008)
project (2006 - present)
seminar (2005 - 2008)
Student Supervision and Advising at Charles University
Current Supervision




Marek Vandas, Master thesis
Planning for Strategy Games, supervising since 2015.
Ondřej Majerech, Master thesis
Multi-agent Path Finding in Dynamic Environments, supervising since 2015.
Jiří Švancara, Master thesis
Multi-agent Path Finding in Unidirectional Environments, supervising since 2015.
Eliška Bartošová, Ph.D. thesis
Computer Aided Teaching of Spatial Geometry, supervising since 2012.
Graduated







Milan Ježek, Bachelor thesis
Modeling of Cooperative Path Finding, graduated 2015.
Marika Ivanová, Master thesis
Adversarial Cooperative Path-Finding, graduated 2014.
o Second place in the national competition of the Union of Czech Mathematicians and
Physicists.
Josef Talaš, Master thesis
Content-based Image Search, graduated 2014.
Miloš Chromý, Bachelor thesis
Improvement of the BIBOX Algorithm, graduated 2013.
Jakub Vlček, Bachelor thesis
Recognition and Filtration of Unwanted Video-Sequences, graduated 2013.
Václav Obrázek, Bachelor thesis
Coordinated pathfinding with formations, graduated 2013.
Filip Stočes, Bachelor thesis
Visualization of plans for logistics tasks, graduated 2011.
Page 5 of 13

















Petr Michalík, Master thesis
Sub-optimal algorithms for solving sliding puzzles, graduated 2011.
Ivana Lukšová, Bachelor thesis
Bitmap picture classification, graduated 2010.
Jakub Kýpeť, Bachelor thesis
Computer poker, graduated 2010.
Martin Petr, Bachelor thesis
Handwriting recognition using neural network, graduated 2010.
Vojtěch Bardiovský, Bachelor thesis
Generating of self-replicating cellular automata, graduated 2010.
Petr Koupý, Bachelor thesis
Visualization of problems of motion on a graph, graduated 2010.
Martin Ščavnický, Bachelor thesis
Automated prediction of results of tennis tournaments, graduated 2010.
Josef Pihera, Bachelor thesis
Data archiving using longest common subsequence, graduated 2010.
Tomáš Balyo, Master thesis
Design of an efficient SAT solver, graduated 2010.
Radovan Duga, Bachelor thesis
Erasing Disturbing Objects from Digital Pictures, graduated 2009.
Martin Galajda, Bachelor thesis
Algorithms for Solving the Sokoban Game, graduated 2009.
Ondřej Malý, Bachelor thesis
Software for Modeling Car Driving Properties, graduated 2008.
Tomáš Balyo, Bachelor thesis
Efficient Boolean Satisfiability Solver, graduated 2008.
Štefan Čudai, Bachelor thesis
Multiagent Traffic Control System, graduated 2007.
Martin Langhammer, Bachelor thesis
Train Traffic Simulation with Optimization, graduated 2007.
Attila Ulman, Bachelor thesis
Emergence of Intelligent Behavior of Social Insects, graduated 2007.
Kristýna Bémová, Bachelor thesis
Computer-aided Teaching of Spherical Geometry, graduated 2007.
Thesis Reviewing and Thesis Committee Membership at Charles University







Imrich Kuklis, Bachelor thesis
Selected Problems Related to Vehicle Routing, 2015.
Martin Blicha, Bachelor thesis
Model Construction in Polynomial Representation, 2015.
Jan Tomášek, Master thesis
Computational Intelligence for Malware Classification, 2015.
Radek Miček, Master thesis
Automated Model Construction, 2015.
Dominik Janata, Bachelor thesis
Timetable Designing Environment, 2014.
Michal Ondrejáš, Bachelor thesis
Path planning in realistic 3D environments, 2014.
Michal Klein, Bachelor thesis
Coordinated Movement of Virtual Agents in Unreal Tournament 2004, 2014.
Page 6 of 13




















Martin Pecka, Master thesis
Detection of 2D features in MARSIS ionogram pictures, 2013.
Marcel Kikta, Bachelor thesis
Visualization of Geometric Algorithms, Bachelor thesis, 2012.
Luboš Turek, Bachelor thesis
Application of the ACO Algorithm to Solving Simple Substitution Cipher, 2012.
Jakub Lehotský, Master thesis
Incomplete Search Algorithms, 2011.
Martin Molnár, Master thesis
Filtering Algorithms for Tabular Constraints, 2010.
Jindřich Ivánek, Bachelor thesis
Heuristically controlled search for the optimum in NP-hard problems, 2010.
Robert Brunetto, Bachelor thesis
Interpreter and debugging environment for Prolog, 2010.
Tomáš Caithaml, Master thesis
Domain specific languages, 2009.
Pavel Zykán, Master thesis
Dynamic Temporal Network, 2009.
Michal Tuláček, Bachelor thesis
Constraint solvers, 2009.
Tomáš Plch, Master thesis
Action selection for an animat, 2009.
Jaroslav Mlejnek, Bachelor thesis
Global Constraints, 2008.
Tomáš Huml, Bachelor thesis
Portfolio Optimization, 2008.
Petr Baudiš, Bachelor thesis
Current Concepts in Version Control Systems, 2008.
Ondřej Krč-Jediný, Bachelor thesis
Matrix Calculator, 2008.
Petr Baudiš, Bachelor thesis
Current Concepts in Version Control Systems, 2008.
Miroslava Plachá, Bachelor thesis
Comparison of Constraint Programming Systems, 2007.
Tomáš Haničinec, Bachelor thesis
Constraint Modeling, 2007.
Ľubomír Karlík, Bachelor thesis
System for Administration of Tests, 2007.
Luděk Cigler, Bachelor thesis
Analysis and Implementation of School Timetabling Algorithms, 2006.
Page 7 of 13
Publications
Citation statistics (source Google Scholar): 259, h-index: 8 [August 2015]
Refereed Journal Articles
1. Pavel Surynek. Complexity of the Optimal Cooperative Multi-agent Path Finding. Fundamenta
Informaticae, Volume 137 (4), pp. 517-548, IOS Press, 2015, (IF 2013=0.479).
2. Pavel Surynek, Petra Surynková, Miloš Chromý. The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems. Fundamenta Informaticae, Volume 135 (3),
IOS Press, 2014, (IF 2013=0.479).
3. Pavel Surynek. Solving Abstract Cooperative Path-Finding in Densely Populated Environments.
Computational Intelligence (COIN), Volume 30 (2), pp. 402-450, Wiley, (IF 2013=0.87).
4. Pavel Surynek. Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup. International Journal on Artificial Intelligence Tools
(IJAIT), Volume 23 (1), World Scientific, (IF 2013=0.321).
5. Pavel Surynek. Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. International Journal on Artificial Intelligence Tools (IJAIT), Volume 22, Number 05, World
Scientific, 2013, (IF 2013=0.321).
6. Pavel Surynek, Ivana Lukšová. Automated Classification of Bitmap Images Using Decision Trees.
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 - second place)
7. Roman Barták, Ondřej Čepek, Pavel Surynek. Discovering Implied Constraints in Precedence
Graphs with Alternatives. Annals of Operations Research (ANOR 2010), Volume 180, Number 1,
pp. 233-263, Springer, 2010, ISSN: 0254-5330, [Accepted 2008], (IF 2013=1.103).
Articles in Peer Reviewed Conference Proceedings
7. Pavel Surynek: Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Suboptimally. Proceedings of the 24rd International Joint Conference on Artificial Intelligence (IJCAI
2015), pp. 1916-1922, IJCAI/AAAI Press, 2015.
8. Adi Botea, Pavel Surynek. Multi-Agent Path Finding on Biconnected Directed Graphs. Proceedings
of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 2024-2030, AAAI Press,
2015.
9. Pavel Surynek: UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Suboptimal Cooperative Path Finding. Proceedings of the Proceedings of the 8th Annual Symposium
on Combinatorial Search (SoCS 2015), pp. 236-237, AAAI Press, 2015.
10. Pavel Surynek. Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet
More. Proceedings of the 13th Mexican International Conference on Artificial Intelligence (MICAI
2014), pp. 410-425, LNCS 8857, Springer, 2014.
11. Pavel Surynek. A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. Proceedings of the 13th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2014), pp. 827-833, LNCS 8862, Springer, 2014.
12. Marika Ivanová, Pavel Surynek. Adversarial Cooperative Path-finding: Complexity and Algorithms.
Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI
2014), pp. 75-82, IEEE Press.
13. Pavel Surynek. Compact Representations of Cooperative Path-Finding as SAT Based on Matchings
in Bipartite Graphs. Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI 2014), pp. 875-882, IEEE Press.
14. Pavel Surynek, Petra Surynková. Theoretical Challenges in Knowledge Discovery in Big Data: a
logic reasoning and a graph theoretical point of view. Proceedings of the 6th International Conference on Knowledge Engineering and Ontology Development (KEOD 2014), SCITEPRESS, 2014.
Page 8 of 13
15. Pavel Surynek. Mutex Reasoning in Cooperative Path Finding Modeled as Propositional Satisfiability. Proceedings of the 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), Tokyo, Japan, IEEE Press, 2013.
16. Pavel Surynek. Optimal Cooperative Path Planning through Propositional Satisfiability Solving.
Proceedings of the Conference Znalosti 2013, Ostrava, Czech Republic.
17. Pavel Surynek. A Survey of Collaborative Web Search: Through Collaboration among Search Engine Users to More Relevant Results. 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.
18. Pavel Surynek. Propositional Satisfiability Benchmarks Constructed from Multi-Robot Path Planning on Graphs. 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.
19. Pavel Surynek. Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation (SARA 2013),
Leavenworth, WA, USA, AAAI Press, 2013, ISBN 978-1-57735-630-1.
20. Marika Ivanová, Pavel Surynek. Adversarial Cooperative Path-Finding: A First View. The 27th
AAAI Conference on Artificial Intelligence (AAAI 2013), Bellevue, WA, USA, late breaking track,
AAAI Press, 2013.
21. Pavel Surynek. On Propositional Encodings of Cooperative Path-finding. 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.
22. Tomáš Balyo, Roman Barták, Pavel Surynek. Shortening Plans by Local Re-Planning. Proceedings
of the 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 10221028, Athens, Greece, IEEE Press, 2012, ISBN 978-0-7695-4915-6.
23. Pavel Surynek. A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), Niagara Falls, Ontario, Canada, AAAI Press, 2012.
24. Tomáš Balyo, Roman Barták, Pavel Surynek. On Improving Plan Quality via Local Enhancements.
Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), Niagara Falls,
Ontario, Canada, AAAI Press, 2012.
25. Pavel Surynek. An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors.
Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 927-928,
Montpellier, France, IOS Press, ISBN 978-1-61499-097-0.
26. Pavel Surynek. Application of Propositional Satisfiability to Special Cases of Cooperative PathPlanning. 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.
27. Pavel Surynek. Relocation Tasks and a Hierarchical Subclass. 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.
28. Pavel Surynek. Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability
Solving. Proceedings of the 26th Annual Conference of The Japanese Society for Artificial Intelligence (JSAI 2012), Yamaguchi, Japan, The Japanese Society for Artificial Intelligence, 2012.
29. Pavel Surynek. Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability
Solving. 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.
30. Pavel Surynek. Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. 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.
Page 9 of 13
31. Pavel Surynek, Ivana Lukšová. Automated Classification of Bitmap Images Using Decision Trees.
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 - second place)
32. Pavel Surynek. Between Path-Consistency and Higher Order Consistencies in Boolean Satisfiability. 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.
33. Pavel Surynek. Exploiting Global Properties in Path-Consistency Applied on SAT. 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.
34. Pavel Surynek, Ivana Lukšová. Attribute Extraction and Processing for Automated Classification of
Bitmap Images. 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.
35. Pavel Surynek. An Adaptation of Path Consistency for Boolean Satisfiability: a Theoretical View of
the Concept. Proceedings of the Annual ERCIM Workshop on Constraint Solving and Constraint
Logic Programming, 2010 (CSCLP 2010), Berlin, Germany, pp. 16-30, Fraunhofer FIRST, 2010.
36. Pavel Surynek. An Adaptation of Path Consistency for Boolean Satisfiability. 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.
37. Pavel Surynek, Petr Koupý. Improving Solutions of Problems of Motion on Graphs by Redundancy
Elimination. 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.
38. Pavel Surynek. An Optimization Variant of Multi-Robot Path Planning is Intractable. Proceedings
of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, GA, USA, pp. 12611263, AAAI Press, 2010, ISBN 978-1-57735-463-5.
39. Pavel Surynek, Petr Koupý. Visualization as a tool for acquiring knowledge about the quality of
solutions of problems of motion on graphs. 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.
40. Pavel Surynek. An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning.
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.
41. Pavel Surynek. On Pebble Motion on Graphs and Abstract Multi-robot Path Planning. 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.
42. Pavel Surynek. Plánování cest pro mnoho robotů. 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.
43. Pavel Surynek. Making Solutions of Multi-robot Path Planning Problems Shorter Using Weak
Transpositions and Critical Path Parallelism. Proceedings of the 2009 International Symposium on
Combinatorial Search (SoCS 2009), Lake Arrowhead, CA, USA, 6 pages, University of Southern California, 2009.
44. Pavel Surynek. Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in θlike Environments. 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.
45. Pavel Surynek. A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs.
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.
46. Tomáš Balyo, Pavel Surynek. An Efficient Heuristic for SAT Exploiting Connected Components of
the Problem. Proceedings of the Conference Znalosti 2009, Faculty of Information Technology,
Page 10 of 13
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
BUT, Brno, Czech Republic, pp. 35-46, Slovenská technická univerzita v Bratislavě, 2009, in Czech,
ISBN 978-80-227-3015-0.
Pavel Surynek. Finding Plans for Rearranging Robots in θ-like Environments. 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.
Pavel Surynek. Domain-Dependent View of Multiple Robots Path Planning. 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.
Pavel Surynek. Making Path Consistency Stronger for SAT. Proceedings of the Annual ERCIM
Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2008), ISTC-CNR,
Rome, Italy, 2008.
Pavel Surynek. A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. 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.
Pavel Surynek. Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network.
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.
Pavel Surynek, Lukáš Chrpa, Jiří Vyskočil. Solving Difficult Problems by Viewing them as Structured Dense Graphs. Proceedings of the 3rd Indian International Conference on Artificial Intelligence (IICAI 2007), Pune, India, pp. 84-103, 2007, ISBN 978-0-9727412-2-4.
Pavel Surynek, Roman Barták. Tractable Class of a Problem of Finding Supports. Proceedings of
the 13th International Conference on Principles and Practice of Constraint Programming (CP
2007), Doctoral Programme, Providence, RI, USA, pp. 169-174, 2007.
Pavel Surynek. Solving Difficult SAT Instances Using Greedy Clique Decomposition. 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-3540-73579-3.
Lukáš Chrpa, Pavel Surynek, Jiří Vyskočil. Encoding of Planning Problems and Their Optimizations
in Linear Logic. 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-64200674-6.
Pavel Surynek. Projection Global Consistency: An Application in AI Planning. Proceedings of the
Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2007),
Rocquencourt, France, pp. 61-75, INRIA, 2007.
Pavel Surynek. Řešení obtížných případů problému splnitelnosti Booleovských formulí. 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.
Pavel Surynek, Roman Barták. Maintaining Arc-consistency over Mutex Relations in Planning
Graphs during Search. 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. (finalist of Best Student Paper Award)
Roman Barták, Ondřej Čepek, Pavel Surynek. Modelling Alternatives in Temporal Networks. 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.
Roman Barták, Ondřej Čepek, Pavel Surynek. Discovering Equivalence Classes in Precedence
Graphs. 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.
Roman Barták, Ondřej Čepek, Pavel Surynek. Modelling Alternatives in Temporal Networks. 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.
Page 11 of 13
62. Pavel Surynek. Constraint Based Reasoning over Mutex Relations in GraphPlan Algorithm. Proceedings of the 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming
(CSCLP 2006), Caparica, Portugal, pp. 231-245, FCT/UNL, 2006.
63. Pavel Surynek. On State Management in Plan-Space Planning from CP Perspective. Proceedings
of the ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling
Problems, Cumbria, United Kingdom, pp. 23-30, 2006.
64. Pavel Surynek, Roman Barták. Encoding HTN Planning as a Dynamic CSP. 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-54029238-1.
65. Roman Barták, Pavel Surynek. An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. 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.
66. Pavel Surynek, Roman Barták. A New Algorithm for Maintaining Arc Consistency After Constraint
Retraction. 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.
Technical Reports
1. Pavel Surynek. Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup. Technical Report, ITI Series, 2011-537, 40 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2011.
2. Pavel Surynek. Abstract Path Planning for Multiple Robots: An Empirical Study. Technical Report,
ITI Series, 2010-504, 75 pages, Faculty of Mathematics and Physics, Charles University, Prague,
Czech Republic, 2010.
3. Pavel Surynek. Abstract Path Planning for Multiple Robots: A Theoretical Study. Technical Report,
ITI Series, 2010-503, 34 pages, Faculty of Mathematics and Physics, Charles University, Prague,
Czech Republic, 2010.
4. Pavel Surynek. Finding Sub-optimal Solutions for Problems of Path Planning for Multiple Robots in
θ-like Environments. Technical Report, ITI Series, 2007-430, 15 pages, Faculty of Mathematics
and Physics, Charles University, Prague, Czech Republic, 2009.
5. Pavel Surynek. Path Planning for Multiple Robots in Bi-connected Environments. Technical Report, ITI Series, 2009-431, 17 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2009.
6. Pavel Surynek, Lukáš Chrpa, Jiří Vyskočil. Solving Difficult Problems by Viewing them as Structured Dense Graphs. Technical Report, ITI Series, 2007-350, 21 pages, Faculty of Mathematics
and Physics, Charles University, Prague, Czech Republic, 2007.
7. Pavel Surynek. Solving Difficult SAT Instances Using Greedy Clique Decomposition. Technical Report, ITI Series, 2007-340, 15 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2007.
8. Pavel Surynek. Tractable Classes of a Problem of Finding Supporting Actions for a Goal in AI Planning. Technical Report, ITI Series, 2007-338, 9 pages, Faculty of Mathematics and Physics, Charles
University, Prague, Czech Republic, 2007.
9. Pavel Surynek. Projection Global Consistency: An Application in AI Planning. Technical Report, ITI
Series, 2007-333, 20 pages, Faculty of Mathematics and Physics, Charles University, Prague,
Czech Republic, 2007.
10. Pavel Surynek. Maintaining Arc-consistency over Mutex Relations in Planning Graphs during
Search. Technical Report, ITI Series, 2007-328, 9 pages, Faculty of Mathematics and Physics,
Charles University, Prague, Czech Republic, 2007.
Page 12 of 13
11. Pavel Surynek. Constraint Based Reasoning over Mutex Relations in Planning Graphs during
Search. Technical Report, ITI Series, 2007-329, 16 pages, Faculty of Mathematics and Physics,
Charles University, Prague, Czech Republic, 2007.
12. Pavel Surynek, Roman Barták. A New Algorithm for Maintaining Arc Consistency After Constraint
Retraction. Technical report, ITI Series, 2007-205, 15 pages, Faculty of Mathematics and Physics,
Charles University, Prague, Czech Republic, 2007.
Book Chapters

Pavel Surynek. Multi-robot Path Planning. 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.
Theses



Pavel Surynek. Constraint Programming in Planning. Doctoral Dissertation, 136 pages, Faculty of
Mathematics and Physics, Charles University, Prague, Czech Republic, 2008.
Pavel Surynek. Dynamic constraint satisfaction problems. Thesis to fulfill a requirement for the
degree of doctor of natural sciences - RNDr., 180 pages, Faculty of Mathematics and Physics,
Charles University, Prague, Czech Republic, 2005.
Pavel Surynek. Solving dynamic constraint satisfaction problems. Master thesis, 100 pages, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, 2003.
Page 13 of 13