Advertisement

Evolving Systems

, Volume 10, Issue 1, pp 3–11 | Cite as

Heuristic and metaheuristic solutions of pickup and delivery problem for self-driving taxi routing

  • Viacheslav Shalamov
  • Andrey FilchenkovEmail author
  • Anatoly Shalyto
Original Paper
  • 106 Downloads

Abstract

Self-driving car automated control problem includes automated routing problem. This paper addresses the self-driving taxi routing problem formalized as the Pickup and Delivery problem (PDP). We use small moves technique as the basis for our evolutionary computation framework that considers small moves as mutation operations. We introduce strategies, which determine vector of probabilities to apply small moves on each step. Also we introduce policies, which determine how strategies evolve during the algorithm runtime. Finally, we also apply meta-learning to select the best strategy and policy for a given dataset. We test suggested methods with several genetic schemes. The best performance is shown by strategies that apply small moves with probability depending on its success rate and/or complexity. It outperforms Hill Climbing as well as a constraint satisfaction problem solver adopted for PDP.

Keywords

Self-driving car Autonomous car Routing Pickup and delivery Genetic algorithms City taxi Meta-learning 

Notes

Acknowledgements

Authors would like to thank Ivan Smetannikov, Sergey Muravyov, Valeria Efimova and Daniil Chivilikhin for useful comments. The meta-learning based method suggested in the paper was developed under the research project financially supported by the Russian Foundation for Basic Research, Grant 16-37-60115 mol_a_dk. The reinforcement learning based method suggested in the paper was developed under the research project financially supported by the Government of the Russian Federation, Grant~074-U01. All other suggested methods and the developed framework were obtained under the research project supported by the Ministry of Education and Science of the Russian Federation, Project No 2.8866.2017/8.9.

References

  1. Ackerman M, Adolfsson A, Brownstein N (2016) An effective and efficient approach for clusterability evaluation. arXiv:160206687
  2. Alur R (2015) Principles of cyber-physical systems. MIT Press, CambridgeGoogle Scholar
  3. Bender P, Tas OS, Ziegler J, Stiller C (2015) The combinatorial aspect of motion planning: maneuver variants in structured environments. In: IEEE intelligent vehicles symposium (IV). IEEE, pp 1386–1392Google Scholar
  4. Brazdil P, Carrier CG, Soares C, Vilalta R (2008) Metalearning: applications to data mining. Springer Science & Business Media, New YorkzbMATHGoogle Scholar
  5. Broggi A, Bombini L, Cattani S, Cerri P, Fedriga R (2010) Sensing requirements for a 13,000 km intercontinental autonomous drive. In: IEEE intelligent vehicles symposium (IV). IEEE, pp 500–505Google Scholar
  6. Carrabs F, Cordeau JF, Laporte G (2007) Variable neighborhood search for the pickup and delivery traveling salesman problem with lifo loading. INFORMS J Comput 19(4):618–632MathSciNetCrossRefzbMATHGoogle Scholar
  7. Cheang B, Gao X, Lim A, Qin H, Zhu W (2012) Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur J Oper Res 223:60–75MathSciNetCrossRefzbMATHGoogle Scholar
  8. Chong Z, Qin B, Bandyopadhyay T, Wongpiromsarn T, Rebsamen B, Dai P, Rankin E, Ang Jr MH (2013) Autonomy for mobility on demand. In: Intelligent autonomous systems, vol 12. Springer, New York, pp 671–682Google Scholar
  9. Chu K, Lee M, Sunwoo M (2012) Local path planning for off-road autonomous driving with avoidance of static obstacles. IEEE Trans Intell Transp Syst 13(4):1599–1616CrossRefGoogle Scholar
  10. Cordeau JF, Laporte G, Ropke S (2008) The vehicle routing problem: latest advances and new challenges, chap, Recent models and algorithms for one-to-one pickup and delivery problems. Springer US, pp 327–357Google Scholar
  11. Dallegro JA (2014) How google’s self-driving car will change everything. http://www.investopedia.com/articles/investing/052014/how-googles-selfdriving-car-will-change-everything.asp. Accessed 15 Feb 2016
  12. Davies A (2014) Baidu’s self-driving car has hit the road. http://www.wired.com/2015/12/baidus-self-driving-car-has-hit-the-road/. Accessed 15 Feb 2016
  13. Dolgov D, Thrun S, Montemerlo M, Diebel J (2010) Path planning for autonomous vehicles in unknown semi-structured environments. Int J Robot Res 29(5):485–501CrossRefGoogle Scholar
  14. Efimova V, Filchenkov A, Shalyto A (2016) Reinforcement-based simultaneous algorithm and its hyperparameters selection. arXiv:161102053
  15. Ercan Z, Sezer V, Heceoglu H, Dikilitas C, Gokasan M, Mugan A, Bogosyan S (2011) Multi-sensor data fusion of dcm based orientation estimation for land vehicles. In: Proceedings of the IEEE international conference on mechatronics (ICM). IEEE, pp 672–677Google Scholar
  16. Giraud-Carrier C (2008) Metalearning—a tutorial. In: Tutorial at the 7th international conference on machine learning and applications (ICMLA), San DiegoGoogle Scholar
  17. Göhring D, Wang M, Schnürmacher M, Ganjineh T (2011) Radar/lidar sensor fusion for car-following on highways. In: Proceedings of the 5th international conference on automation, robotics and applications (ICARA). IEEE, pp 407–412Google Scholar
  18. González D, Perez J, Lattarulo R, Milanés V, Nashashibi F (2014) Continuous curvature planning with obstacle avoidance capabilities in urban scenarios. In: Proceedings of the IEEE 17th international conference on intelligent transportation systems (ITSC). IEEE, pp 1430–1435Google Scholar
  19. Hawkins AJ (2015) Google vs. uber and the race to self-driving taxis. http://www.theverge.com/2015/12/16/10309960/google-vs-uber-competition-self-driving-cars. Accessed 15 Feb 2016
  20. Hosny MI (2010) Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems. Cardiff University, CardiffGoogle Scholar
  21. Intel (2017) Interl core i74600u. http://cpuboss.com/cpu/Intel-Core-i7-4600U. Accessed 17 June 2017
  22. Iori M, Martello S (2010) Routing problems with loading constraints. Top 18:4–27MathSciNetCrossRefzbMATHGoogle Scholar
  23. Jafri SH, Kala R (2016) Path planning of a mobile robot in outdoor terrain. In: Intelligent systems technologies and applications. Springer, New York, pp 187–195Google Scholar
  24. Jo K, Sunwoo M (2014) Generation of a precise roadway map for autonomous cars. IEEE Trans Intell Transp Syst 15(3):925–937CrossRefGoogle Scholar
  25. Jo K, Kim J, Kim D, Jang C, Sunwoo M (2014) Development of autonomous car—part I: distributed system architecture and development process. IEEE Trans Ind Electron 61(12):7131–7140CrossRefGoogle Scholar
  26. Kala R, Warwick K (2013) Planning autonomous vehicles in the absence of speed lanes using an elastic strip. IEEE Trans Intell Transp Syst 14(4):1743–1752CrossRefGoogle Scholar
  27. Kim J, Kim H, Lakshmanan K, Rajkumar RR (2013) Parallel scheduling for cyber-physical systems: analysis and case study on a self-driving car. In: Proceedings of the ACM/IEEE 4th international conference on cyber-physical systems. ACM, pp 31–40Google Scholar
  28. Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358MathSciNetCrossRefzbMATHGoogle Scholar
  29. Li X, Sun Z, Kurt A, Zhu Q (2014) A sampling-based local trajectory planner for autonomous driving along a reference path. In: Intelligent vehicles symposium proceedings. IEEE, pp 376–381Google Scholar
  30. Martínez-Barberá H, Herrero-Pérez D (2014) Multilayer distributed intelligent control of an autonomous car. Transp Res Part C Emerg Technol 39:94–112CrossRefGoogle Scholar
  31. Opturion (2017) Opturion cpx csp solver. http://www.opturion.com/. Accessed 17 June 2017
  32. Parc CF (2014) Mobility-as-a-service: yurning transportation into a software industry. http://venturebeat.com/2014/12/13/mobility-as-a-service-turning-transportation-into-a-software-industry/. Accessed 15 Feb 2016
  33. Pérez J, Milanés V, Onieva E (2011) Cascade architecture for lateral control in autonomous vehicles. IEEE Trans Intell Transp Syst 12(1):73–82CrossRefGoogle Scholar
  34. Pollaris H, Braekers K, Caris A, Janssens G, Limbourg S (2015) Vehicle routing problems with loading constraints: state-of-the-art and future directions. OR Spectrum 37:297–330MathSciNetCrossRefzbMATHGoogle Scholar
  35. Savelsbergh MW, Sol M (1995) The general pickup and delivery problem. Transp Sci 29(1):17–29CrossRefzbMATHGoogle Scholar
  36. Schreiber M, Hellmund AM, Stiller C (2015) Multi-drive feature association for automated map generation using low-cost sensor data. In: IEEE intelligent vehicles symposium (IV). IEEE, pp 1140–1147Google Scholar
  37. Shalamov V, Filchenkov A, Chivilikhin D (2016a) Small-moves based mutation for pick-up and delivery problem. In: Proceedings of the companion publication of the 2016 on genetic and evolutionary computation conference. ACM (in press) Google Scholar
  38. Shalamov V, Filchenkov A, Shalyto A (2016b) Genetic search of pickup and delivery problem solutions for self-driving taxi routing. In: Proceedings of the IFIP international conference on artificial intelligence applications and innovations. Springer, New York, pp 348–355Google Scholar
  39. Sun Q (2013) Fantail mlkit. http://fantail.quansun.com/. Accessed 14 Jan 2017
  40. Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT Press, CambridgezbMATHGoogle Scholar
  41. Tanzmeister G, Friedl M, Wollherr D, Buss M (2014) Efficient evaluation of collisions and costs on grid maps for autonomous vehicle motion planning. IEEE Trans Intell Transp Syst 15(5):2249–2260CrossRefGoogle Scholar
  42. Taylor M (2016) Apple confirms it is working on self-driving cars. https://www.theguardian.com/technology/2016/dec/04/apple-confirms-it-is-working-on-self-driving-cars. Accessed 20 Jan 2017
  43. Valencia R, Morta M, Andrade-Cetto J, Porta JM (2013) Planning reliable paths with pose slam. IEEE Trans Robot 29(4):1050–1059CrossRefGoogle Scholar
  44. Wolpert DH (1996) The lack of a priori distinctions between learning algorithms. Neural Comput 8(7):1341–1390CrossRefGoogle Scholar
  45. Wolpert DH (2000) Any two learning algorithms are (almost) exactly identical, Technical Report. NASA Ames Research CenterGoogle Scholar
  46. Wolpert DH, Macready WG, et al (1995) No free lunch theorems for search, Technical Report SFI-TR-95-02-010. Santa Fe InstituteGoogle Scholar
  47. Yuen SY, Chow CK, Zhang X (2013) Which algorithm should i choose at any point of the search: an evolutionary portfolio approach. In: Proceedings of the 15th annual conference on Genetic and evolutionary computation. ACM, pp 567–574Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  • Viacheslav Shalamov
    • 1
  • Andrey Filchenkov
    • 1
    Email author
  • Anatoly Shalyto
    • 1
  1. 1.Computer Technologies LaboratoryITMO UniversitySt. PetersburgRussia

Personalised recommendations