This repository contains a deep learning-based approach for improving A* search efficiency on grid graphs. By learning instance-dependent heuristic proxies like correction factors and path probability, our method significantly reduces computational effort in obstacle-rich environments.
active 2024-08-27 → 2024-09-18 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 23 days from 2024-08-27 to 2024-09-18. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 2 total, peak 1 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| aandreychuk | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 2 stars here means stars gained during the window, not the repo's star count.