On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle

This paper describes an approach for designing a (near-)optimum path for an intelligent vehicle which is moving in an urban environment cluttered with weighted regions. The vehicle is requested to move from its depot, passing through a predefined set of customers and return back to its depot. In the...

Ausführliche Beschreibung