A real-time immune planning algorithm incorporating a specific immune mechanism for multi-robots in complex environments

Abstract

To solve the real-time path planning of multi-robots in complex environments, a new immune planning algorithm incorporating a specific immune mechanism is presented. In the immune planning algorithm incorporating a specific immune mechanism, a new coding format for an antibody is first defined according to the impact of the obstacle distribution on the obstacle avoidance behaviors of multi-robots. Then, a new robot immune dynamic model for antibody selection is designed in terms of different impacts of obstacles and targets on robot behaviors. Finally, aiming at the local minimum problem in complex environments and inspired by the specific immune mechanism, a series of appropriate avoidance behaviors are selected through the calculation of a specific immune mechanism to help robots walk out of local minima. In addition, to solve deadlock situations, a learning strategy for the antibody concentration is presented. Compared with four related immune planning algorithms—an improved artificial potential field, a rapidly exploring random tree algorithm, a D* algorithm and a A* algorithm—the simulation results in four static environments show that the paths planned by immune planning algorithm incorporating a specific immune mechanism are the shortest and the path smoothness is generally the highest, which shows its strong planning capability in multi-obstacle environments. The simulation result in a dynamic environment with local minima shows that the immune planning algorithm incorporating a specific immune mechanism has strong planning ability in dynamic obstacle avoidance and in escaping from local minima. Additionally, an experiment in a multi-robot environment shows that two robots can not only avoid static obstacles but also avoid dynamic obstacles, which further supports the validity of the proposed immune planning algorithm incorporating a specific immune mechanism for multi-robots in real environments.

Keywords

Path planning multi-robots specific immune local minima immune network

Get full access to this article

View all access options for this article.

References

Viet

Dang

Laskar

. BA: an online complete coverage algorithm for cleaning robots. Appl Intell 2013; 39(2): 217–235.

Tuncer

Yildirim

. Dynamic path planning of mobile robots with improved genetic algorithm. Comput Electr Eng 2012; 38(6): 1564–1572.

Raza

Haider

. Path planning in robocup soccer simulation 3D using evolutionary artificial neural network. Lect Notes Comput Sc 2013; 7929: 342–350.

Shi

Hua

. Mobile robot dynamic path planning based on artificial potential field approach. Adv Mat Res 2012; 490: 994–998.

Shen

Jiang

Yuan

. A novel immune algorithm for mobile robot path planning based on multi-population competition. In: Proceedings of the sixth international conference on advanced computational intelligence, Hangzhou, China, 19–21 October 2013, pp.266–271. Piscataway, NJ: IEEE Press.

Wang

Zhuan

. An immunity algorithm for path finding and optimizing of the moving robot. J Syst Simul 2002; 14(8): 995–997.

Zhuang

Wang

. Further study of robot path planning algorithm based on artificial immune net theory. J Syst Simul 2004; 16(5): 1017–1019.

Whitbrook

Gainham

Chen

. An idiotypic network approach to task allocation in the multi-robot domain: use of an artificial immune system to moderate the greedy solution. In: Proceedings of the 4th international conference on agents and artificial intelligence, Algarve, 6–8 February 2012, pp.5–14. Piscataway, NJ: IEEE Press.

Ishiguro

Watanabe

Uchikawa

. An immunological approach to dynamic behavior control for autonomous mobile robots. In: Proceedings of the 1995 IEEE/RSJ international conference on intelligent robots and systems, Pittsburgh, PA, 5–9 August 1995, pp.495–500. Piscataway, NJ: IEEE Press.

10.

Deng

. Improved poly-clonal artificial immune network for multi-robot dynamic path planning. In: Proceedings of the 2013 IEEE international conference on information & automation, Yinchuan, China, 26–28 August 2013, pp.128–133. Piscataway, NJ: IEEE Press.

11.

Yuan

Zhang

. A new artificial immune network model for mobile robot path planning. Appl Mech Mater 2013; 416: 757–761.

12.

Yuan

Zhang

. A novel mutual-coupled immune network algorithm with the characteristic of memory for mobile robot path planning. Inform Technol J 2013; 12(9): 1755–1763.

13.

Wang

. Model of immune agent and application in path finding of autonomous robots. In: Proceedings of the second international conference on machine learning and cybernetics, Xi’an, China, 2–5 November 2003, pp.1961–1964. Piscataway, NJ: IEEE Press.

14.

Guo

Zhu

. Rapid-exploring random tree algorithm for path planning of robot based on grid method. J Nanjing Norm Univ 2007; 7(2): 58–61.

15.

Stentz

. The focussed D* algorithm for real-time replanning. In: Proceedings of the 14th international joint conference on artificial intelligence, Montreal, QC, Canada, 20–25 August 1995, pp.1652–1659. Piscataway, NJ: IEEE Press.

16.

Yao

Lin

Xie

. Path planning for virtual human motion using improved A* algorithm. In: Proceedings of the 2010 seventh international conference on information technology, Las Vegas, NV, 12–14 April 2010, pp.1154–1158. Piscataway, NJ: IEEE Press.

17.

Couceiro

Vargas

Rocha

. Bridging the reality gap between the Webots simulator and e-puck robots. Robot Auton Syst 2014; 62(10): 1549–1567.

18.

Zeng

Zhang

. Video image mosaic implement based on planar-mirror-based catadioptric system. Signal Image Video Process 2014; 8(6): 1007–1014.

19.

Yuan

Zhao

Hua

. Research on visual segmentation and localization of multi-robots under different lighting conditions. J Syst Contr Eng 2015; 229(9): 838–850.