Abstract
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.
This paper introduces novelty search evolutionary algorithm to swarm robots multi-objective obstacle avoidance problem in order to overcome deception and reach better solutions.
This work could teach robots how to move in different environments with 2.5% obstacles coverage while keeping their connectivity more than 82%. Percentage of robots reached the goal was more than 97% in 70% of the environments and more than 90% in the rest of the environments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
Hettiarachchi, S., Spears, W., Spears, D.: Physicomimetics, chapter 14, pp. 441–473. Springer, Heidelberg (2011)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rezk, N.M., Alkabani, Y., Bedour, H., Hammad, S. (2015). Swarm Robotics Obstacle Avoidance: A Progressive Minimal Criteria Novelty Search-Based Approach. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_49
Download citation
DOI: https://doi.org/10.1007/978-3-319-23485-4_49
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23484-7
Online ISBN: 978-3-319-23485-4
eBook Packages: Computer ScienceComputer Science (R0)