Orthodontic path planning method based on optimized artificial bee colony algorithm

Aiming at the orthodontic path planning problems, for example, the number is estimated by orthodontists based on experience, and the efficiency of tooth movement path planning on computer is low. This paper proposed a teeth movement path planning method based optimized artificial bee colony algorith...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1544; no. 1; pp. 12017 - 12028
Main Authors Li, Zhanli, Liu, Tongxin, Li, Hong-An, Sun, Zhihao
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.05.2020
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Aiming at the orthodontic path planning problems, for example, the number is estimated by orthodontists based on experience, and the efficiency of tooth movement path planning on computer is low. This paper proposed a teeth movement path planning method based optimized artificial bee colony algorithm (ABC). At first, according to the age and gender of patients, the constraint amount of tooth movement is automatically determined. Second, by optimizing the observation bees select method, using both roulette and anti-roulette mechanisms replaced roulette mechanisms, this method can avoid the population from falling into local optimality and obtain better distribution. Then, the initial stage number is obtained through interpolation, and combined with the initial food source generation strategy in ABC. Finally, this paper uses the optimized ABC to plan the teeth movement path and obtain the actual amount of orthodontic stages. The experimental result shows that the optimized ABC has better distribution than basic ABC, and the proposed method is closer to clinical orthodontic, reduced the workload of the orthodontist. The data shows this method is more suitable for different patient situations, reduced the orthodontic stage number and the cost of teeth movement effectively.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1544/1/012017