![]() ![]() |
![]() | ![]() ![]() ![]() |
Lorenzo Mandow, José Luis Pérez-de-la-Cruz
The road layout problem consists of finding a valid road layout between two locations described by their azimut and tridimensional coordinates in a topographical map. Valid layouts should comply with certain road design regulations that normally depend on design parameters such as road speed and type (e.g. highway, or conventional road). The paper presents a discrete state space for this problem that approximates real layouts, and discusses heuristic estimates that allow searching for the shortest approximation in such space using the A* heuristic search algorithm.
Keywords: Design, Search
Citation: Lorenzo Mandow, José Luis Pérez-de-la-Cruz: MODEL AND HEURISTICS FOR THE SHORTEST ROAD LAYOUT PROBLEM. In R.López de Mántaras and L.Saitta (eds.): ECAI2004, Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2004, pp.740-744.
![]() ![]() ![]() |