Dynamic graph-based search in unknown environments

  • Authors:

  • Paul S. Haynes;Lyuba Alboul;Jacques Penders

  • Affiliations:

  • Centre for Automation and Robotics Research, Sheffield Hallam University, City Campus, Howard Street, S1 1WB, UK;Centre for Automation and Robotics Research, Sheffield Hallam University, City Campus, Howard Street, S1 1WB, UK;Centre for Automation and Robotics Research, Sheffield Hallam University, City Campus, Howard Street, S1 1WB, UK

  • Venue:
  • Journal of Discrete Algorithms
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel graph-based approach to search in unknown environments is presented. A virtual geometric structure is imposed on the environment represented in computer memory by a graph. Algorithms use this representation to coordinate a team of robots (or entities). Local discovery of environmental features cause dynamic expansion of the graph resulting in global exploration of the unknown environment. The algorithm is shown to have O(k@?n"H) time complexity, where n"H is the number of vertices of the discovered environment and 1=