Skip to main content
SpringerLink
Log in

Using Sequences of Knots as a Random Search

  • Conference paper
Book cover Towards Autonomous Robotic Systems (TAROS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6856))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fink, T., Mao, Y.: Tie knots, random walks and topology. Physica A 276, 109–121 (2000)

    Article  Google Scholar 

  2. Livingston, C.: Knot theory. The Mathematical Association of America (1993)

    Google Scholar 

  3. Fink, T.M., Mao, Y.: Designing Tie Knots by Random Walks. Nature 398, 31 (1999)

    Article  Google Scholar 

  4. Wilensky, U.: Netlogo, center for connected learning and computer-based modeling (1999), http://ccl.northwestern.edu/netlogo

  5. Berg, H.C.: Random walks in biology. Princeton University Press, Princeton (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK

    C. A. Pina-Garcia & Dongbing Gu

Authors
  1. C. A. Pina-Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongbing Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

  2. Materials and Engineering Research Institute, Sheffield Hallam University, City Campus, Horward Street, S1 1WB, Sheffield, UK

    Lyuba Alboul  & Jacques Penders  & 

  3. Department of Computing, Engineering and Mathematical Sciences, Bristol Robotics Laboratory (BRL), University of Bristol and the West of England, Bristol Business Park, BS16 1QD, Bistol, UK

    Chris Melhuish

  4. Department of Electrical and Electronic Engineering, Imperial College London, Exhibition Road, SW7 2BT, London, UK

    Mark Witkowski

  5. Department of Psychology, The University of Sheffield, Wstern Bank, S10 2TN, Sheffield, UK

    Tony J. Prescott

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation