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

DOI10.1007/S40096-015-0139-8zbMATH Open1407.68491OpenAlexW1992762571WikidataQ59319502 ScholiaQ59319502MaRDI QIDQ1992129FDOQ1992129

Authors: 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

Recommendations

• New algorithms for multilink robot arms
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions
• On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
• DESIGNING MULTI-LINK ROBOT ARMS IN A CONVEX POLYGON
• Movement Problems for 2-Dimensional Linkages

zbMATH Keywords

reachability2-link armGröbner bases

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)

Cites Work

• Some features of \(CoCoA 3\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Movement Problems for 2-Dimensional Linkages
• DESIGNING MULTI-LINK ROBOT ARMS IN A CONVEX POLYGON

Uses Software

• CoCoA

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

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