pgr_astar 和不可能的边(例如，锁着的门) [英] pgr_astar and impossible edges (e.g., locked doors)

问题描述

我在 pgrouting 中使用 postgresql/PostGIS，我需要计算最短路径.在先前版本的 pgrouting 中，我使用的是 shortest_path_astar.在我的路由图中，我有不可能的部分，例如锁着的门.我用过:

I'm using postgresql / PostGIS with pgrouting and I need to compute the shortest path. In a previous version of pgrouting, I was using shortest_path_astar. In my routing graph I had impossible segments, such as locked doors. I used:

SELECT id FROM shortest_path_astar('SELECT edge_id AS id, vertex_id1 AS source, vertex_id2 AS target, ' || '(CASE WHEN door = ''S'' THEN -1.0  ELSE  (length)  )  END)::float8 AS cost, ' || '(CASE WHEN door_rev = ''S'' THEN -1.0  ELSE  (length)  )  END )::float8 AS reverse_cost, ' || 'x1, y1, x2, y2 FROM edges', origin_node, destination_node, TRUE, TRUE)

基本上:当门关闭时(门 = ''S'')，我将成本固定为 -1.在此函数的新版本 pgr_astar 之前，它一直运行良好.使用 pgr_astar 而不是 shortest_path_astar，这个查询会导致服务器崩溃.

Basically: when door is closed (door = ''S''), I fixed the cost to -1. It worked fine till the new version of this function, pgr_astar. With pgr_astar instead of shortest_path_astar, this query crashes the server.

如何更改我的函数以避免崩溃?

How can I change my function to avoid the crash?

推荐答案

我终于用上了pgr_bdAstar，双向A*最短路径.

I finally used pgr_bdAstar, bi-directional A* Shortest Path.

这篇关于pgr_astar 和不可能的边(例如，锁着的门)的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！