-
Ticket for tracking the progress of the tool **drtOnline.py**.
**The tool needs Python 3 and the ILP solver [PuLP](https://pypi.org/project/PuLP/) to be installed.**
Example scenario:
[shared_dr…
-
How can we improve routing functions?
- [ ] support global router
- [ ] support auto-routing with arbitrary directions, at the moment groups of routes need to have the same angle.
See `gdsfac…
-
from myutils import *
infinity = float('inf')
class Node:
def __init__(self, state, parent=None, action=None, path_cost=0):
self.state = state
self.parent = parent
…
-
After install this planner, we found that it cannot solve any instance. "Search stopped without finding a solution"
-
A* with a closed set can select suboptimal plans if the heuristic function overestimates the remaining cost of an intermediate state. The current heuristic of counting the conflicting states can be an…
-
If you have a big map, it looks like you need a huge amount of steps in order to find a path, even though point A and point B are close to each other. Is it intentional that it steps through every sin…
-
Hello dear friends. Although I have set the number of cores involved in processing to 4, there is only one core involved in processing. What is the problem, also although the GPU is identified during …
-
I'm working on a script in one of my repos ([astar rover](https://github.com/aidygus/astar-rover)) and making heavy usage of lexicons and lists. I've noticed that when executing the script KOS is ch…
-
Hi there,
I am trying to develop a pathfinding algorithm for an AGV (Automated Guided Vehicle). It might be a bit different from other scenarios, as the AGV needs to decelerate to a complete stop whe…
-
On a whim, I decided to try implementing A_. So, semi-frequently, the algorithm seems to take a freakishly long time computing a path and never actually finishes thanks to the heap space running out (…