Prof. RNDr. Pavel SURYNEK, Ph.D.
Professor of Informatics
|
|
Room: | A-1433 (14th floor) |
Office hours: | Wednesday, 13:00-14:00 or later (via telecom or in person) |
|
|
|
|
|
|
Welcome to my academic website. This website presents my two primary activities which are doing research in the area of artificial intelligence and teaching related subjects.
I also offer supervising of software projects, bachelor theses, master theses, and doctoral dissertations. If you are a student
interested in working on a thesis under my supervision please feel free to contact me. Talented and motivated Ph.D. students and Post-Docs are especially welcome (funded projects are available).
My major research interests in the field of artificial intelligence include multi-agent path finding, satisfiability (SAT) / satisfiability modulo theories (SMT), heuristic search, motion planning, constraint satisfaction (CSP), and robotics. I am also interested in problem complexity, algorithm design, game theory, computational geometry, computer graphics, and physics.
I have been promoted to full professor of informatics at the Czech Technical University in 2022. Prior to this I obtained my habilitation (2016), Ph.D. (2008), and M.Sc. (2004) in artificial intelligence (AI) and theoretical computer science at Charles University.
Before joining the Czech Technical University I held the position of research scientist at AIST in Tokyo, the assistant professor position at Charles University, the position of JSPS fellow at Kobe University and various research&development positions in industry.
In addition to conducting
research and teaching in AI, I am supporting transfer of AI research outcomes to industrial practice and always welcoming interdisciplinary research opportunities.
|
Curriculum Vitae
Short CV for download [ CV ] |
Last update: 11th Sep 2024
- 2021 - 2022:
Full Professorship
Faculty of Information Technology, Czech Technical University in Prague, Czechia
Degree: prof., eligibility for a full professor position
Major: Informatics, Artificial Intelligence
- 2015 - 2016:
Habilitation
Faculty of Mathematics and Physics, Charles University, Czechia
Degree: doc., eligibility for an associate professor position
Major: Theoretical Computer Science, Artificial Intelligence
Thesis: Cooperative Path Finding for Multiple Robots
- 2005 - 2008:
Ph.D. Studies
Faculty of Mathematics and Physics, Charles University, Czechia
Degree: Ph.D.
Major: Theoretical Computer Science, Artificial Intelligence
Doctoral dissertation: Constraint Programming in Planning
- 2005:
Doctor of Natural Sciences
Faculty of Mathematics and Physics, Charles University, Czechia
Degree: RNDr., equivalent to Ph.D. candidate
Major: Theoretical Computer Science
Thesis: Dynamic Constraint Satisfaction Problems
- 1998 - 2004:
Master Studies
Faculty of Mathematics and Physics, Charles University, Czechia
Degree: Mgr., equivalent to M.Sc.
Major: Theoretical Computer Science
Diploma thesis: Solving Dynamic Constraint Satisfaction Problems
- 1994 - 1998:
Gymnasium in Vlašim (equivalent to grammar school), Czechia
|
- 2023 - present:
Professor of Informatics
Czech Technical University, Faculty of Information Technology, Czechia
- 2018 - 2022:
Associate Professor
Czech Technical University, Faculty of Information Technology, Czechia
- 2016 - 2018:
Research Scientist
National Institute of Advanced Industrial Science and Technology (AIST), Japan
- 2012 - 2016:
Assistant Professor
Charles University, Faculty of Mathematics and Physics, Czechia
- 2011 - 2012:
JSPS Postdoctoral Fellow, Visiting Professor
Kobe University, Intelligent Informatics Laboratory, Japan
- 2009 - 2011:
Assistant Professor
Charles University, Faculty of Mathematics and Physics, Czechia
- 2006 - 2009:
Research Fellow
Charles University, Faculty of Mathematics and Physics, Czechia
- 2004 - 2005:
Software Analyst
UniControls, a.s., Prague, Czechia
- 2000 - 2001:
Software Developer
Definity Systems, s.r.o., Benešov, Czechia
|
-
ICAPS 2020 Outstanding Student Paper Award
Competing work: Multi-Agent Path Finding with Mutex Propagation
Award given by: Program Committee of the 30th International Conference on Automated Planning and Scheduling, 2020.
-
Annual Award of the Bernard Bolzano Foundation 2008
(Výroční cena Nadačního fondu Bernarda Bolzana za rok 2008)
Competing work: Collection of 4 papers on Artificial Intelligence Planning
Award given by: Faculty of Mathematics and Physics, Charles University, 2008.
|
My research interests change in time. The following list is an attempt to
put together topics where I have contributed by a paper, software, or expertise (supervision).
Major:
- Artificial Intelligence
- Multi-agent Path Finding
- Heuristic Search
- Satisfiability
- Motion Planning
- Constraint Optimization
|
|
Minor:
- Problem Complexity
- Planning in Robotics
- Algorithm Design
- Machine Learning
- Computational Geometry
- Computer Graphics
|
computer science, artificial intelligence, automated planning, multi-agent path finding (MAPF), robotic agents, cooperative agents,
autonomous agents, cooperative path-finding (CPF), adversarial cooperative path-finding (ACPF), multi-robot planning,
pebble motion, propositional satisfiability (SAT), constraint programming (CSP), SAT-modulo theories (SMT), algorithms, SMT-CBS, SMT-CCBS, BIBOX, BIBOX-theta, diBOX, DnAC-6, AC|DC,
AC|DC-2, AC|DC-2i, local consistency, global consistency, dynamic constraint problems (DCSP), genetic algorithms, global consistency, projection consistency,
computer graphics, revision control systems, artificial neural networks, 2D graphics, 3D graphics, photo-realistic rendering
|