• DocumentCode
    482143
  • Title

    Spanning tree based terrain coverage by multi robots in unknown environments

  • Author

    Senthilkumar, K.S. ; Bharadwaj, K.K.

  • Author_Institution
    Sch. of Comput. & Syst. Sci., Jawaharlal Nehru Univ., New Delhi
  • Volume
    1
  • fYear
    2008
  • fDate
    11-13 Dec. 2008
  • Firstpage
    120
  • Lastpage
    125
  • Abstract
    Terrain Coverage algorithms have been studied in the robotics literature and other navigation tasks because of their numerous applications including vacuum cleaning, lawn mowing, harvesting, mine clearing, inspection and intrusion detection. There are several remarkable research attempts on Terrain Coverage based on genetic algorithms, spanning trees, exact cell decomposition, and spiral filling paths. This paper presents a novel simultaneous on-line coverage strategy for multi robots, which is structured and assures complete and robust coverage of the surface regardless of the shape of the unknown environment. In particular, we study ant-robots and how they can cover terrain by leaving markings in the terrain, similar to what ants do. These markings can be sensed by all robots and allow them to cover the unknown terrain without direct communication with each other. A real-time heuristic search method is used to implement ant-robots and simulation results for simultaneous online terrain coverage are presented.
  • Keywords
    genetic algorithms; mobile robots; multi-robot systems; path planning; search problems; trees (mathematics); ant-robots; cell decomposition; genetic algorithms; multi robots; real-time heuristic search method; spanning tree; spiral filling paths; terrain coverage; Cleaning; Filling; Genetic algorithms; Inspection; Intrusion detection; Navigation; Robot sensing systems; Robustness; Shape; Spirals;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    India Conference, 2008. INDICON 2008. Annual IEEE
  • Conference_Location
    Kanpur
  • Print_ISBN
    978-1-4244-3825-9
  • Electronic_ISBN
    978-1-4244-2747-5
  • Type

    conf

  • DOI
    10.1109/INDCON.2008.4768812
  • Filename
    4768812