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

  • Elias K. XidiasEmail author


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 proposed approach, first, using an image of the Urban environment, we apply the A-star algorithm in order to construct a distance matrix between the depot and the customers and between the customers. Then, a Genetic 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 simultaneously respects the kinematical constraints of the vehicle and the linked constraints of the customers e.g. the time windows. The efficiency of the developed method is investigated and discussed through characteristic simulated experiments concerning a variety of operating weighted regions.


Urban environment Weighted regions Near-optimum paths Intelligent transportation systems Intelligent vehicle 


  1. 1.
  2. 2.
    Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM. 52(1), 25–53 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    LaValle, M.S.: Planning Algorithms. University of Illinois (2004)Google Scholar
  4. 4.
    Mitchell, S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of ACM. 38(1), 18–73 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Mata, C.S., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract). Proceedings of the thirteenth annual symposium on Computational geometry, pages. 264–273 (1997)Google Scholar
  6. 6.
    Reif, J., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. Algorithmic and Computational Robotics: New Directions: The Fourth Workshop on the Algorithmic Foundations of Robotics, page. 191, (2001)Google Scholar
  7. 7.
    E.K. Xidias, N.A. Aspragathos, “Path planning in weighted regions using the bump-surface concept”, In the Proceedings of the 2006 I*PROMS NoE Virtual International Conference on Intelligent Production Machines and SystemsGoogle Scholar
  8. 8.
    P. Azariadis and N. Aspragathos, “Obstacle Representation by Bump-Surface for Optimal Motion-Planning”, Journal of Robotics and Autonomous Systems, Vol 51/2–3, 129–150, 2005Google Scholar
  9. 9.
    Qiu, L., Hsu, W.-J., Huang, S.-Y., Wang, H.: Scheduling and routing algorithms for AGVs: a survey. Int. J. Prod. Res. 40(3), 745–760 (2002)CrossRefzbMATHGoogle Scholar
  10. 10.
    E.K. Xidias, A.C. Nearchou and N.A. Aspragathos, “Vehicle scheduling in 2D shop floor environments”, Ind. Robot. Vol.36 (2) Emerald, United Kingdom, 2009, pp. 176–183Google Scholar
  11. 11.
    Herrero-Pérez, D., Martínez-Barberá, H.: Modeling distributed transportation systems composed of flexible automated guided vehicles in flexible manufacturing systems. IEEE Transactions on Industrial Informatics. 6(2), 166–180 (May 2010)CrossRefGoogle Scholar
  12. 12.
    Vis, I.F.A.: Survey of research in the design and control of automated guided vehicle systems. Eur. J. Oper. Res. 170(3), 677–709 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Baker, E.: An exact algorithm for the time-constrained travelling salesman problem. Oper. Res. 31(5), 938–945 (1983)CrossRefzbMATHGoogle Scholar
  14. 14.
    Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Tsitsiklis, J.N.: Special cases of travelling salesman and repairman problems with time windows. Networks. 22(3), 263–282 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Ravi Raju, K., Krishnaiah Chetty, O.V.: Addressing design and control issues of AGV-based FMSs with petri net aided simulation. Comput. Integr. Manuf. Syst. 6(2), 125–134 (May 1993)CrossRefGoogle Scholar
  17. 17.
    Kavraki, L., Svestka, P., Latombe, J.C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. Proc. IEEE Int. Conf. on Robotics and Automation (ICRA). 566–580 (1996)Google Scholar
  18. 18.
    Vougioukas, S.G.: Optimization of robots paths computed by randomized planners. In: Proc. IEEE Int. Conf. On Robot. Automat., Barcelona, Spain, pp. 2160–2165 (2005)Google Scholar
  19. 19.
    H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press, Boston, 2005Google Scholar
  20. 20.
    Badawy, A., Mc Innes, C.R.: Robot motion planning using hyperboloid potential functions. In: Proc. of the World Congress on Engineering, London, UK, Vol. III, July, pp. 2–4 (2007)Google Scholar
  21. 21.
    Zhang, Sumin, et al. "Dynamic trajectory planning for vehicle autonomous driving." systems, man, and cybernetics (SMC), 2013 IEEE international conference on. IEEE, 2013Google Scholar
  22. 22.
  23. 23.
    Piegl, L., Wayne, T.: The NURBS Book. Springer-Verlag, Berlin Heidelberg (1997)CrossRefzbMATHGoogle Scholar
  24. 24.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Publishing Company (1989)Google Scholar
  25. 25.
    Xidias, E.K., Azariadis, P.N.: Mission design for a group of autonomous guided vehicles. Robot. Auton. Syst. 59(1), 34–43 (2011)CrossRefGoogle Scholar
  26. 26.
    Hwang, Y.K., Ahuja, N.: Gross motion planning – a survey. ACM Comput. Surv. 24(3), 219–291 (1992)CrossRefGoogle Scholar
  27. 27.
    Xiao, J., Michalewicz, Z.: An evolutionary computation approach to robot planning and navigation. In: Hirota, K., Fukuda, T. (eds.) Soft Computing in Mechatronics, Springer-Verlag, Heidelberg, Germany, pp. 117–128 (2000)Google Scholar
  28. 28.
    Nearchou, A.C.: The effect of various operators on the genetic search for large scheduling problems. Int. Journal of Production Economics. 88(2), 191–203 (2004)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Product & Systems Design EngineeringUniversity of the AegeanSyrosGreece

Personalised recommendations