a significant impact on the convergence effect. In
intelligent optimization algorithms, the parallel
general network based on RBF neural network and
BP neural network solves IK problems faster than
algebraic methods, and has strong real-time
performance (Biswal, and Mohanty 2021). However,
when neural networks are applied to robots with
different configurations, it is necessary to retrain the
network, resulting in a weak generalization ability.
The hybrid genetic algorithm introduces the concepts
of exploration and development, using real-coded
HGA and binary competition selection operators to
evaluate multiple inverse kinematics solutions of
articulated and Puma manipulators (Schreiber, and
Gosselin 2022). However, genetic algorithms have a
complex structure and a large amount of computation,
which weakens the real-time performance of IK
problem solving. The hybrid algorithm of the multi-
directional exploration feedback strategy, Tianniuxu
and genetic algorithm, increases the search ability of
the algorithm, but also increases the computational
complexity of the algorithm when exploring different
directions. Artificial bee colony algorithm for solving
inverse kinematics problems of redundant robot arms
has the characteristics of good robustness and strong
global optimization ability (Zhou, Yu et al. 2021).
However, this method has a complex structure and
weak local optimization ability.
In fact, the Tianniu whisker algorithm (BAS) is an
intelligent optimization algorithm based on
individuals. Since there is only a single Tianniu
during the iteration, it is lower in time and space
complexity than the swarm intelligence algorithm,
and its efficiency is also higher.
However, traditional BAS has the characteristics
of low convergence speed and strong oscillation
during the convergence process, which reduces the
accuracy of the results and is difficult to meet the real-
time and accuracy requirements of the inverse
kinematics solution process for a 12 degree of
freedom quadruped robot (Zhang, Zhu, et al. 2021).
2 RELATED WORKS
2.1 Current Research Status of
Longicorn Whisker Search
Algorithm in China
Based on imitating the predatory behavior of
longicorn beetles in nature, Jiang Xiangyuan
proposed a bionic intelligent optimization algorithm
with meta heuristics, high randomness, and fast
convergence in 2017, called the Beetle Antennae
Search Algorithm (BAS). In nature, the predation of
longicorn beetles mainly relies on the antennae
distributed on both sides of the head. The odor
receptors in the antennae sense the concentration of
pheromones emitted by prey in the air (Chandan,
Shah, et al. 2021). When the odor receptors sense
both sides! When there is a difference in the
pheromone concentration of the antennae, the
longicorn beetle will move a certain distance towards
the side with the higher pheromone concentration,
thereby repeatedly approaching the target and finally
finding food.
Over time, many researchers have conducted in-
depth research on longicorn whisker search
algorithms and applied them to multiple research
fields such as parameter tuning, power scheduling,
neural network pre training, and path planning. In his
paper, Associate Professor Jiang Xiangyuan used the
proposed longicorn whisker search algorithm to
conduct simulation tests on the Michalewicz test
function and the Goldstein Price test function from
the perspective of convergence and local minimum
avoidance (Zohour, Belzile, et al. 2021). The test
results show that the longicorn whisker search
algorithm can complete accurate numerical
optimization after fewer search iterations.
Subsequently, Jiang Xiangyuan et al. proposed a
BAS-WPT (BAS-Without Parameter Tuning)
algorithm that does not require parameter adjustment
for the optimized object, and further expanded the
Tianniu whisker search algorithm to the field of
multi-objective optimization. BAS-WPT algorithm
uniformly maps the optimized parameters of different
orders of magnitude and different value ranges to the
same constraint range by normalizing the optimized
parameters, simplifying the time and computational
complexity of parameter tuning to a certain extent,
and using the penalty function to deal with inequality
constraint problems, also improving the optimization
ability of the Taurus whisker search algorithm in
multi-objective optimization problems (He, Shao, et
al. 2021). Dangke et al. 185 further improved the step
attenuation strategy in the original longicorn whisker
search algorithm and proposed a variable step
longicorn whisker search strategy, taking into account
the convergence speed and accuracy of the algorithm.
Since its introduction, the Tianniu whisker search
algorithm has attracted the attention of many
researchers. Due to its advantages such as small
computational complexity, strong randomness, rapid
convergence, and simple optimization strategies, the
Tianniu whisker search algorithm has been applied
and recognized in many aspects of the optimization