  We prove that the topological complexity of (a motion planning algorithm on)
the complement of generic complex essential hyperplane arrangement of $n$
hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
