Minimum cost open chain reconfiguration

DOI10.1016/J.DAM.2011.05.005zbMATH Open1251.49035OpenAlexW2058213503MaRDI QIDQ642965FDOQ642965

Authors: Ali Nourollah, Mohammadreza Razzazi 

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.005

Recommendations

• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• A 2-chain can interlock with an open 10-chain
• scientific article; zbMATH DE number 2080974
• scientific article; zbMATH DE number 2145225
• Geometric and computational aspects of polymer reconfiguration

zbMATH Keywords

dynamic programmingopen chain reconfigurationrobot reconfigurationruler folding problem

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• New algorithms for multilink robot arms
• Motions of a short-linked robot arm in a square
• When can a net fold to a polyhedron?
• Title not available (Why is that?)
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions
• Reaching a Point with an Unanchored Robot Arm in a Square
• The carpenter's ruler folding problem

Cited In (1)

• Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization

This page was built for publication: Minimum cost open chain reconfiguration

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