Konstantin Artiouchine

Learn More
We study a global constraint, the " inter-distance constraint " that ensures that the distance between any pair of variables is at least equal to a given value. When this value is 1, the inter-distance constraint reduces to the all-different constraint. We introduce an algorithm to propagate this constraint and we show that, when domains of the variables(More)
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the airport, a set of time windows in which the landing is possible, is automatically assigned to each aircraft. The objective is to maximize the minimum time elapsed between any two(More)
Motivated by the problem of computing trajectories of a set of aircraft in their final descent, we introduce the K king problem, a dramatic simplification of the initial problem in which time and space are discretized. A constraint-based model relying on several specific global constraints is introduced. Computational experiments are reported and show that(More)
We study the " inter-distance constraint " , also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal to a given value. When this value is 1, the inter-distance constraint reduces to the all-different constraint. We introduce an algorithm to propagate this constraint and we show(More)
This paper presents an approach to handle some problems arising in the modelling of hybrid systems combining static and dynamic. In the case of a discrete or continuous dynamic system, there is no particular condition forcing a solution of a differential inclusion starting from a point x0 to remain in a set K defined by a set of static constraints. We study(More)
  • 1