مرکز منطقه ای اطلاع رساني علوم و فناوري - An efficient algorithm for computing least cost paths with turn constraints

Title of article :

An efficient algorithm for computing least cost paths with turn constraints

Author/Authors :

Ali Boroujerdi، نويسنده , , Jeffrey Uhlmann، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1998

Pages :

From page :

317

To page :

321

Keywords :

Dijkstraיs algorithm , Least cost paths , computational complexity , Turn constraints , routing , Range searching , shortest paths

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128957

Link To Document :