Abstract
In this paper, an indexed K-D tree is proposed to solve the problem of neighborhoods generation in swarm robotic simulation. The problem of neighborhoods generation for both robots and obstacles can be converted as a set of range searches to locate the robots within the sensing areas. The indexed K-D tree provides an indexed structure for a quick search for the robots’ neighbors in the tree generated by robots’ positions, which is the most time consuming operation in the process of neighborhood generation. The structure takes full advantage of the fact that the matrix generated by robots’ neighborhoods is symmetric and avoids duplicated search operations to a large extent. Simulation results demonstrate that the indexed K-D tree is significantly quicker than normal K-D tree and other methods for neighborhood generation when the population is larger than 10.
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.
References
Shi, Z., Tu, J., Zhang, Q., Liu, L., Wei, J.: A survey of swarm robotics system. In: Tan, Y., Shi, Y., Ji, Z. (eds.) ICSI 2012, Part I. LNCS, vol. 7331, pp. 564–572. Springer, Heidelberg (2012)
Michel, O.: Webotstm: Professional mobile robot simulation. arXiv preprint cs/0412052 (2004)
Vaughan, R.: Massively multi-robot simulation in stage. Swarm Intelligence 2(2), 189–208 (2008)
Pinciroli, C.: The swarmanoid simulator. Technical report. Citeseer (2007)
Bentley, J.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9), 509–517 (1975)
Arroyuelo, D., Claude, F., Dorrigiv, R., Durocher, S., He, M., López-Ortiz, A., Ian Munro, J., Nicholson, P., Salinger, A., Skala, M.: Untangled monotonic chains and adaptive range search. Theoretical Computer Science 412(32), 4200–4211 (2011)
Pan, Y., Lin, W., Wang, Y., Lee, K.: Computing multiscale entropy with orthogonal range search. Journal of Marine Science and Technology 19(1), 107–113 (2011)
Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time kd-tree construction on graphics hardware. ACM Transactions on Graphics (TOG) 27, 126 (2008)
Wald, I., Havran, V.: On building fast kd-trees for ray tracing, and on doing that in o (n log n). In: IEEE Symposium on Interactive Ray Tracing 2006, pp. 61–69. IEEE (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Z., Tan, Y. (2013). An Indexed K-D Tree for Neighborhood Generation in Swarm Robotics Simulation. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38715-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38714-2
Online ISBN: 978-3-642-38715-9
eBook Packages: Computer ScienceComputer Science (R0)