Pavel Surynek
机构: Czech Technical University, Faculty of Information Technology
主页: surynek.net
每年引用次数
引用次数
引用: 2,313
H-指数: 20
I10-指数 : 40
出版物: 173
REDUNDANCY ELIMINATION IN HIGHLY PARALLEL SOLUTIONS OF MOTION COORDINATION PROBLEMS
PAVEL SURYNEK
International Journal on Artificial Intelligence Tools 22 ( 05) 1360002
3
2013
Search-Based Optimal Solvers for the Multi-AgentPathfinding Problem: Summary and Challenges [online][cit. 2019-06-15]
Ariel FELNER , Roni STERN , Solomon EYAL SHIMONY , Eli BOYARSKI
Dostupné z: http://faculty. cse. tamu. edu/guni/Papers/SOCS17-MAPF. pdf
2
The Joint Movement of Pebbles in Solving the (−)-Puzzle Suboptimally and its Applications in Rule-Based Cooperative Path-Finding
Pavel Surynek1and Petr Michalík
The Joint Movement of Pebbles in Solving the (𝑵𝟐− 𝟏)-Puzzle Suboptimally and its Applications in Rule-Based Cooperative Path-Finding
Pavel Surynek1and Petr Michalík
Global Consistencies in Boolean Satisfiability
RNDr Pavel Surynek
Path-planning for Multiple Robots
RNDr Pavel Surynek
Solving Difficult Problems by Viewing them as Structured Dense Graphs.
Pavel Surynek , Lukás Chrpa , Jirí Vyskocil
indian international conference on artificial intelligence 84 -103
2
2007
Domain-Dependent View of Multiple Robots Path Planning
Pavel Surynek
starting ai researchers' symposium 175 -186
2008
An optimization variant of multi-robot path planning is intractable
Pavel Surynek
national conference on artificial intelligence 1261 -1263
182
2010
Multi-agent path finding on strongly biconnected digraphs
Pavel Surynek , Adi Botea
national conference on artificial intelligence 2024 -2030
11
2015
UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding
Pavel Surynek
annual symposium on combinatorial search 236 -237
2015
Encoding of Planning Problems and Their Optimizations in Linear Logic.
Pavel Surynek , Lukás Chrpa , Jirí Vyskocil
INAP/WLP 54 -68
4
2007
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases
Pavel Surynek
symposium on abstraction, reformulation and approximation
3
2013
Reduced time-expansion graphs and goal decomposition for solving cooperative path finding sub-optimally
Pavel Surynek
international conference on artificial intelligence 1916 -1922
46
2015
Adversarial cooperative path-finding: a first view
Marika Ivanová , Pavel Surynek ,
national conference on artificial intelligence 53 -55
2
2013
Exploiting Global Properties in Path-Consistency Applied on SAT.
Pavel Surynek
scandinavian conference on ai 90 -99
2011
An alternative eager encoding of the all-different constraint over bit-vectors
Pavel Surynek
european conference on artificial intelligence 242 927 -928
2
2012
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.
Pavel Surynek , Eli Boyarski , Ariel Felner , Roni Stern
european conference on artificial intelligence 810 -818
142
2016
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.
Pavel Surynek , Nathan R. Sturtevant , Eli Boyarski , Ariel Felner
SOCS 29 -37
184
2017
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem
Pavel Surynek , Eli Boyarski , Ariel Felner , Roni Stern
annual symposium on combinatorial search 90 -105
2
2018
Eli Boyarski Ariel Felner Roni Stern Sven Koenig T. K. Satish Kumar Jiaoyang Li Hang Ma Jiří Švancara Guni Sharon Nathan Sturtevant Meir Goldenberg Glenn Wagner Anton Andreychuk (Андрейчук Антон Андреевич) Dor Atzmon Константин Сергеевич Яковлев (Konstantin Yakovlev) Han Zhang Tomas Balyo Neng-Fa Zhou Petra Surynkova Vojtech Cahlik