Introduction
Fink and Mao define a knot as “a sequence of moves creating an aesthetic structure or topology, where its properties are preserved under continuous deformations” [1]. Thus, it is possible to emulate a random search behavior [5], using a set of steps that represents a knot. However, a single knot is not enough to cover a specific area, due to this lack of coverage, we suggest link several knots in order to increase the searching scope.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fink, T., Mao, Y.: Tie knots, random walks and topology. Physica A 276, 109–121 (2000)
Livingston, C.: Knot theory. The Mathematical Association of America (1993)
Fink, T.M., Mao, Y.: Designing Tie Knots by Random Walks. Nature 398, 31 (1999)
Wilensky, U.: Netlogo, center for connected learning and computer-based modeling (1999), http://ccl.northwestern.edu/netlogo
Berg, H.C.: Random walks in biology. Princeton University Press, Princeton (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pina-Garcia, C.A., Gu, D. (2011). Using Sequences of Knots as a Random Search. In: Groß, R., Alboul, L., Melhuish, C., Witkowski, M., Prescott, T.J., Penders, J. (eds) Towards Autonomous Robotic Systems. TAROS 2011. Lecture Notes in Computer Science(), vol 6856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23232-9_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-23232-9_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23231-2
Online ISBN: 978-3-642-23232-9
eBook Packages: Computer ScienceComputer Science (R0)