Pheromone Accumulation and Iteration

  • Wenfeng WangEmail author
  • Xiangyang Deng
  • Liang Ding
  • Limin Zhang
Part of the Research on Intelligent Manufacturing book series (REINMA)


In this chapter, the robot path-planning problem is explored under the vision–brain hypothesis, and meanwhile, the pheromone accumulation and iteration mechanisms and processes are explicitly illustrated. Based on the hypothesis, robots can recognize obstacles, and therefore, to solve the robot path-planning problem, it remains to decide the optimal path to the targets or the regions of interest. Differing from most studies on the robot path planning, the significance of pheromone paths (sub-paths) in full path generation is emphasized, employing the ant colony algorithm, where pheromone updates are directed through calculating the passed ants of the sub-paths in each iteration. This algorithm can be further improved by placing pheromone on the nodes to improve the efficiency of the pheromone storage and updates, where the ant colony (a series of pheromone points) becomes a pheromone trace. Utilizing localization rules and one-step optimization rules for local optimization, the time to construct the first complete solution can be shorten and a better solution of the problem of the robot path planning can be generated by establishing a mesh model of the navigation area with determined obstacles. Utilizing the locally compressive sensing algorithm in Chap.  2 and selecting a behavior-sensitive area for compressive tracking, machine can recognize some special global behaviors (e.g., running, falling) and local behaviors (e.g., smiles and blinking) and the recognition rate and accuracy can be ensured. The broad learning system with a vision–brain (the decision layer) introduced in Chap.  2 for face recognition is further utilized to tackling a series of challenging issues—illumination changes, expression and pose variations and occlusion problems, respectively, utilizing some representative face databases. Results show that face recognition rates in 100 times of training and testing on each database can approach to 100%, including the database with real disguise occlusion.


  1. 1.
    A. Colorni, M. Dorigo, V. Maniezzo et al., in Proceedings of the 1st European Conference on Artificial Life. Distributed optimization by ant colonies (Paris, 1991), pp. 134–142Google Scholar
  2. 2.
    M. Dorigo et al., Positive Feedback as a Search Strategy. Technical report 91-016, Department of Electronics, Politecnico diMilano, Italy, 1991Google Scholar
  3. 3.
    M. Dorigo, Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Department of Electronics, Politecnico diMilano, Italy, 1992Google Scholar
  4. 4.
    L.M. Gambardella, M. Dorigo, in Proceedings of the 12th International Conference on Machine Learning. Ant Q: a reinforcement learning approach to the traveling salesman problem (1995), pp. 252–260CrossRefGoogle Scholar
  5. 5.
    M. Dorigo, L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRefGoogle Scholar
  6. 6.
    V. Maniezzo, A. Colorni, M. Dorigo, The ant system applied to the quadratic assignment problem. Technical report IRIDIA/94-28, IRIDIA, Université Libre de Bruxelles, Belgium (1994)Google Scholar
  7. 7.
    Q.L. Gao, X. Luo, S.Z. Yang, Stigmergic cooperation mechanism for shop floor control system. Int. J. Adv. Manuf. Technol. 25(7–8), 743–753 (2005)CrossRefGoogle Scholar
  8. 8.
    A.O. Bozdogan, M. Efe, Improved assignment with ant colony optimization for multi-target tracking. Expert Syst. Appl. 38, 9172–9178 (2011)CrossRefGoogle Scholar
  9. 9.
    W. Xiang, H.P. Lee, Ant colony intelligence in multi-agent dynamic manufacturing scheduling. Eng. Appl. Artif. Intell. 21, 73–85 (2008)CrossRefGoogle Scholar
  10. 10.
    J.E. Bella, P.R. McMullen, Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18, 41–48 (2004)CrossRefGoogle Scholar
  11. 11.
    L. Wang, Q.D. Wu, in Proceedings of the IEEE Conference on Control Application. Linear system parameters identification based on ant system algorithm (2001), pp. 401–406Google Scholar
  12. 12.
    C. Blum, M. Dorigo, The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics—Part B; to appear. Also available as Technical Report TR/IRIDIA/2003-03, IRIDIA, Université Libre de Bruxelles, Belgium (2003)Google Scholar
  13. 13.
    S. Gao, J. Zhong, MO S.J., Research on ant colony algorithm for continuous optimization problem. Microcomput. Dev. 13(11), 12–13 (2003)Google Scholar
  14. 14.
    X. Chen, Y. Yuan, Novel ant colony optimization algorithm for robot path planning. Syst. Eng. Electron. 30(5), 952–955 (2008)zbMATHGoogle Scholar
  15. 15.
    Y. Abe, M. Shikann, T. Fokuda et al., in Proceedings of the IEEE International Conference on Robotics & Automation. Vision based navigation system by variable template matching for autonomous mobile robot. Leaven (1998), pp. 952–957Google Scholar
  16. 16.
    X. Deng, L. Zhang, J. Feng, An Improved Ant Colony Optimization with Subpath-Based Pheromone Modification Strategy[C]. International conference in swarm intelligence. Springer, Cham (2017)Google Scholar
  17. 17.
    X. Deng, L. Zhang, L. Luo, An improved ant colony optimization applied in robot path planning problem. J. Comput. 8 (2013).
  18. 18.
    X. Deng et al., Pheromone mark ant colony optimization with a hybrid node-based pheromone update strategy. Neurocomputing 148, 46–53 (2015)CrossRefGoogle Scholar
  19. 19.
    C.L.P. Chen, Z.L. Liu, Broad learning system: an effective and efficient incremental learning system without the need for deep architecture. IEEE Trans. Neural Netw. Learn. Syst. 29(1), 10–24 (2018)MathSciNetCrossRefGoogle Scholar
  20. 20.
    J. Tapson, A.V. Schaik, Learning the pseudoinverse solution to network weights. Neural Netw. 45(3), 94–100 (2013)CrossRefGoogle Scholar
  21. 21.
    M. Gong, J. Zhao, J. Liu, Q. Miao, L. Jiao, Change detection in synthetic aperture radar images based on deep neural networks. IEEE Trans. Neural Netw. Learn. Syst. 27(1), 125–138 (2016)MathSciNetCrossRefGoogle Scholar
  22. 22.
    J. Wright, A.Y. Yang, A. Ganesh, S.S. Sastry, Y. Ma, Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210–227 (2009)CrossRefGoogle Scholar
  23. 23.
    M. Yang, L. Zhang, in European Conference on Computer Vision. Gabor feature based sparse representation for face recognition with Gabor occlusion dictionary (2010), pp. 448–461CrossRefGoogle Scholar
  24. 24.
    M. Yang, L. Zhang, J. Yang, D. Zhang, in Proceedings of IEEE Conference Computer Vision Pattern Recognition. Robust sparse coding for face recognition (2011), pp. 625–632Google Scholar
  25. 25.
    M. Yang, L. Zhang, J. Yang, D. Zhang, Regularized robust coding for face recognition. IEEE Trans. Image Process. 22(5), 1753–1766 (2013)MathSciNetCrossRefGoogle Scholar

Copyright information

© Huazhong University of Science and Technology Press, Wuhan and Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Wenfeng Wang
    • 1
    Email author
  • Xiangyang Deng
    • 2
  • Liang Ding
    • 3
  • Limin Zhang
    • 2
  1. 1.CNITECH, Chinese Academy of SciencesInstitute of Advanced Manufacturing TechnologyNingboChina
  2. 2.Naval Aeronautical UniversityYantaiChina
  3. 3.Harbin Institute of TechnologyHarbinChina

Personalised recommendations