In order to solve the problem of low spraying efficiency and excessive paint waste caused by overspray when robot automatically sprays irregular plane, a method spray trajectory planning with boundary-constrained considering gun changing posture is proposed. The static model variable posture, dynamic along arc path are established separately, an optimization for symmetry coating distribution ba...

We studied the scalar electrodynamics (SQED4) and the spinor electrodynamics (QED4) in the null-plane formalism. We followed the Dirac’s technique for constrained systems to perform a detailed analysis of the constraint structure in both theories. We imposed the appropriated boundary conditions on the fields to fix the hidden subset first class constraints which generate improper gauge transfor...

An inequality g{x) 2i 0 is often said to be a reverse convex constraint if the function g is continuous and convex. The feasible regions for linear program with an additional reverse convex constraint are generally non-convex and disconnected. In this paper a convergent algorithm for solving such a linear problem is proposed. The method is based upon a combination of the branch and bound proced...

Finite domain constraints are one of the most important constraint domains in constraint logic programming. Usually, they are solved by local consistency techniques combined with enumeration. We argue that, in many cases, the concept of local consistency is too weak for both theoretical and practical reasons. We show how to obtain more information from a given constraint set by computing cuttin...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

This paper presents an algorithmic approach to the problem of detecting independently moving objects in 3D scenes that are viewed under camera motion. There are two fundamental constraints that can be exploited for the problem : (i) two/multi-view camera motion constraint (for instance, the epipolar/trilinear constraint) and (ii) shape constancy constraint. Previous approaches to the problem ei...

Constraint-based local search is an important paradigm in the field of constraint programming, particularly when considering very large optimisation problems. We are motivated by applications in areas such as telecommunications network design, warehouse location and other problems in which we wish to select an optimal set of locations from a two dimensional plane. The problems we are interested...

Briefly, the algorithm starts by specifying no constraints (step 1 of Algorithm 1: W is initialized to the null set). At each iteration, it adds a single constraint, which corresponds to the most violated ranking (step 4 of Algorithm 1: solving problem (1)). Intuitively, problem (1) finds a ranking that differs significantly from the ground-truth ranking in terms of AP but has a high score. Hav...