using astar.PathingHelper; using Microsoft.Extensions.Logging; using Graph.Utils; using OSM_Graph.Enums; using OSM_Regions; namespace astar { public class Astar(ValueTuple? priorityWeights = null, ValueTuple? optimizingWeights = null, int? explorationDistance = null, int? explorationMultiplier = null) { private readonly ValueTuple DefaultPriorityWeights = priorityWeights ?? new(1, 1.4f, 0, 0); private readonly ValueTuple OptimizingWeights = optimizingWeights ?? new(0, 0.07f, 0, 0); private int ExplorationDistanceFromRoute = explorationDistance ?? 1200; private int ExplorationMultiplier = explorationMultiplier ?? 65; public Route FindPath(float startLat, float startLon, float endLat, float endLon, float regionSize, bool car = true, PathMeasure pathing = PathMeasure.Distance, float additionalExploration = 3, string? importFolderPath = null, ILogger? logger = null) { RegionLoader rl = new(regionSize, importFolderPath, logger: logger); Graph graph = Spiral(rl, startLat, startLon, regionSize); Graph endRegion = Spiral(rl, endLat, endLon, regionSize); graph.ConcatGraph(endRegion); KeyValuePair startNode = graph.ClosestNodeToCoordinates(startLat, startLon, car); startNode.Value.PreviousIsFromStart = true; startNode.Value.PreviousNodeId = startNode.Key; startNode.Value.Metric = 0f; KeyValuePair endNode = graph.ClosestNodeToCoordinates(endLat, endLon, car); endNode.Value.PreviousIsFromStart = false; endNode.Value.PreviousNodeId = endNode.Key; endNode.Value.Metric = 0f; double totalDistance = NodeUtils.DistanceBetween(startNode.Value, endNode.Value); PriorityHelper priorityHelper = new(totalDistance, SpeedHelper.GetMaxSpeed(car)); logger?.Log(LogLevel.Information, "From {0:00.00000}#{1:000.00000} to {2:00.00000}#{3:000.00000} Great-Circle {4:00000.00}km", startNode.Value.Lat, startNode.Value.Lon, endNode.Value.Lat, endNode.Value.Lon, totalDistance / 1000); PriorityQueue toVisitStart = new(); toVisitStart.Enqueue(startNode.Key, 0); PriorityQueue toVisitEnd = new(); toVisitEnd.Enqueue(endNode.Key, 0); ValueTuple? meetingEnds = null; while (toVisitStart.Count > 0 && toVisitEnd.Count > 0) { if (toVisitStart.Count >= toVisitEnd.Count && meetingEnds is null) { for(int i = 0; i < toVisitStart.Count / 10 && meetingEnds is null; i++) meetingEnds = ExploreSide(true, graph, toVisitStart, rl, priorityHelper, endNode.Value, car, DefaultPriorityWeights, pathing, logger); } if(meetingEnds is null) meetingEnds = ExploreSide(true, graph, toVisitStart, rl, priorityHelper, endNode.Value, car, DefaultPriorityWeights, pathing, logger); if (toVisitEnd.Count >= toVisitStart.Count && meetingEnds is null) { for(int i = 0; i < toVisitEnd.Count / 10 && meetingEnds is null; i++) meetingEnds = ExploreSide(false, graph, toVisitEnd, rl, priorityHelper, startNode.Value, car, DefaultPriorityWeights, pathing, logger); } if(meetingEnds is null) meetingEnds = ExploreSide(false, graph, toVisitEnd, rl, priorityHelper, startNode.Value, car, DefaultPriorityWeights, pathing, logger); if (meetingEnds is not null) break; logger?.LogDebug($"toVisit-Queues: {toVisitStart.Count} {toVisitStart.UnorderedItems.MinBy(i => i.Priority).Priority} {toVisitEnd.Count} {toVisitEnd.UnorderedItems.MinBy(i => i.Priority).Priority}"); } if(meetingEnds is null) return new Route(graph, Array.Empty().ToList(), false); List routeNodes = PathFound(graph, meetingEnds.Value.Item1, meetingEnds.Value.Item2, car).Steps.Select(s => s.Node1).ToList(); Dictionary routeQueue = toVisitStart.UnorderedItems.Select(l => l.Element).Union(toVisitEnd.UnorderedItems.Select(l => l.Element)).Where(id => { Node p = graph.Nodes[id]; return routeNodes.Any(route => route.DistanceTo(p) < ExplorationDistanceFromRoute); }).ToDictionary(id => id, _ => int.MinValue); PriorityQueue combinedQueue = new(); foreach ((ulong key, int value) in routeQueue) combinedQueue.Enqueue(key, value); ValueTuple? newMeetingEnds = Optimize(additionalExploration, graph, combinedQueue, car, rl, priorityHelper, pathing, startNode.Value, endNode.Value, logger); meetingEnds = newMeetingEnds ?? meetingEnds; return PathFound(graph, meetingEnds!.Value.Item1, meetingEnds.Value.Item2, car, logger); } private static ValueTuple? ExploreSide(bool fromStart, Graph graph, PriorityQueue toVisit, RegionLoader rl, PriorityHelper priorityHelper, Node goalNode, bool car, ValueTuple ratingWeights, PathMeasure pathing = PathMeasure.Distance, ILogger? logger = null) { ulong currentNodeId = toVisit.Dequeue(); Node currentNode = graph.Nodes[currentNodeId]; logger?.LogDebug($"Distance to goal {currentNode.DistanceTo(goalNode):00000.00}m"); foreach ((ulong neighborId, KeyValuePair wayId) in currentNode.Neighbors) { if (!graph.ContainsNode(neighborId)) graph.ConcatGraph(Graph.FromGraph(rl.LoadRegionFromNodeId(neighborId))); if (!graph.ContainsWay(wayId.Key)) { foreach (global::Graph.Graph? g in rl.LoadRegionsFromWayId(wayId.Key)) graph.ConcatGraph(Graph.FromGraph(g)); } OSM_Graph.Way way = graph.Ways[wayId.Key]; byte speed = SpeedHelper.GetSpeed(way, car); if(speed < 1) continue; if(!way.AccessPermitted()) continue; if(wayId.Value && way.GetDirection() == (fromStart ? WayDirection.Backwards : WayDirection.Forwards) && car) continue; if(!wayId.Value && way.GetDirection() == (fromStart ? WayDirection.Forwards : WayDirection.Backwards) && car) continue; Node neighborNode = graph.Nodes[neighborId]; if (neighborNode.PreviousIsFromStart is not null && neighborNode.PreviousIsFromStart != fromStart) //Check if we found the opposite End return fromStart ? new(currentNode, neighborNode) : new(neighborNode, currentNode); float metric = (currentNode.Metric ?? float.MaxValue) + (pathing is PathMeasure.Distance ? (float)currentNode.DistanceTo(neighborNode) : (float)currentNode.DistanceTo(neighborNode) / speed); if (neighborNode.PreviousNodeId is null || neighborNode.Metric > metric) { neighborNode.PreviousNodeId = currentNodeId; neighborNode.Metric = metric; neighborNode.PreviousIsFromStart = fromStart; toVisit.Enqueue(neighborId, priorityHelper.CalculatePriority(currentNode, neighborNode, goalNode, speed, ratingWeights)); } logger?.LogTrace($"Neighbor {neighborId} {neighborNode}"); } return null; } private ValueTuple? Optimize(float additionalExploration, Graph graph, PriorityQueue combinedQueue, bool car, RegionLoader rl, PriorityHelper priorityHelper, PathMeasure pathing, Node startNode, Node goalNode, ILogger? logger = null) { int currentPathLength = graph.Nodes.Values.Count(node => node.PreviousNodeId is not null); int optimizeAfterFound = (int)(combinedQueue.Count * additionalExploration); //Check another x% of unexplored Paths. logger?.LogInformation($"Path found (explored {currentPathLength} Nodes). Optimizing route. (exploring {optimizeAfterFound} additional Nodes)"); ValueTuple? newMeetingEnds = null; while (optimizeAfterFound-- > 0 && combinedQueue.Count > 0) { ulong nodeId = combinedQueue.Peek(); Node node = graph.Nodes[nodeId]; bool fromStart = (bool)node.PreviousIsFromStart!; newMeetingEnds = ExploreSide(fromStart, graph, combinedQueue, rl, priorityHelper, fromStart ? goalNode : startNode, car, OptimizingWeights, pathing, logger); } return newMeetingEnds; } private static Route PathFound(Graph graph, Node fromStart, Node fromEnd, bool car = true, ILogger? logger = null) { logger?.LogInformation("Path found!"); List path = new(); OSM_Graph.Way toNeighbor = graph.Ways[fromStart.Neighbors.First(n => graph.Nodes[n.Key] == fromEnd).Value.Key]; path.Add(new Step(fromStart, fromEnd, (float)fromStart.DistanceTo(fromEnd), SpeedHelper.GetSpeed(toNeighbor, car))); Node current = fromStart; while (current.Metric != 0f) { Node previous = graph.Nodes[(ulong)current.PreviousNodeId!]; OSM_Graph.Way previousToCurrent = graph.Ways[previous.Neighbors.First(n => graph.Nodes[n.Key] == current).Value.Key]; Step step = new(previous, current, (float)previous.DistanceTo(current), SpeedHelper.GetSpeed(previousToCurrent, car)); path.Add(step); current = previous; } path.Reverse();//Since we go from the middle backwards until here current = fromEnd; while (current.Metric != 0f) { Node next = graph.Nodes[(ulong)current.PreviousNodeId!]; OSM_Graph.Way currentToNext = graph.Ways[current.Neighbors.First(n => graph.Nodes[n.Key] == next).Value.Key]; Step step = new(current, next, (float)current.DistanceTo(next), SpeedHelper.GetSpeed(currentToNext, car)); path.Add(step); current = next; } Route r = new (graph, path, true); logger?.LogInformation(r.ToString()); return r; } private static Graph Spiral(RegionLoader loader, float lat, float lon, float regionSize) { Graph? ret = Graph.FromGraph(loader.LoadRegionFromCoordinates(lat, lon)); int iteration = 1; while (ret is null) { for (int x = -iteration; x <= iteration; x++) { Graph? g1 = Graph.FromGraph(loader.LoadRegionFromCoordinates(lat + x * regionSize, lon - iteration * regionSize)); Graph? g2 = Graph.FromGraph(loader.LoadRegionFromCoordinates(lat + x * regionSize, lon + iteration * regionSize)); if (ret is not null) { ret.ConcatGraph(g1); ret.ConcatGraph(g2); } else if (ret is null && g1 is not null) { ret = g1; ret.ConcatGraph(g2); }else if (ret is null && g2 is not null) ret = g2; } for (int y = -iteration + 1; y < iteration; y++) { Graph? g1 = Graph.FromGraph(loader.LoadRegionFromCoordinates(lat - iteration * regionSize, lon + y * regionSize)); Graph? g2 = Graph.FromGraph(loader.LoadRegionFromCoordinates(lat + iteration * regionSize, lon + y * regionSize)); if (ret is not null) { ret.ConcatGraph(g1); ret.ConcatGraph(g2); } else if (ret is null && g1 is not null) { ret = g1; ret.ConcatGraph(g2); }else if (ret is null && g2 is not null) ret = g2; } iteration++; } return ret; } } }