-
We should make sure that the LightGraphs passes Lint.jl's lintpkg function. Right now there are many warnings and info lines and a few errors.
-
You can choose bidirectional A\* or A\* with a bit heuristic for maximum speed, increasing epsilon (`weight*epsilon`) in the weight estimation.
The area is Saxony with none-CH car routing:
| algori…
-
Hi,
Thank for awesome Jumper! I think we have a bug with JPS and ORTHOGONAL combo? If i change JPS to ASTAR, the path is found.
Thanks!
``` lua
-- Usage Example
-- First, set a collision map
local …
-
```
algo.astar() takes a layer object, which is some object such that
layer[y][x] is an integer. During the course of pathfinding, it may look
outside the layer for nodes to go to, causing an IndexErr…
-
In certain cases OTP is having the user board/alight at a stop that is unnecessarily far from their origin/destination point; often there is a stop on the same route immediately adjacent to user's loc…
-
When doing a CAR,TRANSIT search, I see these messages:
```
12:10:06.455 WARN (AStar.java:120) Timeout during initialization of goal direction heuristic.
12:10:06.455 WARN (GraphPathFinder.java:167) S…
-
The "Found a path to the goal" condition is checked when expanding neighbours. But to be optimal, this condition should be checked for a node freshly popped from the priority queue instead.
Its taki…
-
| | |
|--------------------|----|
| Bugzilla Link | [PR13225](https://bugs.llvm.org/show_bug.cgi?id=13225) |
| Status | RESOLVED FIXED |
| Importance | P…
-
I've been working on an "automated" roguelike (see [here](http://plnkr.co/edit/miYo20GPQ0cxe5rlK7wk)). Currently, the game goes pretty fast - the player takes a turn every 50ms. Every 100 turns 1-3 en…
-
```
algo.astar() takes a layer object, which is some object such that
layer[y][x] is an integer. During the course of pathfinding, it may look
outside the layer for nodes to go to, causing an IndexErr…