Dynamic distributed lanes: motion planning for multiple autonomous vehicles
- 580 Downloads
Unorganized traffic is a generalized form of travel wherein vehicles do not adhere to any predefined lanes and can travel in-between lanes. Such travel is visible in a number of countries e.g. India, wherein it enables a higher traffic bandwidth, more overtaking and more efficient travel. These advantages are visible when the vehicles vary considerably in size and speed, in the absence of which the predefined lanes are near-optimal. Motion planning for multiple autonomous vehicles in unorganized traffic deals with deciding on the manner in which every vehicle travels, ensuring no collision either with each other or with static obstacles. In this paper the notion of predefined lanes is generalized to model unorganized travel for the purpose of planning vehicles travel. A uniform cost search is used for finding the optimal motion strategy of a vehicle, amidst the known travel plans of the other vehicles. The aim is to maximize the separation between the vehicles and static obstacles. The search is responsible for defining an optimal lane distribution among vehicles in the planning scenario. Clothoid curves are used for maintaining a lane or changing lanes. Experiments are performed by simulation over a set of challenging scenarios with a complex grid of obstacles. Additionally behaviours of overtaking, waiting for a vehicle to cross and following another vehicle are exhibited.
KeywordsAutonomous vehicles Robotics Graph search Planning Multi-robot path planning Multi-robotic systems
The authors wish to thank the Commonwealth Scholarship Commission in the United Kingdom and the British Council for their support of the first named author through the Commonwealth Scholarship and Fellowship Program (2010)—UK through award number INCS-2010-161.
- 4.Bishop R (2000) A survey of intelligent vehicle applications worldwide. In: Proceedings of the IEEE intelligent vehicles symposium, 2000. IV 2000, Oct 2000, pp 25–30 Google Scholar
- 5.Burchan Bayazit O, Lien J-M, Amato N (2002) Probabilistic roadmap motion planning for deformable objects. In: Proceedings of the IEEE international conference on robotics and automation. ICRA’02, vol 2, pp 2126–2133 Google Scholar
- 18.Leroy S, Laumond J, Siméon T (1999) Multiple path coordination for mobile robots: a geometric algorithm. In: Proceedings of the 16th international joint conf artificial intelligence, Stockholm, Sweden, pp 1118–1123 Google Scholar
- 24.Nilsson N (1971) Problem solving methods in artificial intelligence. McGraw-Hill, New York Google Scholar
- 26.Paruchuri P, Pullalarevu A, Karlapalem K (2002) Multi agent simulation of unorganized traffic. In: Proc ACM 1st intl jt conf autonomous agents and multiagent systems: part 1, New York, pp 176–183 Google Scholar
- 27.Peng J, Akella S (2003) Coordinating the motions of multiple robots with kinodynamic constraints. In: Proc IEEE international conference on robotics & automation, Taipei, Taiwan, pp 4066–4073 Google Scholar
- 32.Russell S, Norvig P (2010) Artificial intelligence: a modern approach. Prentice Hall, New York Google Scholar
- 33.Sánchez-Ante G, Latombe J (2002) Using a PRM planner to compare centralized and decoupled planning for multi-robot systems. In: Proceedings of the IEEE international conference on robotics and automation, Washington, DC, pp 2112–2119 Google Scholar
- 37.Tsugawa S (2002) Inter-vehicle communications and their applications to intelligent vehicles: an overview. In: IEEE intelligent vehicles symposium, 17–21 June 2002, vol 2, pp 564–569 Google Scholar