Minimum cost open chain reconfiguration

DOI10.1016/j.dam.2011.05.005zbMath1251.49035OpenAlexW2058213503MaRDI QIDQ642965

Mohammadreza Razzazi, Ali Nourollah

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

zbMATH Keywords

dynamic programmingopen chain reconfigurationrobot reconfigurationruler folding problem

Mathematics Subject Classification ID

Related Items (1)

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

Cites Work

• New algorithms for multilink robot arms
• Motions of a short-linked robot arm in a square
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• When can a net fold to a polyhedron?
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions
• Reaching a Point with an Unanchored Robot Arm in a Square
• Unnamed Item
• Unnamed Item

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