科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper presents an integrated framework for a suite of dynamic path planning algorithms for real time and concurrent movement of multiple robotic carts across a parking garage floor layout without driving lanes. Planning and search algorithms were formulated to address major aspects of automation for storage and retrieval of cars loaded onto robotic mobile carts. Path planning algorithms including A*, D* Lite and Uniform Cost Search were implemented and integrated within a unified framework to guide the robotic carts from a starting point to their destination during the storage and the retrieval processes. For the circumstances where there is no clear path for a car being stored or retrieved, a procedure was developed to unblock the obstacles in the path. A policy that minimizes obstructions was defined for assigning the parking spots on a given floor for arriving cars. Performance evaluation of the overall proposed system was done using a multithreaded software application. A variety of rectangular parking lot layouts including those with 20 x 20, 20 x 40, 30 x 40, and 40 x 40 parking spaces were considered in the simulation study. Performance metrics of path length, planning or search time and memory space requirements were monitored. Simulation results demonstrate that the proposed design facilitates near optimal paths, and is able to handle tens of concurrent requests in real time and in the presence of immobilized carts.
- 出版日期2015-3
