( en | de | ru )

 

Disambiguation of "Surynek, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.

, , , and . ECAI, volume 285 of Frontiers in Artificial Intelligence and Applications, page 810-818. IOS Press, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dietrich Pavel

Wieland Werther Pavel

Ji Pavelka

Jonas Philipp Pavelka

Luciana Pavel

 

Other publications of authors with the same name

On Improving Plan Quality via Local Enhancements., , and . SOCS, AAAI Press, (2012)Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS)., and . AAMAS, page 856-857. ACM, (2017)Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings.. CoRR, (2020)Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective.. RCAI, volume 12412 of Lecture Notes in Computer Science, page 85-99. Springer, (2020)Solving Difficult SAT Instances Using Greedy Clique Decomposition.. SARA, volume 4612 of Lecture Notes in Computer Science, page 359-374. Springer, (2007)Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding., , , and . ICAART (Revised Selected Papers), volume 10839 of Lecture Notes in Computer Science, page 116-136. Springer, (2017)Multi-agent Path Finding with Capacity Constraints., , and . AI*IA, volume 11946 of Lecture Notes in Computer Science, page 235-249. Springer, (2019)Encoding of Planning Problems and Their Optimizations in Linear Logic., , and . INAP/WLP, volume 5437 of Lecture Notes in Computer Science, page 54-68. Springer, (2007)Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving.. PRICAI, volume 7458 of Lecture Notes in Computer Science, page 564-576. Springer, (2012)On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle., and . IJCCI, page 473-478. ScitePress, (2019)