2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/122056We 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\}$.Geometric TopologyCombinatorics52C35, 55R80text