The problem of location detection is investigated for many scenarios, such as pointing out the flaws in the multiprocessors, invaders in buildings and facilities, and utilizing wireless sensors networks for the environmental monitoring process. The system or structure can be illustrated as a graph in each of these applications, and sensors strategically placed at a subset of vertices can determine and identify irregularities within the network. The (OLD-set) that is open locating dominating set is a subset of vertices in a graph, such that every vertex within the graph is distinct and non-empty. Let $G=(V,E)$, be the graph, a set $S\subseteq V(G)$ is a $[1,2]$-OLD set if $N(i)\cap S\neq\emptyset$, for some $i\in V(G)$, and $1\leq |N(i)\cap S|\leq 2$, as well as $N(i)\cap S\neq N(j)\cap S$, for every pair of distinct vertices $i,j\in V(G)\backslash S$. The minimum cardinality of $[1,2]$-OLD set in a graph $G$ is called $[1,2]$-open locating domination number and is denoted by $\gamma^{old}_{[1,2]}$. In this paper, we compute the $[1,2]$-open locating domination number of some families of graphs.