Multi-Robot box-pushing using non-dominated sorting bee colony optimization algorithm

Authors:
Pratyusha Rakshit;Arup Kumar Sadhu;Preetha Bhattacharjee;Amit Konar;Ramadoss Janarthanan
Affiliations:
ETCE Dept., Jadavpur University, Kolkata, India;ETCE Dept., Jadavpur University, Kolkata, India;CSE Dept., Jadavpur University, Kolkata, India;ETCE Dept., Jadavpur University, Kolkata, India;Jaya Engineering College, Chennai, India
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 1
Cited 0

Rotation and translation selective Pareto optimal solution to the box-pushing problem by mobile robots using NSGA-II

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.