11 citations · 27 across the 7 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2019
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…
cs.AI2015★ 7 cited
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…
cs.AI2014
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…