Optimization algorithm for approximating the solutions set of nonlinear inequalities systems in the problem of determining the robot workspace

DOI10.1007/978-3-030-65739-0_3MaRDI QIDQ6130867zbMATH OpenFDO

Authors

Publication date 3 April 2024

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-65739-0_3

zbMATH Keywords

non-uniform coveringoptimization algorithmparallel robotrobot workspace

Mathematics Subject Classification ID

Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• Finding sets of solutions to systems of nonlinear inequalities
• Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
• Robot workspace approximation with modified bicentered Krawczyk method
• Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
• Approximating a solution set of nonlinear inequalities

Cites work

• Approximating a solution set of nonlinear inequalities
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• Type synthesis of parallel mechanisms

Cited in

(3)

• Robot workspace approximation with modified bicentered Krawczyk method
• Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
• Bicentered interval Newton operator for Robot's workspace approximation

This page was built for publication: Optimization algorithm for approximating the solutions set of nonlinear inequalities systems in the problem of determining the robot workspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130867)