Abstract
This paper presents a new approach to the multi-agent coverage path-planning problem. An efficient multi-robot coverage algorithm yields a coverage path for each robot, such that the union of all paths generates an almost full coverage of the terrain and the total coverage time is minimized. The proposed algorithm enables multiple robots with limited sensor capabilities to perform efficient coverage on a shared territory. Each robot is assigned to an exclusive route which enables it to carry out its tasks simultaneously, e.g., cleaning assigned floor area with minimal path overlapping. It is very difficult to cover all free space without visiting some locations more than once, but the occurrence of such events can be minimized with efficient algorithms. The proposed multi-robot coverage strategy directs a number of simple robots to cover an unknown area in a systematic manner. This is based on footprint data left by the randomized path-planning robots previously operated on that area. The developed path-planning algorithm has been applied to a simulated environment and robots to verify its effectiveness and performance in such an application.
References
[1] H. Choset. “Coverage for robotics - A survey of recent results”. In Annals of Mathematics and Artificial Intelligence, vol. 31, no. 1-4, pp. 113-126, Oct. 2001.10.1023/A:1016639210559Search in Google Scholar
[2] D. Latimer-IV, S. Srinivasa, V. Lee-Shue, S. S. Sonne, H. Choset and A. Hurst. “Toward sensor based coverage with robot teams”. In Proc. 2002 IEEE International conference on Robotics & Automation.10.1117/12.457455Search in Google Scholar
[3] C. Luo and S. Yang. “A real-time cooperative sweeping strategy for multiple cleaning robots”. In IEEE International Symposium on Intelligent Control, 660-667, 2002Search in Google Scholar
[4] D. J. Bruemmer, D. D. Dudenhoeffer, M. O. Anderson, and M.D. Mckay. “A robotic swarm for spill finding and perimeter formation”. In Spectrum, 2002Search in Google Scholar
[5] Z. J. Butler; A.A. Rizzi; R.L. Hollis. “Cooperative coverage of rectilinear environments”. In Proceedings of IEEE International Conference on Robotics and Automation, Vol. 3, pp. 2722-2727, 24-28 April, 2000.Search in Google Scholar
[6] M. A. Batalin and G.S. Sukhatme. “Spreading out: A local approach to multi-robot coverage”. In 6th International symposium on Distributed Autonomous Robotics Systems, Fukuoka, country-regionJapan.Search in Google Scholar
[7] J. Cortes; S. Martinez; T. Karatas; F. Bullo. “Coverage control for mobile sensing networks”. In IEEE Transactions on Robotics and Automation, Vol. 20, Issue 2, pp. 243 – 255, 2004.10.1109/TRA.2004.824698Search in Google Scholar
[8] O. Burchan Bayazit, Jyh-Ming Lien, and Nancy M. Amato. “Better flocking behaviors in complex environments using global roadmaps”. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, December 2002.Search in Google Scholar
[9] M. Jager and B. Nebel. “Dynamic decentralized area partitioning for cooperating cleaning robots”. In Proceedings IEEE International Conference on Robotics and Automation, pp. 3577–3582, May 2002Search in Google Scholar
[10] S. X. Yang, C. Luo, and Q. H. M. Meng. “Area-covering operation of a cleaning robot in a dynamic environment with unforeseen obstacles”. In Proc. of the IEEE Int. Symp. on Computational Intelligence in Robotics and Automation, July 2003, vol. 2, pp. 1034-1039.Search in Google Scholar
[11] E. Acar and H. Choset. “Robust sensor-based coverage of unstructured environments”. In Proc. of the IEEE International Conference on Intelligent Robots and Systems (IROS’2001), Maui, Hawaii, 29-3 Oct./Nov. 2001, pp. 61-68Search in Google Scholar
[12] H. Choset. “Coverage of Known Spaces: The Boustrophedon Cellular Decomposition”. In Autonomous Robots, Volume 9, Number 3, 247-253.Search in Google Scholar
[13] D.W. Gage. “Randomized search strategies with imperfect sensors”. In Proceedings of Mobile Robots VIII, Boston, StateMass., SPIE, 270–279, 199310.1117/12.167503Search in Google Scholar
[14] IROBOT CORP. iRobot Create Owner’s Guide. 2006.Search in Google Scholar
[15] T.E. Kurt. “Hacking Roomba”. Wiley Publishing, Indianapolis, Ind. 2006.Search in Google Scholar
[16] C. Brom. “Hierarchical Reactive Planning: Where is its limit?” In Proceedings of MNAS workshop. Edinburgh, Scotland, 2005.Search in Google Scholar
[17] J. Xiao and Z. Michalewicz. “An Evolutionary Computation Approach to Robot Planning and Navigation”. In Hirota, K. and Fukuda, T. (eds.), Soft Computing in Mechatronics, Springer-Verlag, Heidelberg, Germany, pp. 117 – 128, 2000.Search in Google Scholar
[18] M. S. Ajmal Deen Ali; N. Babu and K. Varghese. “Offline Path Planning of cooperative manipulators using Co-Evolutionary Genetic Algorithm”. In Proceedings of the International Symposium on Automation and Robotics in Construction, 19th (ISARC), pp. 415-124, 2002.Search in Google Scholar
[19] S. Farritor and S. Dubowsky. “A Genetic Planning Method and its Application to Planetary Exploration”. In ASME Journal of Dynamic Systems, Measurement and Control, 124(4), 698-701, 200210.1115/1.1515330Search in Google Scholar
[20] J.A. Sauter; R. Matthews; H. V. D. Parunak, and S. Brueckner. “Evolving Adaptive Pheromone Path Planning Mechanisms”. In First International Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, 434-440, 2002.10.1145/544741.544841Search in Google Scholar
[21] C.A. Coello Coello; D.A. Van Veldhuizen and G.B. Lamont. “Evolutionary Algorithms for Solving Multi-Objective Problems”. Norwell, MA: Kluwer, 2002.10.1007/978-1-4757-5184-0Search in Google Scholar
[22] A.J. Chipperfield; R. Purshouse; P.J. Fleming; H. Thompson, and I. Griffin. ” Multi-objective optimisation in control system design: an evolutionary computing approach. In IFAC World Congress, Barcelona, 2002.Search in Google Scholar
[23] K. Deb “Multi-objective optimization using evolutionary algorithms”. New York; Chichester: Wiley, 2001Search in Google Scholar
[24] C.M. Fonseca and P.J. Fleming. “Genetic algorithms for multi-objective optimization: formulation, discussion and generalization”. In Proceeding of the Fifth International Conference, San Mateo, CA, pp. 416-423, 1993Search in Google Scholar
[25] C.M. Fonseca and P.J. Fleming. “Multiobjective optimization and multiple constraint handling with evolutionary algorithms-part I: A unified formulation”. In IEEE Transaction on Systems, Man and Cybernetics-part A: Systems and Humans, 28(1), pp. 26-37, 1998Search in Google Scholar
[26] A.J. Chipperfield, and P.J. Fleming. “Multiobjective gas turbine engine controller design using genetic algorithms”. In IEEE Transaction on Industrial Electronics 43(??), 583-587, 199610.1109/41.538616Search in Google Scholar
[27] N. V. Dakev, J. F. Whidborne, A. J. Chipperfield and P. J. Fleming. “Evolutionary Hinfin design of an electromagnetic suspension control system for a maglev vehicle”. In Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, 1997, pp. 211: 34510.1243/0959651971539876Search in Google Scholar
[28] placeI. A. Griffin, P. Schroder, A. J. Chipperfield and P. J. Fleming. “Multi-objective optimization approach to the ALSTOM gasifier problem”. In Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, 2000, pp. 214: 45310.1243/0959651001540807Search in Google Scholar
[29] M.S. Alam and M.O. Tokhi. “Designing feedforward command shapers with multi-objective genetic optimisation for vibration control of a single-link flexible manipulator, Engineering Applications of Artificial Intelligence”, 21(??), pp. 229-246, 200810.1016/j.engappai.2007.04.008Search in Google Scholar
[30] D. Housten and W. Regli. “Low-Cost Localization for Educational Robotic Platforms via an External Fixed-Position Camera”. AAAI AI Education Colloquium, 2008.Search in Google Scholar
[31] M. A. Habib and T.N. Upal. “A novel methodology for indoor positioning”. In World Congress on Nature and Biologically Inspired Computing (NABIC 2009), Coimbatore, India, December 09-11, 200910.1109/NABIC.2009.5393473Search in Google Scholar
[32] A. Fournier and D.Y. Montuno. “Triangulating Simple Polygons and Equivalent Problems.” In ACM Trans. Graphics 3, 153-174, 1984.10.1145/357337.357341Search in Google Scholar
[33] D. Whitley; S. Timothy; D’Ann Fuquay. “Scheduling problems and traveling salesman: The genetic edge recombination operator”. In International Conference on Genetic Algorithms: 133-140. ISBN:1-55860-066-3, 1983Search in Google Scholar
© Md Ahsan Habib et al.
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
