Abstract
This paper presents a mathematical formulation of the problem of cleaning and delivery task in a large public space with multiple robots, along with a procedural solution based on task reallocation. The task in the cleaning problem is the cleaning zone. A group of robots are assigned to each cleaning zones according to the environmental parameters. Resource constraints make cleaning robots stop operation periodically, which can incur a mission failure or deterioration of the mission performance. In our solution approach, continuous operation is assured by replacing robots having resource problems with standby robots by task reallocation. Two resource constraints are considered in our formulation: the battery capacity and the garbage bin size. This paper describes and compares the performance of three task reallocation strategies: All-At-Once, Optimal-Vector, and Performance-Maximization. The performance measures include remaining garbage volume, cleaning quality, and cleaning time. Task allocation algorithms are tested by simulation in an area composed of 4 cleaning zones, and the Performance-Maximization strategy marked the best performance. Hence, a delivery task is added to the cleaning task. The delivery request operates as a new perturbation factor for the reallocation. The task allocation procedure for the delivery task includes the switching of tasks of the delivery robot itself as well as exchanging among cleaning robots to meet the balance of the cleaning performance. The experiment was conducted with 9 robots with the software architecture that enables multi-functional of a robot and they performed both pseudo-clean and delivery task successfully.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ackerman, E.: Avidbots wants to automate commercial cleaning with robots. IEEE Spectr. (2014)
Ahmadi, M., Stone, P.: A multi-robot system for continuous area sweeping tasks. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 1724–1729 (2006)
Bardram, J.E., Bossen, C.: Mobility work: the spatial dimension of collaboration at a hospital. Comput. Support. Coop. Work (CSCW) 14(2), 131–160 (2005)
Choi, S., Lee, J.Y., Yu, W.: uRON v1.5: A device-independent and reconfigurable robot navigation library. In: Proceedings of the IEEE Workshop on Advanced Robotics and its Social Impacts (ARSO), pp.170–175 (2010)
Choi, J., Choi, M., Nam, S.Y., Chung, W.K.: Autonomous topological modeling of a home environment and topological localization using a sonar grid map. Auton. Robots 30(4), 351–368 (2011)
D’Andrea, R.: Guest editorial: a revolution in the warehouse: a retrospective on kiva systems and the grand challenges ahead. IEEE Trans. Autom. Sci. Eng. 49, 638–639 (2012)
Elmaliach, Y., Agmon, N., Kaminka, G.A.: Multi-robot area patrol under frequency constraints. Ann. Math. Artif. Intell. 57(3–4), 293–320 (2009)
Hess, J., Beinhofer, M., Kuhner, D., Ruchti, P., Burgard, W.: Poisson-driven dirt maps for efficient robot cleaning. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp.2245–2250 (2013)
Jager, M., Nebel, B.: Dynamic decentralized area partitioning for cooperating cleaning robots: In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp.3577-3582 (2002)
Janchiv, A., Batsaikhan, D., Kim, B.S., Lee, W.G., Lee, S.G.: Time-efficient and complete coverage path planning based on flow networks for multi-robots. Int. J. Control Autom. Syst. (IJCAS), 11(2), 369–376 (2013)
Kolling, A., Carpin, S.: Multi-robot surveillance: an improved algorithm for the graph-clear problem. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 2360–2365 (2008)
Kong, C.S., Peng, N.A., Rekleitis, I.: Distributed coverage with multi-robot system. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 2423–2429 (2006)
Korsah, G.A., Stentz, A., Dias, M.B.: A comprehensive taxonomy for multi-robot task allocation. Int. J. Robot. Res. (IJRR) 32(12), 1495–1512 (2013)
Koscielniak, T., et. al.: Key performance indicators for carriers & logistics service providers. Odette International Limited, p. 8 (2007)
Lee, J.H., Choi, J.S., Lee, B.H., Lee, K.W.: Complete coverage path planning for cleaning task using multiple robots. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 3618–3622 (2009)
Niechwiadowicz, K., Khan, Z.: Robot based logistics system for hospitals-survey. In: IDT Workshop on Interesting Results in Computer Science and Engineering (2008)
Rekleitis, I., Lee-Shue, V., New, A.P., Choset, H.: Limited communication, multi-robot team based coverage. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 3462–3468 (2004)
Santos, F.N., Moreira, A.P.: Towards extraction of topological maps from2D and 3D occupancy grids. Lecture Notes in Computer Science (LNCS), Prog. Artif. Intell. 8154, 307–318 (2013)
Zahugi, E.M.H., Shanta, M.M., Prasad, T.V.: Design of multi-robot system for cleaning up marine oil spill. Int. J. Adv. Inf. Technol. (IJAIT), 2(4), 33–43 (2012)
Acknowledgments
This work was supported by the Robot R&D program of MOTIE/KEIT. [10051155, The Development of Robot Based Logistics Systems Applicable to Hospital-wide Environment]
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Jeon, S., Jang, M., Lee, D., Cho, YJ., Kim, J., Lee, J. (2016). Multiple Robots Task Allocation for Cleaning and Delivery. In: Bi, Y., Kapoor, S., Bhatia, R. (eds) Intelligent Systems and Applications. Studies in Computational Intelligence, vol 650. Springer, Cham. https://doi.org/10.1007/978-3-319-33386-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-33386-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33384-7
Online ISBN: 978-3-319-33386-1
eBook Packages: EngineeringEngineering (R0)