scispace - formally typeset
Open Access

Constraints solving, OPtimization, Robust INterval analysis

Reads0
Chats0
About
The article was published on 2009-01-01 and is currently open access. It has received 2 citations till now. The article focuses on the topics: Interval arithmetic.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal Article

A polynomial time local propagation algorithm for general dataflow constraint problems

TL;DR: In this paper, the authors propose a general-PDOF algorithm for multi-way dataflow constraints, which has a polynomial worst case time complexity and can solve several constraints simultaneously.
Journal Article

A constraint programming approach for Solving Rigid Geometric Systems

TL;DR: In this article, a new rigidification method using interval constraint programming (ICP) is introduced to solve geometric constraint systems, which can be used not only to efficiently implement the planning phase, but also generalize former ad hoc solving techniques.
References
More filters
Book

Parallel Robots

TL;DR: This book presents a complete synthesis of the latest results on the possible mechanical architectures, analysis and synthesis of this type of mechanism, Parallel robots, which are becoming increasingly popular in the field of machine-tool industry.
Journal ArticleDOI

Solving the Forward Kinematics of a Gough-Type Parallel Manipulator with Interval Analysis:

TL;DR: An efficient algorithm based on interval analysis that allows us to solve the forward kinematics, i.e., to determine all the possible poses of the platform for given joint coordinates, which is competitive in term of computation time with a real-time algorithm such as the Newton scheme, while being safer.
Journal ArticleDOI

Choosing Measurement Poses for Robot Calibration with the Local Convergence Method and Tabu Search

TL;DR: An algorithm based on a constrained optimization method, which allows us to choose a set of measurement configurations by selecting iteratively one pose after another inside the workspace, which maximizes an index of observability associated with the identification Jacobian is proposed.
Journal ArticleDOI

A Hybrid Bounding Method for Computing an Over-Approximation for the Reachable Set of Uncertain Nonlinear Systems

TL;DR: This paper shows how to compute an over-approximation for the reachable set of uncertain nonlinear continuous dynamical systems by using guaranteed set integration by using state-of-the-art validated numerical integration methods.
Journal ArticleDOI

Bounds on Real Eigenvalues and Singular Values of Interval Matrices

TL;DR: The aim is to develop fast computable formulae that produce as-sharp-as-possible bounds on real eigenvalues of interval matrices, and the various approaches are illustrated and compared by a series of examples.
Related Papers (5)