Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases

DOI10.1007/s40096-015-0139-8zbMath1407.68491OpenAlexW1992762571WikidataQ59319502 ScholiaQ59319502MaRDI QIDQ1992129

Zahra Nilforoushan, Keivan Borna

Publication date: 2 November 2018

Published in: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40096-015-0139-8

zbMATH Keywords

Gröbner basesreachability2-link arm

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Artificial intelligence for robotics (68T40) Solving polynomial systems; resultants (13P15)

Uses Software

• CoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some features of \(CoCoA 3\)
• DESIGNING MULTI-LINK ROBOT ARMS IN A CONVEX POLYGON
• Movement Problems for 2-Dimensional Linkages

This page was built for publication: Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases