Search Results

The past decade has witnessed the rapid development of autonomous parking technology, since it has promising capacity to improve traffic efficiency and reduce the burden on drivers. However, it is prone to the trap of self-centeredness when each vehicle is automated parking in isolation. And it is easy to cause traffic congestion and even chaos when multiple autonomous vehicles require of parking into the same lot. In order to address the multiple vehicle parking problem, we propose a parking planning method with genetic algorithm. Firstly, an optimal mathematic model is established to describe the multiple autonomous vehicle parking problem. Secondly, a genetic algorithm is designed to solve the optimization problem. Thirdly, illustrative examples are developed to verify the parking planner. The performance of the present method indicates its competence in addressing parking multiple autonomous vehicles problem.

In recent years, intelligent driving technology is being extensively studied. This paper proposes a path planning method for perpendicular parking based on vehicle kinematics model using MPC optimization, which aims to solve the perpendicular parking task. Firstly, in the case of any initial position and orientation of the vehicle, judging whether the vehicle can be parked at one step according to the location of the parking place and the width of the lane, and then calculating the starting position for parking, and use the Bezier curve to connect the initial position and the starting position. Secondly, reference parking path is calculated according to the collision constraints of the parking space. Finally, because the parking path based on the vehicle kinematics model is composed of circle arcs and straight lines, the curvature of the path is discontinuous. The reference parking path is optimized using Model Predictive Control (MPC).

Although autonomous valet parking technology can replace the driver to complete the parking operation, it is easy to cause traffic chaos in the case of lacking scheduling for multiple parking agents, especially when multiple cars compete for the same parking slot at the same time. Therefore, in order to ensure orderly traffic and parking safety, it is necessary to allocate parking slots reasonably for multiple autonomous valet parking vehicles. The parking slots allocation model is built as an optimal problem with constraints. Both parking mileage cost and parking difficult cost are considering at the objective function in the optimization problem. There are three types of constraints. The first is the capacity limit of a single parking slot, the second is the space limit occupied by a single vehicle, and the third is the total capacity limit of the parking lot. After establishing parking slots allocation model, the immune algorithm is coded to solve the problem.

A tractor-trailer vehicle (TTV) consists of an actuated tractor attached with several full trailers. Because of its nonlinear and noncompleted constraints, it is a challenging task to avoid collisions for path planner. In this paper, we propose an efficient method to plan an optimal trajectory for TTV to reach the destination without any collision. To deal with the complicated constraints, the trajectory planning problem is formulated as an optimal control problem uniformly, which can be solved by the interior point method. A novel incremental optimization solving algorithm (IOSA) is proposed to accelerate the optimization process, which makes the number of trailers and the size of obstacles increase asynchronously. Simulation experiments are carried out in two scenarios with static obstacles. Compared with other methods, the results show that the planning method with IOSA outperforms in the efficiency.