Skip to main content
SpringerLink
Log in

Continuous Local Strategies for Robotic Formation Problems

  • Conference paper
Experimental Algorithms (SEA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7276))

Included in the following conference series:

Abstract

We consider a scenario with a team of autonomous mobile robots which are placed in the plane. Their goal is to move in such a way that they eventually reach a prescribed formation. Such a formation may be a straight line between two given endpoints (Robot Chain Problem), a circle or any other geometric pattern, or just one point (Gathering Problem). In this survey, we assume that there is no central control that guides the robot’s decisions, thus the robots have to self-organize in order to accomplish global tasks like the above-mentioned formation problems. Moreover, we restrict them to simple local strategies: the robots are limited to “see” only robots within a bounded viewing range; their decisions where to move next are solely based on the relative positions of robots within this range. Most strategies for these type of problems assume a discrete time model, i.e., time is divided into rounds, in a round, each robot moves to some target point defined by the observations of its environment.

In this talk, we focus on a much less examined class of local strategies, namely continuous strategies. Here, each robot continuously observes his environment and continuously adapts its speed and direction to these observations. focus on these type of strategies and survey recent results on local strategies for short robot chains and gathering in the continuous time model. We present such strategies for the Robot Chain and the Gathering Problem and analyze them w.r.t. the distance traveled by the robots. For both problems, we survey bounds for the “price of locality”, namely the ratio between the cost of our local algorithms and the optimal cost assuming global view, for each individual start configuration.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Degener, B., Kempkes, B., Kling, P., Meyer auf der Heide, F.: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 168–182. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Dynia, M., Kutylowski, J., Lorek, P., Meyer auf der Heide, F.: Maintaining Communication Between an Explorer and a Base Station. In: IFIP 19th World Computer Congress, TC10: 1st IFIP International Conference on Biologically Inspired Computing (BICC 2006), pp. 137–146 (2006)

    Google Scholar 

  3. Kutylowski, J., Meyer auf der Heide, F.: Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science 410(36), 3391–3405 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dynia, M., Kutylowski, J., Meyer auf der Heide, F., Schrieb, J.: Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station. In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 260–269. ACM Press, New York (2007)

    Chapter  Google Scholar 

  5. Kling, P., Meyer auf der Heide, F.: Convergence of Local Communication Chain Strategies via Linear Transformations. In: SPAA 2011: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, pp.159–166 (2011)

    Google Scholar 

  6. Défago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: Proceedings of the 2002 Workshop on Principles of Mobile Computing, POMC 2002, pp. 97–104 (2002)

    Google Scholar 

  7. Chatzigiannakis, I., Markou, M., Nikoletseas, S.E.: Distributed Circle Formation for Anonymous Oblivious Robots. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 159–174. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Meyer auf der Heide, F., Schneider, B.: Local Strategies for connecting stations by small robotic networks. In: IFIP 20th World Computer Congress, TC10: 2nd IFIP International Conference on Biologically Inspired Computing (BICC 2008), pp. 95–104 (2008)

    Google Scholar 

  9. Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local O(n^2) gathering algorithm. In: SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 217–223 (2010)

    Google Scholar 

  10. Ando, H., Suzuki, Y., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of the 1995 IEEE International Symposium on Intelligent Control, ISIC 1995, pp. 453–460 (August 1995)

    Google Scholar 

  11. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337(1-3), 147–168 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation 15(5), 818–828 (1999)

    Article  Google Scholar 

  13. Katreniak, B.: Convergence with Limited Visibility by Asynchronous Mobile Robots. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 125–137. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 142–153. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Desai, J.P., Ostrowski, J.P., Kumar, V.: Controlling Formations of Multiple Mobile Robots. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA 1998), vol. 4, pp. 2864–2869 (1998)

    Google Scholar 

  16. Fahimi, F., Nataraj, C., Ashrafiuon, H.: Real-time obstacle avoidance for multiple mobile robots. Robotica 27(2), 189–198 (2009)

    Article  Google Scholar 

  17. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoretical Computer Science 410(6-7), 481–499 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., Märtens, M., Meyer auf der Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: Collisionless Gathering of Robots with an Extent. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178–189. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Oasa, Y., Suzuki, I., Yamashita, M.: A robust distributed convergence algorithm for autonomous mobile robots. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC 1997), vol. 1, pp. 287–292 (1997)

    Google Scholar 

  20. Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., Märtens, M., Meyer auf der Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 650–661. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Brandes, P., Degener, B., Kempkes, B., Meyer auf der Heide, F.: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 138–149. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Kempkes, B., Meyer auf der Heide, F.: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. To Appear in Proceedings of SPAA 2012 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, 33102, Paderborn, Germany

    Barbara Kempkes & Friedhelm Meyer auf der Heide

Authors
  1. Barbara Kempkes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - LaBRI - Université Bordeaux 1, 351 Cours de la Libération, 33405, Talence cedex, France

    Ralf Klasing

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempkes, B., Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In: Klasing, R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30850-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30849-9

  • Online ISBN: 978-3-642-30850-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation