Abstract: Optimum of sensor location is an important research field in testability design, and it is a new attempt to use shuffled frog leaping algorithm for optimum of sensor location. Considering the optimal problem of sensor location is set in a space featuring discrete, a discrete shuffled frog leaping algorithm was proposed, and the change in position was redefined discretely. To avoid converging too fast, the algorithm was improved. Chaos optimization algorithm was used to optimize the best solution in the form of probability. An example and simulation results were provided to verify the effcctivcncss and practicability of this approach.

Key words: Optimum of sensor location, Shuffled frog leaping algorithm, Chaos optimization algorithm