shootingstar (#18) - Complex Route (#256) - Message List

This query is specifically asking if the following is possible using the pgRouting shooting star methodology. I've tried for a number of days to implement the following on a large topology but with no consistent success, maybe because I don't fully understand how to implement all the network rules. Alternatively, I just can't see past my own cloud of confusion and the following is not possible, in which case I would really appreciate help to either get this solution working or hints on following an alternative direction.

The broad problem is dealing with defining a road network route based on photographically tagged gps tracks, i.e. each gps point on a given track has a photograph attached to it. I want to search a route but my constraints not only include direction and turning but also consistency. From reading the shooting star tutorials re contraints and especially the roundabouts issues I think it should be able to complete this task, I just can't seem to get it to work properly.

To define the problem I'll include a really simple version of the network and define all the constraints in text.

The sample topology, without constraints, is as follows: ***************************************************************************** CREATE TABLE "TopoTest?" (

id integer NOT NULL, "Detail" character varying(80), the_geom geometry, source integer, target integer, x1 double precision, y1 double precision, x2 double precision, y2 double precision, reverse_cost double precision, cost double precision DEFAULT 1 NOT NULL, to_cost double precision, rule text, gid integer, CONSTRAINT enforce_dims_the_geom CHECK ((ndims(the_geom) = 2)), CONSTRAINT enforce_geotype_the_geom CHECK (((geometrytype(the_geom) = 'LINESTRING'::text) OR (the_geom IS NULL))), CONSTRAINT enforce_srid_the_geom CHECK ((srid(the_geom) = 4326))

);

COPY "TopoTest?" (id, "Detail", the_geom, source, target, x1, y1, x2, y2, reverse_cost, cost, to_cost, rule, gid) FROM stdin; 0 R11 0102000020E610000002000000A08E7A498E5F1AC0A5F51C88C0B04A401427A6D2625F1AC01E87AA5FC8B04A40 1 2 -6.5933162194302497 53.38087560094872 -6.593150416747239 53.381114919915703 1 1 \N \N 0 1 R12 0102000020E610000003000000007F9E3B635F1AC01E87AA5FC8B04A403E7C952A1F5F1AC0D47A0EBCC4B04A409A40389CDF5E1AC0CFDB6CF6C9B04A40 2 3 -6.5931519809234942 53.381114919915703 -6.5926498803456983 53.381163409379603 1 1 \N \N 1 2 R13 0102000020E6100000020000009A40389CDF5E1AC0CFDB6CF6C9B04A4023816BBCB35E1AC00B75E308D3B04A40 3 4 -6.5926498803456983 53.381163409379603 -6.5924825134864333 53.381440268576704 1 1 \N \N 2 3 R21 0102000020E610000002000000BF5526CC925F1AC06CD34716D1B04A40007F9E3B635F1AC01E87AA5FC8B04A40 5 2 -6.5933334253690523 53.381380829879021 -6.5931519809234942 53.381114919915703 1 1 \N \N 3 4 R22 0102000020E610000003000000ECD696A4635F1AC01E87AA5FC8B04A40ED71B70E2B5F1AC07367CACECBB04A409A40389CDF5E1AC0CFDB6CF6C9B04A40 2 3 -6.5931535450997494 53.381114919915703 -6.5926498803456983 53.381163409379603 1 1 \N \N 4 5 R23 0102000020E6100000020000009A40389CDF5E1AC0CFDB6CF6C9B04A4036933213A95E1AC0818FCF3FC1B04A40 3 6 -6.5926498803456983 53.381163409379603 -6.5924418449038082 53.380897499416285 1 1 \N \N 5 \.

ALTER TABLE ONLY "TopoTest?"

ADD CONSTRAINT "TopoTest?_pkey" PRIMARY KEY (id);

*****************************************************************************

This topology defines two GPS tracks R1, in line sections R11, R12 and R13, and R2, in line sections R21, R22, R23. I've built the lines to define where the track intersections fall. Both tracks are related to a series of photographs and both have different temporal periods. Sections R12 and R22 have the same physical geography, I just defined them differently to control the route consistency issues.

Constraints are as follows: If I want to travel from R21 to R23 I want to ensure I go through R22, same idea for route1. Both routes have no forward or reverse costs so going from R12 to R13 through R12 should be the same result as going in reverse. In these cases I was trying to define rules where going from R12 to R13 would have a high to_cost for R22 thus forcing the route through R12. Should this work and if so does it need to be duplicated for the reverse direction?

Next, a constraint exists where you cannot traverse right from R21 to R11 and left from R11 to R21. Not sure if this can be done with only one intersection to build the rule on, I can't make it work based on the tutorial example.

Next and last constraint involves searching across different routes. I want to maintain the start route through the network until it is no longer available. Example: Route from R21 to R13 should go through R22, whereas route from R13 to R21 should go through R12 etc. Thus the start route is maintained through the network for as long as it is available.

Any help, advice or information would be greatly appreciated, especially in consideration that the real network is alot more complex with many more R12/R22 type topology section included.