Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.06252

The configuration space of a robotic arm over a graph

Derric Denniston·Robert Muth·Vikram Singh
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the configuration space $\mathcal{S}_{G,b,\ell}$ associated with the movement of a robotic arm of length $\ell$ on a grid over an underlying graph $G$, anchored at a vertex $b \in G$. We study an associated PIP (poset with inconsistent pairs) $\text{IP}_{G,b,\ell}$ consisting of indexed paths on $G$. This PIP acts as a combinatorial model for the robotic arm, and we use $\text{IP}_{G,b,\ell}$ to show that the space $\mathcal{S}_{G,b,\ell}$ is a CAT(0) cubical complex, generalizing work of Ardila, Bastidas, Ceballos, and Guo. This establishes that geodesics exist within the configuration space, and yields explicit algorithms for moving the robotic arm between different configurations in an optimal fashion. We also give a tight bound on the diameter of the robotic arm transition graph (the maximal number of moves necessary to change from one configuration to another) and compute this diameter for a large family of underlying graphs $G$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Derric Denniston, Robert Muth, Vikram Singh. 2021-11-11. The configuration space of a robotic arm over a graph. https://arxiv.org/abs/2111.06252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗