A branch and prune algorithm for the computation of generalized aspects of parallel robots

DOI10.1016/j.artint.2014.02.001zbMath1405.68384WikidataQ57086171 ScholiaQ57086171MaRDI QIDQ2453696

Alexandre Goldsztejn, Stéphane Caro, Daisuke Ishii, Damien Chablat, Christophe Jermann

Publication date: 10 June 2014

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

singularitiesparallel robotsnumerical constraintsgeneralized aspects

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (3)

Robot workspace approximation with modified bicentered Krawczyk method ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Exclusion regions for parameter-dependent systems of equations

Uses Software

• INTLAB
• RealPaver
• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval-based projection method for under-constrained numerical systems
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
• Networks of constraints: Fundamental properties and applications to picture processing
• Guaranteeing the homotopy type of a set defined by non-linear inequalities
• Type synthesis of parallel mechanisms
• Parallel robots.
• Algorithm 852
• Solving Polynomial Systems Using a Branch and Prune Approach
• Path planning using intervals and graphs

This page was built for publication: A branch and prune algorithm for the computation of generalized aspects of parallel robots