返回
Reinforcement Learning Heuristic A
DOI:10.1109/TII.2022.3188359.png)
摘要
En 中文
In a graph search algorithm, a given environment is represented as a graph comprising a set of feasible system configurations and their neighboring connections. A path is generated by connecting the initial and goal configurations through graph exploration, whereby the path is often desired to be optimal or suboptimal. The computational performance of the optimal path generation depends on the avoidance of unnecessary explorations. Accordingly, heuristic functions have been widely adopted to guide the exploration efficiently by providing estimated costs to the goal configurations. The exploration is efficient when the heuristic functions estimate the optimal cost closely, which remains challenging because it requires a comprehensive understanding of the environment. However, this challenge presents the scope to improve the computational efficiency over the existing methods. Herein, we propose reinforcement learning heuristic A* (RLHA*), which adopts an artificial neural network as a learning heuristic function to closely estimate the optimal cost, while achieving a bounded suboptimal path. Instead of being trained by precomputed paths, the learning heuristic function keeps improving by using self-generated paths. Numerous simulations were performed to demonstrate the consistent and robust performance of RLHA* by comparing it with the existing methods.
Keyword:
Costs
Heuristic algorithms
Path planning
Signal processing algorithms
Robots
Reinforcement learning
Planning
Graph search
path planning
reinforcement learning
期刊
IF:
9.9
论文数:
8.6K
被引数:
6.0W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间?
Universal approximation using feedforward neural networks: A survey of some existing methods, and some new results使用前馈神经网络的通用逼近: 对一些现有方法的调查以及一些新结果
NEURAL NETWORKS
IF6.3

