工程科学学报 (Sep 2020)

Complete coverage path planning of mobile robot on abandoned mine land

  • Lin-na ZHOU,
  • Yun WANG,
  • Xin ZHANG,
  • Chun-yu YANG

DOI
https://doi.org/10.13374/j.issn2095-9389.2019.09.09.004
Journal volume & issue
Vol. 42, no. 9
pp. 1220 – 1228

Abstract

Read online

Land resources are the fundamental and basic requirements for human survival and development as well as for the agricultural production and industrial construction. In recent years, due to the impact of industrial construction and chemical pollution, the cultivable land area is gradually decreasing, and the available agricultural land may be gravely insufficient for food production in the future. In China, the amount of abandoned mine land has increased significantly because of China’s national supply-side structural reform program. The abandoned mine land can be transformed into agricultural land to effectively alleviate food crisis and the contradictory relationship existing between people and land, and improve the ecological environment of mining area. Abandoned mine land refers to the land that has lost its economic value due to a series of production operations and also the land that has not been artificially restored to original conditions after mining. Abandoned mine land is a large, external, and unstructured environment with multiple obstacles and uncertainties and cannot be accessed by humans. Therefore, mobile robots are used to access those areas, and even for mobile robots, planning their coverage path in those areas is difficult. In this paper, the boustrophedon cellular decomposition (BCD) method and biologically inspired neural network (BINN) algorithm were combined to complete the coverage path planning of mobile robots on abandoned mine land. First, for the known environment of the abandoned mine land, the BCD method was used to make regional decomposition of the complex environment. The map with comprehensive complexity was decomposed into several subregions without any obstacles. Second, an undirected graph (i.e., a set of objects called vertices or nodes that are connected together, where all the edges are bidirectional) was constructed according to the adjacency relationship of the subregions, and the depth first search algorithm was used to determine the transfer order between subregions. Finally, the BINN algorithm was used to determine the internal walking mode of and the regional transfer path between the subregions. Simulation results show that the BINN algorithm is of higher efficiency than any other path planning algorithms used to solve the robot path transfer problem. Moreover, the proposed method in this paper could work in complex, unstructured environments to complete the coverage path planning of mobile robots.

Keywords