Search results for "CONSTRAINT"
showing 10 items of 361 documents
External constraints on optimal control strategies in molecular orientation and photofragmentation: Role of zero-area fields
2013
We propose a new formulation of optimal and local control algorithms which enforces the constraint of time-integrated zero-area on the control field. The fulfillment of this requirement, crucial in many physical applications, is mathematically implemented by the introduction of a Lagrange multiplier aiming at penalizing the pulse area. This method allows to design a control field with an area as small as possible, while bringing the dynamical system close to the target state. We test the efficiency of this approach on two control purposes in molecular dynamics, namely, orientation and photodissociation.
Using Fourier local magnitude in adaptive smoothness constraints in motion estimation
2007
Like many problems in image analysis, motion estimation is an ill-posed one, since the available data do not always sufficiently constrain the solution. It is therefore necessary to regularize the solution by imposing a smoothness constraint. One of the main difficulties while estimating motion is to preserve the discontinuities of the motion field. In this paper, we address this problem by integrating the motion magnitude information obtained by the Fourier analysis into the smoothness constraint, resulting in an adaptive smoothness. We describe how to achieve this with two different motion estimation approaches: the Horn and Schunck method and the Markov Random Field (MRF) modeling. The t…
Optimal Switches in Multi–inventory Systems
2007
Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.
On the checking of g-coherence of conditional probability bounds
2003
We illustrate an approach to uncertain knowledge based on lower conditional probability bounds. We exploit the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), which is equivalent to the "avoiding uniform loss" property introduced by Walley for lower and upper probabilities. Based on the additive structure of random gains, we define suitable notions of non relevant gains and of basic sets of variables. Exploiting them, the linear systems in our algorithms can work with reduced sets of variables and/or constraints. In this paper, we illustrate the notions of non relevant gain and of basic set by examining several cases of imprecise assessments d…
Representation of capacity drop at a road merge via point constraints in a first order traffic model
2018
We reproduce the capacity drop phenomenon at a road merge by implementing a non-local point constraint at the junction in a first order traffic model. We call capacity drop the situation in which the outflow through the junction is lower than the receiving capacity of the outgoing road, as too many vehicles trying to access the junction from the incoming roads hinder each other. In this paper, we first construct an enhanced version of the locally constrained model introduced by Haut et al. (Proceedings 16th IFAC World Congress. Prague, Czech Republic 229 (2005) TuM01TP/3), then we propose its counterpart featuring a non-local constraint and finally we compare numerically the two models by c…
Solving the pentahedron problem
2015
Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron…
Using the witness method to detect rigid subsystems of geometric constraints in CAD
2010
International audience; This paper deals with the resolution of geometric constraint systems encountered in CAD-CAM. The main results are that the witness method can be used to detect that a constraint system is over-constrained and that the computation of the maximal rigid subsystems of a system leads to a powerful decomposition method. In a first step, we recall the theoretical framework of the witness method in geometric constraint solving and extend this method to generate a witness. We show then that it can be used to incrementally detect over-constrainedness. We give an algorithm to efficiently identify all maximal rigid parts of a geometric constraint system. We introduce the algorit…
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
Graded Poisson structures on the algebra of differential forms
1995
We study the graded Poisson structures defined on Ω(M), the graded algebra of differential forms on a smooth manifoldM, such that the exterior derivative is a Poisson derivation. We show that they are the odd Poisson structures previously studied by Koszul, that arise from Poisson structures onM. Analogously, we characterize all the graded symplectic forms on ΩM) for which the exterior derivative is a Hamiltomian graded vector field. Finally, we determine the topological obstructions to the possibility of obtaining all odd symplectic forms with this property as the image by the pullback of an automorphism of Ω(M) of a graded symplectic form of degree 1 with respect to which the exterior der…
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…