Abstract
A great deal of energy is wasted and lots of traffic jams occur since drivers repeated seeking the available lots to parking vehicle as lacking of information exchange between drivers and the vehicle park spot. In order to addressing the drawbacks of information islands, an improved ant colony algorithm (IACA) is proposed to allocate parking slots for autonomous valet parking vehicles. Compressed global pheromone and defined thresholds are the major improvements that avoids the reduction of global optimization ability and population diversity as falling into local optimal solutions due to the positive feedback effect in the late stage. In order to verify the effectiveness of the presented algorithm, two common test scenarios are designed and three comparison algorithms are developed, including first coming first serve (FCFS), normal ant colony algorithm and immune algorithm. The results show that all the four algorithms could complete the parking slots allocations. However, the cost of proposed algorithm is 13.2% lower than that of FCFS and the convergence speed is 94% higher than that of the normal ant colony algorithm, which means the proposed algorithm has strong generality and better global search ability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
