We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
Pierre Flener, Justin Pearson, Meinolf Sellmann, P...
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
— In this paper we present a new method for kinodynamic motion planning in environments that contain both static and moving obstacles. We present an efficient twostage approach:...
Abstract. This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bd...
Nardine Osman, David Robertson, Christopher Walton
This paper studies a general class of formations of unicycle robots. One of the robots plays the role of the leader and the formation is induced through a constraint function F tha...