Finding the lowest-cost path for searching the grid-based environment
Bo Gao, Demin Xu, Fubin Zhang, Yao Yao · 2009
Searching the unknown or partially known region or acquiring the new information in the map is an important mission for vehicle in the areas of military and civilian use. Planning the lowest-cost path is one of the primary work for searching the environment. This paper develops a planning strategy which could minimize the cost and every corner in the map can be seen on the path based on cell decomposition. It firstly draws out the polygon structure from the environment based on grids. With the decomposition of polygon into triangulations, the method makes use of the watchman algorithm and builds the hourglass to construct the heuristics function for vehicle. Directed by heuristics and changing the search direction on essential cuts, the grid-based searching method finally gets our desired route through a so called mirror reflection. Throughout the simulation, such a method could make the optimal route and environment is visible on path. Compared with the path connected from random nearest neighbor points on essential line, our generated path is lower in cost.