Considering that most of the actual location practice is in a Euclidean plane，this paper studied the constraint mathematical model of online median location problem on the Euclidean plane under the general metric model．By analyzing the structural properties of this problem，this paper designed a polynomial-time competitive algorithm with proven good constant competitive ratio．