Locally repairable codes are a kind of new erasure codes capable of providing information repair ability for distributed storage systems. Aimed at the problem that the researches on the locally repairable codes are still insufficient in ternary field at present, a general method of constructing locally repairable codes based on cyclic codes is presented. Firstly, proceeded from the code length of cyclic codes, the corresponding 3cyclotomic cosets are calculated, and then the defining sets of each cyclic codes are determined through the combinations of cyclotomic cosets, thus determining the distance and locality of codes, and constructing the three kinds locally repairable codes reaching CadambeMazumdar (C-M) bound with 8≤n≤50. Particularly, three kinds of optimal locally repairable codes with small locality are constructed by designing the dual distance through defining sets and by using BCH boundary to filter the circular coset. The relevant construction theory of ternary locally repairable codes is further being perfected by these research results.