  In this paper, we continue the study of locating-paired-dominating set,
abbreviated LPDS, in graphs introduced by McCoy and Henning. Given a finite or
infinite graph $G=(V,E)$, a set $S\subset V$ is paired-dominating if the
induced subgraph $G[S]$ has a perfect matching and every vertex in $V$ is
adjacent to a vertex in $S$. The other condition for LPDS requires that for any
distinct vertices $u,v \in V\backslash S$, we have $N(u)\cap S\neq N(v)\cap S$.
Motivated by the conjecture of Kinawi, Hussain and Niepel, we prove the minimal
density of LPDS in the king grid is between $8/37$ and $2/9$, and we find
uncountable many different LPDS with density $2/9$ in the king grid. These
results partially solve their conjecture.
