[Routing] Getting A* to prefer Motorways

[Stefan de Konink]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512

hubert schmid schreef:
> a different tree for cars, bicycles, etc. will not solve the
> turning restriction problem. The restriction depends on
> the link on which you are reaching the node. Normal Algos
> do just look for the best way away from the node, but do not 
> know on which link the node is reached. I think, it is not
> easy to keep this information while searching, but it is
> easy to extract the information (link-node-link) from the
> result path.

Aren't we looking in a directed graph situation? I know this can
increase the search space, but still it would solve the turning
restriction issue.




> For all other restriction-types, there are two possibilities:
> Create a new tree or manipulate the resits of the existing
> one. The second could be interesting for exotic restrictions,
> like 'only taxi', etc.

Yup. Based on requests I guess.


Currently in The Netherlands we are also considering routing on the
railway. With a bit of luck the "Nederlandse Spoorwegen" (Dutch
Railways) will be interested in hooking up.


Stefan
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.7 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFHCNpzYH1+F2Rqwn0RChVRAJ4v9ffO+ls6eQuzOO8bRWlhrfC/ZwCeOuRg
MhEQo66NYcnm3wxZSjbjjT0=
=Dljf
-----END PGP SIGNATURE-----