[Routing] Searching for ShootingStar -algorithm

[Anton Patrushev]

Hi Marcus,

It sounds interesting and if I only have some time I will check it.
By the way, do you have any papers? :)

Anton.

On Tue, Mar 24, 2009 at 4:48 PM, Marcus Wolschon <Marcus at wolschon.biz> wrote:
> On Tue, 24 Mar 2009 10:19:35 +0900, Anton Patrushev <anton at orkney.co.jp>
> wrote:
>> Hi Marcus,
>>
>> I believe that if I don't have a description than nobody has it. And
>> unfortunately I don't have any :(
>> I can give you some hints and ideas, but I never had time to make any
>> kind of scientific papers.
>>
>> Shooting* is edge-based, so it goes from edge to edge while A* and
>> Dijkstra go vrom vertex to vertex. Thus you need a data structure
> ...
>> So, that's an idea behind the Shooting*.
>>
>> I am ready to help you with your implementation, so please contact me
>> if you need any help.
>
> Thanks Anton,
>
> I just manages an implementation of edge-based routing here:
> http://apps.sourceforge.net/mediawiki/travelingsales/index.php?title=Plugin/TurnRestrictedMultiTargetDijkstraRouter
>
> It seems to work fine however much testing remains before I can release
> it as the new default routing-engine.
>
> Marcus
>
> _______________________________________________
> Routing mailing list
> Routing at openstreetmap.org
> http://lists.openstreetmap.org/listinfo/routing
>