Skip to main content

Multi-Robot Box-Pushing Using Non-dominated Sorting Bee Colony Optimization Algorithm

  • Conference paper

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

Abstract

The paper provides a new approach to multi-robot box pushing using a proposed Non-dominated Sorting Bee Colony (NSBC) optimization algorithm. The proposed scheme determines time-, energy- and friction-optimal solution to the box-pushing problem. The performance of the developed NSBC algorithm is compared to NSGA-II in connection with the box-pushing problem and the experimental results reveal that the NSBC outperforms NSGA-II in all the experiments.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karaboga, D.: An idea based on honey bee swarm for numerical optimisation, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)

    Google Scholar 

  2. Chakraborty, J., Konar, A., Nagar, A., Das, S.: Rotation and translation selective Pareto optimal solution to the box-pushing problem by the mobile robots using NSGA-II. In: Evolutionary Computation 2009, IEEE Congress (2009)

    Google Scholar 

  3. Parker, L.E.: Adaptive heterogeneous multi-robot teams. Neurocomputing 28(1-3), 75–92 (1999)

    Article  Google Scholar 

  4. Miyata, N., Ota, J., Arai, T., Asama, H.: Cooperative transport by multiple mobile robots in unknown static environments associated with real-time task assignment. IEEE Trans. Robot. Automat. 18(5), 769–780 (2002)

    Article  Google Scholar 

  5. Sugar, T.G., Kumar, V.: Control of cooperating mobile manipulators. IEEE Trans. Robot. Automat. 18(1), 94–103 (2002)

    Article  Google Scholar 

  6. Groß, R., Dorigo, M.: Evolving a Cooperative Transport Behavior for Two Simple Robots. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds.) EA 2003. LNCS, vol. 2936, pp. 305–316. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rakshit, P., Sadhu, A.K., Bhattacharjee, P., Konar, A., Janarthanan, R. (2011). Multi-Robot Box-Pushing Using Non-dominated Sorting Bee Colony Optimization Algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27172-4_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27171-7

  • Online ISBN: 978-3-642-27172-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics