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 urbanenvironment clutteredwith weighted regions. The vehicle is requested to move from its depot, passing through a predefined set ofcustomers and return back to its depot. In the proposed approach, first, using an image of the Urban environment, we apply the Astaralgorithm in order to construct a distance matrix between the depot and the customers and between the customers. Then, aGenetic Algorithm with special encoding is used to search for a near-optimum solution. The objective consists of designing a(near-)optimum path for an intelligent vehicle so that all the customers are served as soon as possible while simultaneouslyrespects the kinematical constraints of the vehicle and the linked constraints of the customers e.g. the time windows. Theefficiency of the developed method is investigated and discussed through characteristic simulated experiments concerning avariety of operating weighted regions.