forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
This project helps operations engineers and logistics planners find the most efficient paths for movement, deliveries, or resource allocation within complex systems. It takes a description of your system (the 'domain') and a starting point with a desired goal, then produces the optimal sequence of actions to reach that goal. This is designed for anyone needing to optimize navigation or sequencing tasks, like route planning for robots in a warehouse or determining steps in a manufacturing process.
Available on PyPI.
Use this if you need to teach an AI to quickly find optimal or near-optimal solutions for complex pathfinding or sequencing problems in various operational domains.
Not ideal if you're looking for a simple, pre-trained solution for a common problem like basic road navigation or if you don't have the technical expertise to define your custom problem domain.
Stars
10
Forks
4
Language
Python
License
MIT
Last pushed
Mar 13, 2026
Commits (30d)
0
Dependencies
10
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/forestagostinelli/deepxube"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Compare
Related frameworks
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
algoprog/Laby
Maze generator, editor & solver in Java
tekian/path-finder
Visualization tool to demonstrate how different search algorithms work.
PiSimo/Mens
Brain game that tries to spot signs of memory leak like alzheimer (with Neural Networks).