A branch and prune algorithm for the computation of generalized aspects of parallel robots
From MaRDI portal
Publication:2453696
Recommendations
- Parallel robots
- New algorithm for the identification and analysis of the parallel robots singularities
- Obtaining configuration space and singularity maps for parallel manipulators
- Robots, computer algebra and eight connected components
- Workspace generation and planning singularity-free path for parallel manipulators
Cites work
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Algorithm 852
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Guaranteeing the homotopy type of a set defined by non-linear inequalities
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Interval-based projection method for under-constrained numerical systems
- Networks of constraints: Fundamental properties and applications to picture processing
- Parallel robots.
- Path planning using intervals and graphs
- Solving Polynomial Systems Using a Branch and Prune Approach
- Type synthesis of parallel mechanisms
Cited in
(5)- Exclusion regions for parameter-dependent systems of equations
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Robot workspace approximation with modified bicentered Krawczyk method
- Bicentered interval Newton operator for Robot's workspace approximation
- Application of interval slopes in nonsmooth one-dimensional optimization problems
This page was built for publication: A branch and prune algorithm for the computation of generalized aspects of parallel robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453696)