Swarm Robotics Obstacle Avoidance: A Progressive Minimal Criteria Novelty Search-Based Approach

详细信息    查看全文

• 关键词：Maintaining formation ; Novelty search ; Obstacle avoidance
• 刊名：Lecture Notes in Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：9273
• 期：1
• 页码：493-498
• 全文大小：165 KB
• 参考文献：1.Lehman, J., Stanley, K.: Improving evolvability through novelty search and self-adaptation. In: Proceedings of the 2011 IEEE Congress on Evolutionary Computation (CEC), Piscataway, NJ, US (2011)
  2.Lehman, J., Stanley, K.: Revising the evolutionary computation abstraction: minimal criteria novelty search. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), New York, US (2010)
  3. Gomes, J., Urbano, P., Christensen, A.L.: Progressive minimal criteria novelty search. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds.) IBERAMIA 2012. LNCS, vol. 7637, pp. 281–290. Springer, Heidelberg (2012)
  4.Hettiarachchi, S., Spears, W., Spears, D.: Physicomimetics, chapter 14, pp. 441–473. Springer, Heidelberg (2011)
  5.Prabhu, S., Li, W., McLurkin, J.: Hexagonal lattice formation in multi-robot systems. In: 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2012)
  6. Cuccu, G., Gomez, F.: When novelty is not enough. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ekárt, A., Esparcia-Alcázar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 234–243. Springer, Heidelberg (2011)
  7.Rezk, N., Alkabani, Y., Bedour, H., Hammad, S.: A distributed genetic algorithm for swarm robots obstacle avoidance. In: IEEE 9th International Conference on Computer Engineering and Systems (ICCES), Cairo, Egypt (2014)
  
• 作者单位：Nesma M. Rezk (8)
  Yousra Alkabani (8)
  Hassan Bedour (8)
  Sherif Hammad (8)
  
  8. Computer and Systems Department Faculty of Engineering, Ain Shams University, Cairo, Egypt
  
• 丛书名：Progress in Artificial Intelligence
• ISBN：978-3-319-23485-4
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

Swarm robots are required to explore and search large areas. In order to cover largest possible area while keeping communications, robots try to maintain hexagonal formation while moving. Obstacle avoidance is an extremely important task for swarm robotics as it saves robots from hitting objects and being damaged.