Skip to content

A novel heuristics function for evaluating and selecting intermediate points in an autonomous exploration and mapping system where navigation is performed by a learned neural network.

Notifications You must be signed in to change notification settings

reiniscimurs/IDLE-heuristic

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Information-based Distance Limited Exploration (IDLE) heuristic

A novel heuristics function for evaluating and selecting intermediate points in an autonomous exploration and mapping system where navigation is performed by a learned neural network. The heuristics function calculates the fitness score of each given point in a partially observed map. The function calculation takes into consideration the training setting of a deep reinforcement learning-based network and combines it with distance information towards the global goal and the map information. The point with the minimum score is assumed to be the best solution.

The paper is available at: https://ieeexplore.ieee.org/abstract/document/9494668

Resulting score surfaces in a partially known map:

Goal: [15, 0] Origin: [0, 0]

Goal: [10, -5] Origin: [-5, 2]

Goal: [20, 10] Origin: [-10, -10]

About

A novel heuristics function for evaluating and selecting intermediate points in an autonomous exploration and mapping system where navigation is performed by a learned neural network.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages