Skip to main content

Suitability of CORDA Model for Area Coverage Problem

  • Conference paper
  • First Online:
Advanced Computing and Communication Technologies

Abstract

COopeRative Distributed Asynchronous model or CORDA model is a basic computational model in the field of robot swarm. The objective of this work is to justify popularity and suitability of the CORDA model as a basic model of computation vis-à-vis other computational models. The problem of covering a target area has been taken up as an area of focus. This chapter presents a critical review of the various solutions of the coverage problem under CORDA model.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Mondada, F., et al.: Transport of a child by swarm-bots. Laboratory of Intelligent Systems, Swiss Federal Institute of Technology. Available from: www.youtube.com/watch?v=CJOubyiITsE Accessed: 01 July 2007

  2. Prencipe, G.: Corda: distributed coordination of a set of autonomous mobile robots. In: 4th European Research Seminar on Advances in Distributed Systems, pp. 185–190 (2001)

    Google Scholar 

  3. Latimer, D., Srinivasa, S., Lee Shue, V., Sonne, S., Choset, H., Hurst, A.: Toward sensor based coverage with robot teams. In: IEEE International Conference on Robotics and Automation, vol. 1, pp. 961–967 (2002)

    Google Scholar 

  4. Kong, C., Peng, N.A., Rekletis, I.: Distributed coverage with multi-robot system. In: IEEE International Conference on Robotics and Automation, pp. 2423–2429 (2006)

    Google Scholar 

  5. Rekletis, I., Lee Shue, V., New, A.P., Choset, H.: Limited communication, multi-robot team based coverage. In: IEEE International Conference on Robotics and Automation, pp. 3462–3468 (2004)

    Google Scholar 

  6. Rekletis, I., New, A.P., Rankin, E.S., Choset, H.: Efficient boustrophedon multi robot coverage: an algorithmic approach. Ann. Math. Artif. Intell. 52(2–4), 109–142 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Das, D., Mukhopadhyaya, S.: An algorithm for painting an area by swarm of mobile robots. Int. J. Inform. Process. 7(3), 1–15 (2013)

    Google Scholar 

  8. Das, D., Mukhopadhyaya, S.: Distributed algorithm for painting by a swarm of robots under limited visibility. Int. J. Adv. Robot. Syst. 2016

    Google Scholar 

  9. Das, D.: Distributed area coverage by swarm of mobile robots. Doctoral Thesis, Submitted at National Institute of Technology, Durgapur, India (2016)

    Google Scholar 

  10. Das, D., Mukhopadhyaya, S.: Multi-robot assembling along a boundary of a given region in presence of opaque line obstacles, pp. 21–29. ICICA, Chennai (2015). doi:10.1007/978-981-10-1645-5-3

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deepanwita Das .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Das, D., Mukhopadhyaya, S. (2018). Suitability of CORDA Model for Area Coverage Problem. In: Choudhary, R., Mandal, J., Bhattacharyya, D. (eds) Advanced Computing and Communication Technologies. Advances in Intelligent Systems and Computing, vol 562. Springer, Singapore. https://doi.org/10.1007/978-981-10-4603-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4603-2_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4602-5

  • Online ISBN: 978-981-10-4603-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics