How to do map research?

Question

Algorithms

There is a 2D grid describing the location. There is a start and end point, and a radius in which cells are considered visited. Actually, you need to go from the starting point to the end point, examining a certain minimum percentage of cells, while minimizing repeated visits to cells (dead ends are possible, in which you have to return anyway). During the movement, it is possible to deviate from the original path, therefore, most likely, it will not be possible to calculate everything in advance. I thought about trying to tweak A* for the task, but it's not a fact that it will work, and maybe there are better options.

Answer 1

this is a typical mathematical problem googled "optimal path through the maze" or something like that

Answer 2

These algorithms are called SPF (shortest path finding). I advise using dijrakta. But there are many others. These are all graphs.