REVIEW 1 cited by
Reinforcement Learning with A* and a Deep Heuristic
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A* is a popular path-finding algorithm, but it can only be applied to those domains where a good heuristic function is known. Inspired by recent methods combining Deep Neural Networks (DNNs) and trees, this study demonstrates how to train a heuristic represented by a DNN and combine it with A*. This new algorithm which we call aleph-star can be used efficiently in domains where the input to the heuristic could be processed by a neural network. We compare aleph-star to N-Step Deep Q-Learning (DQN Mnih et al. 2013) in a driving simulation with pixel-based input, and demonstrate significantly better performance in this scenario.
Forward citations
Cited by 1 Pith paper
-
Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization
A policy-gradient neural network can learn obstacle-avoiding target navigation in a continuous robosoccer domain, with partial transfer from static training to dynamic multi-agent evaluation.
Discussion (0). Continue with ORCID to comment.