Let $0 < c < 2/(n-1)$. For $p_1,...,p_n \in \mathbb{R}^2$, consider the property $$ |p_{k+1}-p_k| = c, \ k=1,...,n-1 \tag 1 $$ where $| \cdot |$ is the Euclidean distance. Denote $C_k$ for the unit circle centered at $p_k, \ k=1,...,n$.
$\textbf{Question}$: For what geometric configuration of $p_1,...,p_n \in \mathbb{R}^2$ satisfying $(1)$ is the area of $C_1 \cap \cdots \cap C_n$ minimized? (note $c$ is fixed)
Comment: I've been trying to prove the solution is a straight line, as it appears to lead to a solution for the following: if you are placed at a random position in a circle, which path minimizes the average time it takes for you to escape the circle? (something I really want to solve)
$\textbf{Update} \ (2/19)$: I solved the alternate question, that the area of $C_1 \cup \cdots \cup C_n$ is maximized when $p_k$ are in line. The proof is below.
Write $\mu(A)$ for the area of a set $A$. Write $B_1 = C_1 \cup \cdots \cup C_{n-1}$ and $B_2 = C_2 \cup \cdots \cup C_n$. Then
\begin{align}
\mu(C_1 \cup \cdots \cup C_n) &= \mu(B_1 \cup B_2) \\
&= \mu(B_1) + \mu(B_2) - \mu(B_1 \cap B_2) \\
&= \mu(B_1)+\mu(B_2) - \mu\big((C_1 \cap C_n) \cup (C_2 \cup \cdots \cup C_{n-1})\big) \\
&\leq \mu(B_1) + \mu(B_2) - \mu(C_2 \cup \cdots \cup C_{n-1}) \tag 2 \\
&= \mu(B_1 \backslash (C_2 \cup \cdots \cup C_{n-1})) + \mu (B_2) \\
&= \mu(C_1 \backslash (C_2 \cup \cdots \cup C_{n-1})) + \mu(B_2) \\
&\leq \mu(C_1 \backslash C_2) + \mu(B_2) \tag 3
\end{align}
We will now prove by induction $\mu(C_1 \cup \cdots \cup C_n)$ is maximized when $p_k$ are in a sequential line. For case $n=3$, notice $\mu(B_1)$ and $\mu(B_2)$ only depend on $c$, therefore are constant. Let $p_1, p_2, p_3$ be in a line. One can prove with law of consines that $C_1 \cap C_3 \subset C_2$. So equality holds at $(2)$, which shows the result.
For case $n > 3$, assume case $n-1$ holds. Let $p_1,...,p_n$ be in a line. By the induction hypothesis, $\mu(B_2)$ is maximized. $\mu(C_1 \backslash C_2)$ only depends on $c$, so is constant. So $(3)$ is maximized. Also, by law of cosines one can show $C_1 \cap C_n \subset C_2 \cup \cdots \cup C_{n-1}$ and $C_1 \backslash C_2 = C_1 \backslash (C_2 \cup \cdots \cup C_n)$. So equality holds at $(2)$ and $(3)$. This proves case $n$.