We prove that every n-vertex oriented path admits an upward planar embedding on every general set of points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].