3 problems

A framework $(\mathcal{G},p)$ in $\mathbb{R}^2$ is infinitesimally angle rigid if its infinitesimal angle constraints determine its realizations up to the relevant trivial motions,…

Let Algorithm … will continue to be a function of the degree of each node. The surrounding analysis establishes finite-time termination in the cases considered, but the general wor…

Global stabilizability conjecture. Formation-control problems whose objective is minimally rigid and whose underlying $\delta$-graph has no vertex with outvalence larger than two s…