Patents by Inventor Lidian LIANG

Lidian LIANG has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method for planning screw locking path using ant colony algorithm
    Patent number: 11195266
    Abstract: Disclosed is a method for planning screw locking path using an ant colony algorithm, which includes: obtaining designated positions of screw holes to be locked; using a distance between the screw holes to be locked as pheromone; obtaining a set of initial paths for all lockings; determining whether a condition for ending an iteration is met, and the condition is whether all the locking paths have passed through all the designated positions; if the condition for ending the iteration is not met, obtaining a supplementary path for each locking path to form an entire path of each locking path until the condition for ending the iteration is met; taking a set of entire paths of all the locking paths as a set of final paths; obtaining a shortest path from the set of final paths.
    Type: Grant
    Filed: June 10, 2020
    Date of Patent: December 7, 2021
    Assignee: Wuyi University
    Inventors: Shufen Liang, Huimin Xie, Fangchen Yang, Hui Huang, Guanhua Zou, Shufeng Huang, Baisheng Li, Peiran Liang, Zeming Wu, Lintao Zhu, Xiaoming Li, Lidian Liang, Chen Chen
  • METHOD FOR PLANNING SCREW LOCKING PATH USING ANT COLONY ALGORITHM
    Publication number: 20200394782
    Abstract: Disclosed is a method for planning screw locking path using an ant colony algorithm, which includes: obtaining designated positions of screw holes to be locked; using a distance between the screw holes to be locked as pheromone; obtaining a set of initial paths for all lockings; determining whether a condition for ending an iteration is met, and the condition is whether all the locking paths have passed through all the designated positions; if the condition for ending the iteration is not met, obtaining a supplementary path for each locking path to form an entire path of each locking path until the condition for ending the iteration is met; taking a set of entire paths of all the locking paths as a set of final paths; obtaining a shortest path from the set of final paths.
    Type: Application
    Filed: June 10, 2020
    Publication date: December 17, 2020
    Inventors: Shufen Liang, Huimin XIE, Fangchen YANG, Hui HUANG, Guanhua ZOU, Shufeng HUANG, Baisheng LI, Peiran LIANG, Zeming WU, Lintao ZHU, Xiaoming LI, Lidian LIANG, Chen CHEN