11 citations · 27 across the 7 of their papers we have counts for
8 papers
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern, Nathan Sturtevant, Ariel Felner +9
The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…
Planning as Tabled Logic Programming
Neng-Fa Zhou, Roman Bartak, Agostino Dovier
This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemen…
Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Roman Barták, Neng-Fa Zhou
Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during s…
Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science
Michal Zerola, Jérôme Lauret, Roman Barták +1
For the past decade, HENP experiments have been heading towards a distributed computing model in an effort to concurrently process tasks over enormous data sets that have been incr…
Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid
Michal Zerola, Jerome Lauret, Roman Bartak +1
In order to achieve both fast and coordinated data transfer to collaborative sites as well as to create a distribution of data over multiple sites, efficient data movement is one o…
Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints
Krzysztof R. Apt, Roman Bartak, Eric Monfroy +2
Homepage of the workshop proceedings, with links to all individually archived papers
Dynamic Global Constraints: A First View
Roman Bartak
Global constraints proved themselves to be an efficient tool for modelling and solving large-scale real-life combinatorial problems. They encapsulate a set of binary constraints an…
Interactive Timetabling
Tomas Muller, Roman Bartak
Timetabling is a typical application of constraint programming whose task is to allocate activities to slots in available resources respecting various constraints like precedence a…