MULTI-ROBOT TERRAIN COVERAGE BY CONSTRUCTING MULTIPLE SPANNING TREES SIMULTANEOUSLY

K.S. Senthilkumar and K.K. Bharadwaj

References

  1. [1] M.A. Batalin & G.S. Sukhatme, Spreading out: a local approach to multi-robot coverage, Proc. 6th Int. Symposium on Distributed Autonomous Robotic Systems, 2002, 373–382.
  2. [2] E. Gonzalez, M. Alarcon, P. Aristizabal, & C. Parra, BSA: a coverage algorithm, Proc. IEEEIROS 2003, 2003, 1679–1684.
  3. [3] A. Pirzadeh & W. Snyder, A unified solution to coverage and search in explored and unexplored terrains using indirect control, Proc. IEEE Int. Conf. on Robotics and Automation, 1990, 2113–2119.
  4. [4] J. Svennebring & Koenig, Building terrain-covering ant robots: a feasibility study, Autonomous Robotics, 16(3), 2003, 313–332.
  5. [5] Y. Gabrielly & E. Rimon, Spanning-tree based coverage of continuous areas by a mobile robot, Annals of Mathematics and Artificial Intelligence, 31(1–4), 2001, 77–98.
  6. [6] N. Hazon & G.A. Kaminka, Redundancy, efficiency and robustness in multi-robot coverage, Proc. 2005 IEEE Int. Conf. on Robotics and Automation, 2005, 735–741.
  7. [7] I.A. Wagner, M. Lindenbaum, & A.M. Bruckstein, Distributed covering by ant-robots using evaporating traces, IEEE Transaction on Robotics Automation, 15(5), 1999, 918–933.
  8. [8] Z.J. Butler, A.A. Rizzi, & R.L. Hollis, Complete distributed coverage of rectilinear environments, Proc. 4th Workshop on Algorithmic Foundations of Robotics, Hanover, New Hampshire, 2000.
  9. [9] S. Koenig & B. Szymanski, Value-update rules for real-time search, Proc. Nat Conf on Artificial Intelligence, 1999, 718–724.
  10. [10] H. Choset, E. Acar, A. Rizzi, & J. Luntz, Exact cellular decompositions in terms of critical points of morse functions, Proc. IEEE Int Conf on Robotics and Automation, 2000.
  11. [11] E.M. Arkin, S.P. Fekete, & J.S. Mitchell, Approximation algorithms for lawn mowing and milling, Computional Geom: Theory Application, 17(1–2), 2000, 25–50.
  12. [12] S. Koenig, B. Szymanski, & Y. Liu, Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence – Special Issue on Ant Robotics, 31, 2001, 41–76.
  13. [13] K.S. Senthilkumar & K.K. Bharadwaj, A hybrid evolutionary approach for multi robot path exploration problem, Proc. IMCECS, 2008.
  14. [14] R. Sharpe & B. Webb, Simulated and situated models of chemical trail following in Ants, Proc. Int. Conf. on Simulation of Adaptive Behavior, 1998, 195–204.
  15. [15] G. Di Caro & M. Dorigo, Antnet: distributed stigmergetic control for communications networks, Journal of Artificial Intelligence Research, 9, 1998, 317–365.
  16. [16] A. Zelinsky, R. Jarvis, J. Byrne, & S. Yuta, Planning paths of complete coverage of an unstructured environment by a mobile robot, Proc. Int. Conf. on Advanced Robotics, 1993, 533–538.
  17. [17] K.S. Senthilkumar & K.K. Bharadwaj, Exploration strategy based on terrain coverage for multiple robots using genetic algorithm, Proc. ICSTC’08, 2008, 163–169.

Important Links:

Go Back