Refine Your Search

Search Results

Viewing 1 to 4 of 4
Technical Paper

A Steerable Curvature Approach for Efficient Executable Path Planning for on-Road Autonomous Vehicle

2019-04-02
2019-01-0675
A rapid path-planning algorithm that generates drivable paths for an autonomous vehicle operating in structural road is proposed in this paper. Cubic B-spline curve is adopted to generating smooth path for continuous curvature and, more, parametric basic points of the spline is adjusted to controlling the curvature extremum for kinematic constraints on vehicle. Other than previous approaches such as inverse kinematics, model-based prediction postprocess approach or closed-loop forward simulation, using the kinematics model in each iteration of path for smoothing and controlling curvature leading to time consumption increasing, our method characterized the vehicle curvature constraint by the minimum length of segment line, which synchronously realized constraint and smooth for generating path. And Differ from the path of robot escaping from a maze, the intelligent vehicle traveling on road in structured environments needs to meet the traffic rules.
Technical Paper

Decision-Making for Intelligent Vehicle Considering Uncertainty of Road Adhesion Coefficient Estimation: Autonomous Emergency Braking Case

2020-10-29
2020-01-5109
Since data processing methods could not completely eliminate the uncertainty of signals, it is a key issue for stable and robust decision-making for uncertainty tolerance of intelligent vehicles. In this paper, a decision-making for an Autonomous Emergency Braking (AEB) case considering the uncertainty of road adhesion coefficient estimation (RACE) is proposed. Firstly, the 3σ criterion is employed to classify the confidence in order to establish the decision-making mechanism considering the signal uncertainty of RACE. Secondly, the model for AEB with the uncertainty of the road adhesion coefficient estimated is designed based on the Seungwuk Moon model. Thirdly, a CCRs and CCRm scenario was designed to verify the feasibility in reference to the European New Car Assessment Programme (Euro NCAP) standard. Finally, the results of 10,000 cycles test illustrate that the proposed method is stable and could significantly improve the safety confidence both in the CCRs and CCRm scenarios.
Technical Paper

Parking Planning with Genetic Algorithm for Multiple Autonomous Vehicles

2022-03-29
2022-01-0087
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.
Technical Paper

Parking Slots Allocation for Multiple Autonomous Valet Parking Vehicles

2022-03-29
2022-01-0148
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.
X