Next Article in Journal
Lane Mark Detection with Pre-Aligned Spatial-Temporal Attention
Previous Article in Journal
Mobile Contactless Fingerprint Recognition: Implementation, Performance and Usability Aspects
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Minimum Parking Space Required by Automatic Parallel Parking

School of Computer and Information, Hefei University of Technology, Hefei 230009, China
*
Author to whom correspondence should be addressed.
Sensors 2022, 22(3), 795; https://doi.org/10.3390/s22030795
Submission received: 25 November 2021 / Revised: 12 January 2022 / Accepted: 15 January 2022 / Published: 20 January 2022
(This article belongs to the Section Sensor Networks)

Abstract

:
Automatic parking system has been widely equipped on manual driving vehicles for decades. Due to the limited environment sensing ability and not-accurate-enough positioning system, however, it usually requires a very large redundant space for a car to accomplish one successful parking maneuver. There would be two differences in the coming era of automatic driving: (1) sufficiently accurate perception and positioning systems can be expected to be available, and (2) the number of parking trials could be large when parking without passengers on the vehicle. Under such circumstances, it is quite important for the vehicle to know exactly whether the external and internal spaces are large enough for parking and how the minimum number of trials will be required. This paper presents closed-form solutions of minimum internal and external space required for automatic parallel parking and the corresponding trials if the parking is based on circular arcs. On the other hand, it is also very useful for the vehicle to know the required minimum space if only one trial is allowed, for which the solutions are presented both for circular arcs and continuous-curvature curves based parking, respectively. To the best of our knowledge, there is no so far systematic analysis and research on the issue addressed in this paper.

1. Introduction

In populated big cities like Beijing, Tokyo, Shanghai, etc., the rapid growth in car ownership not only increases the burden of urban traffic but also exacerbates the problem of insufficient road-side parking space. In the whole driving process, for drivers, parking is often the most difficult part, especially in the case that available parking space is relatively narrow, which is easy to cause minor collisions and scuffing [1,2]. According to statistics, 23% of car accidents are related to parking collisions [3]. In this sense, automatic parking is deemed as the most promising technology to solve these problems [4,5]. An efficient automatic parking system can free the driver from the pressure of parking operation and complete the parking maneuver quickly, while greatly reducing the probability of accidents during the process.
The existing automatic parking system is often designed for non-fully automatic fuel vehicles, which still have some issues to be tackled. Due to the imperfection of the system’s parking space detection, real-time environmental perception capabilities, and accuracy in vehicle control, it is often necessary to add some redundant space for parking space to ensure that the vehicle does not collide or scuff with the parking boundary or surrounding obstacles [6,7]. That is to say, the existing parking slots provided in cities are usually larger than the vehicle demand in theory. With the development of Intelligent Transportation System (ITS), the future fully-automatic intelligent vehicles can obtain more detailed and accurate information of parking slot and surrounding obstacle from the road-side units (RSU) [8,9], and with the assistance of more advanced radar and video detection technology, the accuracy of parking space detection and distance measurement will be effectively improved [10]. Besides, the accuracy of future fully-automatic intelligent vehicles in terms of trajectory tracking and control will be much more precise than the traditional manually driven vehicles or semi-autonomous vehicles [11]. In this context, the automatic parking system can complete parking operations safely and precisely and thus the requirement for redundant space can be greatly reduced. For example, the driver can stay outside and park the vehicle remotely. In this case, the complexity of the parking trajectory and driving comfort are not the key matters. What we really care about is the minimum space required for the parking task. Meanwhile, the parking space as a system target can be composed of parking slot-markings on the road surface or be created as a form of open spaces without the slot-markings by adjacent obstacles such as vehicles, walls, or curbs. As long as the target space is greater than the minimum space required by automatic parking, the space can be used to complete the parking task, which will improve the utilization of the open space. In addition, due to the limited road space, the space available for the vehicle to adjust its attitude before entering the parking space is very limited on narrow roads, and thus the determination and calculation of this part of space is also quite necessary. Consequently, the determination and calculation of the minimum internal and external parking space required for automatic parking (internal space refers to the size of the parking slot and external space refers to the space occupied during the parking maneuver before the vehicle enters the parking slot) is an essential prerequisite for future automatic parking systems.

1.1. Related Works

Since automatic parallel parking is more challenging than perpendicular parking and skewed parking in calculating the minimum parking space, and more importantly, the shortage of roadside parking resources is more serious, in order to reduce the occupation of road space, most roadside parking spaces are designed as parallel parking slots. Thus, this paper discusses the minimum internal and external space required for automatic parallel parking and gives an analytical solution with closed-form for the minimum space required for some typical parking methods. The analysis of the minimum parking space is usually based on parking methods where easy geometric equations are involved. Some researchers have constructed parking trajectories based on mathematical models of classical curves [12,13,14,15] and gave solutions for the space required for their parking methods. In [16], the minimum length of parking slot required for parking based on admissible circular arcs was investigated. The minimum slot depends on the initial position of the vehicle, which leads to a conclusion that is not generalizable. As the research progressed, [17] used the geometric method based on the reverse procedure of retrieving a vehicle from the parking slot proposed by [18] to give the minimum length of parking slot, which only depends on the characteristics of the vehicle. This conclusion is general and based on the assumption that the turning radius of the second part of the parking maneuver is the minimum turning radius, whereas the radius of the first part can be any value greater than the minimum one. But the drawback is that the width of the parking slot is regarded as equal to the width of the vehicle, which does not take into account the necessity for lateral obstacle avoidance during vehicle movement and is clearly unreasonable. Later in [19], this drawback was considered and a solution for the minimum width of the parking slot was given. It should be emphasized that these conclusions are both based on the assumption that vehicle only parks in one trial (without longitudinal velocity sign-changing) and the parking trajectories are composed of admissible circle arcs. After that, [20] considered the longitudinal and lateral safety redundancy distances of parking slot, and when the redundancy distance takes the value of 0, the minimum parking slot is consistent with the conclusions given by [19]. However, it is such a pity that all the papers mentioned above only consider the minimum parking slot (i.e., internal parking space), without taking into account the need for external parking space.
These methods based on admissible circular arcs have the disadvantage of discontinuous curvature. When faced with the curvature discontinuity point, the vehicle must stop and reorient the front wheel, which will involve undesirable time delay and damage to the steering column. Therefore, some smooth curves were introduced, which can be divided into two categories. One is parametric curves whose curvature is a polynomial function of their arc length, e.g., clothoids [15,21], cubic spirals [22], or more recent η 4 - spline [23]. The other is the curves whose coordinates can be expressed in a closed-form, e.g., B-splines [24], quintic polynomials [25], or polar-splines [26]. The former category is used more often. Ref. [27] proposed the first continuous curvature path planner that considers the maximum curvature derivative constraint, and the curves generated by this planner are called Simple Continues Curvature (SCC) curves. In [28], the range of values for the minimum parking slot length required for parking based on SCC curves was given, but the minimum parking slot width is not discussed. Later in [29], the authors introduced a linearly steering spiral to the Reeds and Sheep (RS) curve [12] to generate a smooth path for parking and discussed the minimum length of parking slot in two cases according to whether the curvature of the path at the end of the parking is 0 or not, and the corresponding conclusion was given.
In the work of defining and calculating the minimum parking space, these aforementioned papers only intuitively consider the limitation of the length of the parking slot, without considering the width of the parking slot and the external parking space, which are also very important for automatic parallel parking systems. In addition, all their conclusions are given on the premise that the vehicle must be parked into slot in one trial. In practice, however, n-trial ( n > 1 ) and one-trial parking are both significant. If comfort or convenience is the first concern, one-trial parking is more suitable; while if space-saving is the first concern, n-trial parking is absolutely necessary [30]. Nevertheless, no researcher has systematically studied the parking space required for n-trial parking. In view of this, the study of the minimum space required by automatic parallel parking still has huge room for enhancement.

1.2. Contributions of This Paper

This paper fills the gap in the solution of parking space for the previous related works. The solution of parking slot width and the external parking space is often neglected by researchers. In this paper, the internal and external space required for n-trial parking and the neglected parts for typical one-trial parking methods are solved systematically. The results are presented as closed-form solutions and are only related to the characteristics and mechanical properties of the vehicle, which can be widely extended to different practical application scenarios. At last, the minimum parking space required for the various parking methods discussed in this paper is compared, and suggestions are made for selecting specific parking methods based on actual parking needs.
The contributions of this paper are as follows:
  • Considering the extreme case that the number of trials is unbounded, we derive the minimum internal and external space required for n-trial automatic parallel parking based on circular arcs with closed form. The optimal n is given, and it is shown that the lower limits of the minimum internal and external space both approximate the size of the vehicle.
  • Considering the extreme case that only one trial is allowed, we give the minimum internal and external space required for automatic parallel parking based on circular arcs and continuous-curvature curves, respectively. It is shown that although the continuous-curvature curve has more smooth transition for path than circular arc, it requires larger space for parking.
  • The minimum internal and external spaces that are derived can be the guidelines for urban planners to design right-sized parking slots, and for vehicles to estimate whether a certain piece of space is sufficient for automatic parking with its preferred parking methods.
The rest of this paper is organized as follows. In Section 2, some preliminary definitions are given and the geometric models related to the kinematics of the vehicle are presented. Section 3 gives the minimum internal and external space required for n-trial automatic parallel parking based on circular arcs. In Section 4 and Section 5, the minimum internal and external space required for one-trial parking based on circular arcs and continuous-curvature curves are given, respectively. Finally, Section 6 contains the conclusions.

2. Preliminary Modeling

2.1. Simplified Model of Vehicle and Parking Slot

The vehicles studied in this paper are small and medium-sized cars such as Compact, Hatchback, Sedan, etc., whose outer contours can be approximately modeled as a rectangle, including the outside rear-view mirrors. The vehicle is symmetric around the central axis. The maximum left steering angle is equal to the maximum right steering angle, so that the vehicle has the same left and right turning radius. The parking slot is a rectangular area with three-side barriers. The external space required for parking is also considered as a rectangular area for simplicity. The initial posture of the vehicle is assumed to be parallel to the parking slot. The whole parking maneuver should be within both the parking slot (no collision with barriers) and the external rectangular area.
As shown in Figure 1, the four vertices of the vehicle rectangle are respectively represented by A , B , C , and D ( A is the right front corner). The length and width of the vehicle rectangle is L v and W v , respectively; the wheelbase is L w and the track is L b ; the front overhang is L f h and the rear is L b h ; the midpoint of the rear axle of the vehicle is denoted as P , which is referred to as the reference point.

2.2. Kinematic Model of Vehicle

The kinematic model of the vehicle is usually used to analyze the motion state of the vehicle during the parking maneuver. The parking process is usually performed at low speed, assuming that the vehicle is absolutely rigid body, in regardless of the effect of tire slippage. In addition, two front wheels are directional and the rear wheel’s axle is fixed with the vehicle body. The motion of the vehicle conforms to Ackermann steering geometry at any moment. Therefore, all wheels turn around the instantaneous center of the rotation (denoted as O l / O r for left/right steering), which is on the line collinear with the rear axle of the vehicle. The distance from the reference point P to the instantaneous center of rotation is the instantaneous turning radius, denoted as R p . The motion model of the vehicle can be expressed as
( x ˙ y ˙ θ ˙ k ˙ ) = ( cos θ sin θ k 0 ) v + ( 0 0 0 1 ) σ
where ( x , y ) is the position of the reference point; θ represents the orientation of the vehicle and k indicates the curvature, which is the inverse of the turning radius. ( x ˙ , y ˙ , θ ˙ and k ˙ are the derivatives of x , y , θ , k with respect to time t ) The two inputs v and σ are the longitudinal velocity and the angular acceleration at the reference point ( x , y ) respectively. Denote the steering angle as δ and its derivative as δ ˙ . Then the following relationship can be obtained:
k = tan δ L w = 1 R p ,   σ = k ˙ = δ ˙ L w cos 2 δ   .
Obviously, when the vehicle moves at a constant steering angle, then k is fixed and there is k ˙ = 0 . The trajectory of the vehicle follows a circle arc. Consequently, the motion model can be simplified to
( x ˙ y ˙ θ ˙ ) = ( cos θ sin θ tan δ L w ) v
It can be observed from (2) that if the steering angle reaches the upper bound δ max , then the turning radius of the reference point reaches the minimum, denoted as R p min . Indeed, R p min is just the minimum turning radius of the vehicle in this paper, which can be expressed as
R min = R p min = L w tan δ max

3. Minimum Space for N-Trial Parking Based on Circle Arcs

In some cases, n-trial parking is needed for space saving. In this section, we explore the theoretical minimum space required for automatic parallel parking based on circular arcs, with unbounded number of trials. Here a trial refers to an S-shaped forward or backward movement, the trajectory of which is composed by two symmetric circle arcs. First, it is assumed that the vehicle is located just alongside the bottom of the parking slot as the initial posture, as shown in Figure 2a. At the end of each movement, the vehicle is parallel to the parking slot. Each movement produces a certain lateral displacement, and eventually the vehicle can be completely parked into the slot after multiple phases of displacement. In order to maximize the lateral displacement of each movement, the steering angle is set to δ max , i.e., the radius of every circle arc is R min . Based on these assumptions, the theoretical minimum internal and external space required for automatic parallel parking can be obtained, which is given in Theorem 1.
Theorem 1.
The minimum internal and external space required for automatic parallel parking based on circular arcs can be obtained by the following formula:
L s l o t min = L e x t e r min = L v + Δ s , W s l o t min = W v + Δ l e f t + Δ r i g h t = { 2 ( W v 2 ( R min R min 2 ( Δ s / 2 ) 2 ) 1 2 ) ( R min R min 2 ( Δ s / 2 ) 2 ) + W v R min 2 ( Δ s / 2 ) 2 2 R min + ( L v L b h ) Δ s 2 R min W v 2 Situation 1 2 ( W v 2 ( R min R min 2 ( Δ s / 2 ) 2 ) 1 2 ) ( R min R min 2 ( Δ s / 2 ) 2 ) + W v R min 2 ( Δ s / 2 ) 2 2 R min + max ( ( L v L b h ) Δ s 2 R min 2 ( R min R min 2 ( Δ s / 2 ) 2 ) , L b h Δ s 2 R min ) W v 2 Situation 2 W e x t e r min = W v + Δ e x t e r = max ( ( L v L b h ) Δ s 2 R min 3 ( R min R min 2 ( Δ s / 2 ) 2 ) , L b h Δ s 2 R min ( R min R min 2 ( Δ s / 2 ) 2 ) ) . + W v R min 2 ( Δ s / 2 ) 2 2 R min + W v 2
where  L s l o t min ,  W s l o t min  are the minimum length and width of the internal parking space,  L e x t e r min ,  W e x t e r min  are the minimum length and width of the external parking space respectively;  Δ s  is the minimum longitudinal displacement brought about by an S-shaped effective movement (trajectory composed by two symmetric circle arcs), which is determined by the vehicle mechanical properties only. As shown in Figure 2b,  Δ l e f t  is the lateral distance between the vehicle and the left boundary of the parking slot after the parking maneuver is completed;  Δ r i g h t  represents the lateral distance between the right boundary of the vehicle and the furthest position on the right reached during the whole parking maneuver. And  Δ r i g h t  represents the lateral distance between the left boundary of the vehicle at the initial position and the furthest position on the left reached during the whole parking maneuver. The proof of Theorem 1 will be given in the rest of this section.
Proof of Theorem 1.
 
Calculation of L s l o t min and L e x t e r min
In order to facilitate the parking maneuver, vehicle needs to perform S-shaped forward and backward movement alternately. Each forward movement produces a longitudinal displacement of Δ s , and the subsequent backward movement brings the vehicle back to the initial longitudinal position. Hence, the maximum longitudinal displacement is just Δ s during the whole parking maneuver. Then the minimum lengths of the internal and external space required for parking can both be given by
L s l o t min = L e x t e r min = L v + Δ s
Calculation of W s l o t min and W e x t e r min
The minimum width of the parking slot (i.e., internal space) is equal to the width of the vehicle plus the left redundancy Δ l e f t and the right redundancy Δ r i g h t . The left redundancy comes from the fact that the n-times lateral displacement cannot ensure that the left sides of the vehicle and the parking slot are just overlapped after parking. Δ l e f t can be expressed as Δ l e f t = n d o n c e W v , where d o n c e is the lateral displacement caused by an S-shaped movement and n can be given by n = W v / d o n c e . The right redundancy Δ r i g h t is related to the furthest position on the right that the vehicle can reach during the whole parking maneuver.
Calculation of Δ l e f t
Since the vehicle has symmetrical characteristics and the maximum left and right steering angles are equal, so when moving with the maximum steering angle, the turning radius of each circle arcs are the same and the minimum value R min , and the corresponding center angle θ m is also the same. The lateral displacement d o n c e brought by each S-shaped movement is constant, so the number of trials can be calculated after clarifying the total lateral displacement d required for parking. We have assumed that the vehicle is parked next to the parking slot at the initial position, then there is d = W v . The reference point of the vehicle at the initial position is recorded as P i n i t , the tangent point is C and the rotation center during the first circle arc is recorded as O r , the coordinate system is established as shown in Figure 2. Analyzing the geometric relations in triangle P i n i t O r C , it results:
d o n c e = 2 ( R min R min 2 ( Δ s / 2 ) 2 )
{ sin θ m = Δ s 2 R min cos θ m = R min d o n c e / 2 R min = R min 2 ( Δ s / 2 ) 2 R min
Then the number of trials is
n = W v 2 ( R min R min 2 ( Δ s / 2 ) 2 )
Thus, there is
Δ l e f t = 2 W v 2 ( R min R min 2 ( Δ s / 2 ) 2 ) ( R min R min 2 ( Δ s / 2 ) 2 ) W v
Calculation of Δ r i g h t
The right redundancy is related to the furthest position on the right that can be reached during the parking maneuver. Therefore the trajectory of the bounding rectangle of the vehicle needs to be considered. When the midpoint of the vehicle’s rear axle (reference point) moves from the tangent point to the upper end position, the turning radius of A (the right front corner of the vehicle) is the largest of all points on the vehicle and thus the furthest position can be reached by A . Therefore, as shown in Figure 3, when the vehicle makes an S-shaped forward movement, A is selected as the analysis target to determine the furthest position that can be reached during the maneuver. Let θ m be the central angle of a circle arc; let A O l P be the acute angle between line O l P ¯ and A O l ¯ . Then the exact location of the furthest position needs to be considered in two cases.
Case 1 θ m A O l P : Considering the backward movement from the upper end position P e n d ( X e n d , Y e n d ) to the tangent point, it can be obtained from the analysis of the characteristics of the circle in plane geometry that the right-side furthest position that A can reach is the intersection of the line O l P ¯ and the circle C O l , R O l A with O l and R O l A being the center and radius respectively. As shown in the left diagram of Figure 3, The horizontal coordinates of the farthest point X A max can be obtained from analytic geometry:
X A max = X e n d R min + R O l A
with
R O l A = ( R min + W v / 2 ) 2 + ( L v L b h ) 2
Case 2 0 < θ m < A O l P : During the movement from the upper end position to the tangent point, A moves in a circular arc around the left rotation center O l , and after passing the tangent point, A moves in a circular arc around the right rotation center O r . As shown in the right diagram of Figure 3, since A cannot reach the ideal farthest position in geometric relationship, accordingly when the reference point is located at the tangent point ( X c , Y c ) , the location of A is the farthest position the vehicle can reach during the maneuver. X A max can be obtained from analytic geometry:
X A max = X c + W v 2 * cos θ m + ( L L b h ) * sin θ m = X c + W v R min 2 ( Δ s / 2 ) 2 2 R min + ( L L b h ) Δ s 2 R min .
When the vehicle makes an S-shaped backward movement, the right rear corner of the vehicle, denoted as D , has the largest turning radius. Therefore, the furthest position can be reached by D during the maneuver. The exact location of the furthest position needs to be considered in two cases as well.
Case 1 θ m D O r P : Consider reversing the process of backward movement, as shown in the left-hand diagram of Figure 4. From the lower end to the tangent point, the furthest position on the right side that D can reach is the intersection of the line O l P ¯ and the circle C O l , R O l D . The horizontal coordinates of the farthest point X max can be obtained from analytic geometry:
X D max = X e n d R min + R O l D
where
R O l D = ( R min + W v / 2 ) 2 + L b h 2
Case 2 0 < θ m < D O r P : As shown in the right diagram of Figure 4, D cannot reach the ideal farthest position in geometric relationship. Therefore when the reference point is located at the tangent point ( X c , Y c ) , the location of D is the farthest position the vehicle can reach during the parking maneuver. X D max can be obtained from analytic geometry:
X D max = X c + W v 2 * cos θ m + L b h * sin θ m = X c + W v R min 2 ( Δ s / 2 ) 2 2 R min + L b h Δ s 2 R min .
In this section, n-trial parking is needed for space saving, so the minimum slot length must be smaller than L a r c , min , which is the slot length required for one-trial parking based on circle arcs mentioned in [14]. For the vehicle model mentioned in Table 1, there is L a r c , min = 5.817 , so the upper bound of Δ s should be less than L a r c , min L v = 1.582   m . The trend of θ m is shown in Figure 5, when Δ s = 1.582   m , there are θ m = 12.74 ° , D O r P = 12.92 ° , A O l P = 35.70 ° , and when Δ s < L a r c , min L v , there is 0 < θ m < D O r P < A O l P absolutely, so the subsequent analysis about the left and right redundancy in this section are both based on case 2.
The last issue to be discussed is whether the vehicle is at the top or the bottom of the parking slot after the parking maneuver is completed, which would result in different Δ r i g h t , shown as follows.
  • Situation 1: The vehicle is parked at the top of the slot. In this case, the trajectory of the vehicle shows that Δ r i g h t is only related to the furthest position reached by the last S-shaped forward movement. It can be concluded from the analytical geometry and Equation (13) that
    Δ r i g h t , u p = X A max ( X c + d o n c e 2 + W v 2 ) = W R min 2 ( Δ s / 2 ) 2 2 R min + ( L v L b h ) Δ s 2 R min d o n c e 2 W v 2
  • Situation 2: The vehicle is parked at the bottom of the slot. In this case, Δ r i g h t is determined by the farther position that can be reached by the penultimate S-shaped forward movement and the last backward movement. From Equations (13) and (16), there is
    Δ r i g h t , d o w n = max ( X A max ( X c + 3 d o n c e 2 + W v 2 ) , X D max ( X c + d o n c e 2 + W v 2 ) ) = W R min 2 ( Δ s / 2 ) 2 2 R min + max ( ( L L b h ) Δ s 2 R min 3 d o n c e 2 , L b h Δ s 2 R min d o n c e 2 ) W v 2
Calculation of Δ e x t e r
The first two trials of the parking maneuver are the same as the last two mentioned in Situation 2 in the previous subsection, and the external redundancy required for parking is only related to the farthest left position reached by the vehicle’s left front corner B and left rear corner C . Same analysis as in Situation 2, from symmetry it follows that:
Δ e x t e r = Δ r i g h t , d o w n
Final Results
From Equations (7), (10), (17) and (18), the minimum width of internal parking space (parking slot) can be calculated by the following formula:
W s l o t min = { 2 ( W v 2 ( R min R min 2 ( Δ s / 2 ) 2 ) 1 2 ) ( R min R min 2 ( Δ s / 2 ) 2 ) + W v R min 2 ( Δ s / 2 ) 2 2 R min + ( L v L b h ) Δ s 2 R min W v 2 Situation 1 2 ( W v 2 ( R min R min 2 ( Δ s / 2 ) 2 ) 1 2 ) ( R min R min 2 ( Δ s / 2 ) 2 ) + W v R min 2 ( Δ s / 2 ) 2 2 R min + max ( ( L v L b h ) Δ s 2 R min 2 ( R min R min 2 ( Δ s / 2 ) 2 ) , L b h Δ s 2 R min ) W v 2 Situation 2
From Equations (7), (10), (18) and (19), the minimum width of external parking space can be calculated by the following formula:
W e x t e r min = max ( ( L v L b h ) Δ s 2 R min 3 ( R min R min 2 ( Δ s / 2 ) 2 ) , L b h Δ s 2 R min ( R min R min 2 ( Δ s / 2 ) 2 ) ) + W v R min 2 ( Δ s / 2 ) 2 2 R min + W v 2
The proof of Theorem 1 is completed. □

Discussions

From Table 2 and Figure 6, it can be seen that when Δ s tends to 0, the minimum internal and external parking space tends to the size of the bounding rectangle of the vehicle. With the increase of Δ s , the minimum external parking space shows a linear trend of growth, while the rise of the minimum internal parking space is relatively nonlinear, but it shows an overall upward trend.
In the practical application scenario, the parking space calculated by Equation (5) is the lower limit of space required for parking, which is also the guideline for parking space detection. The space less than this lower limit will not be considered as feasible parking space and will be ignored by the detection system. When the space detected by the system is relatively large, Δ s can be flexibly replaced by d l e f t according to the detected available space ( d l e f t is the difference between the actual detected parking slot length and the vehicle length), so as to complete the parking task with less parking trials and improve the driving comfort. In addition, if the requirement for external parking space is low, the first parking trajectory can also be flexibly changed to the one mentioned in the next section, thus further reducing the number of trials.
The simulation on Matlab of the vehicle in two parking situations is represented in Figure 7. When the number of trials is odd, the vehicle is parked at the top of the parking slot, and when it is even, the vehicle is parked at the bottom of the parking slot. The blue solid line is the trajectory of the reference point of the vehicle, and the red dashed line is the trajectory of the points on the vehicle that may affect the size of the parking space, while the simulation parameters are given in Table 1.

4. Minimum Space for One-Trial Parking Based on Circle Arcs

The minimum parking space required for automatic parallel parking based on circle arcs has been given in Section 3, and the conclusion tends to be an idealized derivation with unbounded number of trials. Considering the minimum time and fuel consumption, as well as the optimal comfort for passengers, this section will give the parking space required for the classic one-trial parking based on admissible circle arcs (one-trial parking, i.e., park the car without longitudinal velocity sign change). In this method, the “simplified” kinematic model with only three configuration parameters for the vehicle is used, and the path is composed by two circular arcs connected by a tangent point. The minimum length L min and width W min of the parking slot has been given in [19], which will not be discussed here. This section focuses on the minimum external parking space required by the one-trial circular arc parking, which can be represented by a simplified rectangular area.
Theorem 2.
The minimum length and width of external parking space required for one-trial parking based on admissible circular arcs can be obtained by the following formula:
L e x t e r min = 2 R min sin θ S min + L v L b h min ( 2 R min sin θ S min R O r C 2 ( W v / 2 W l e f t R min ( 2 cos θ S min 1 ) ) 2 , R l w 2 ( W v / 2 W l e f t + R min ) 2 )
W e x t e r min = R min ( 1 2 cos θ S min ) + R O r B W v / 2 W l e f t
where  W l e f t  denotes the lateral distance between the vehicle and the left boundary of the parking slot at the end of the parking, which can be taken according to the actual application requirements, and when it is regarded as 0, the size of the external parking space is only depends on the characteristics of the vehicle.  θ S min  denotes the minimum central angle of the arc to meet the vehicle exit collision-free conditions.  R O r B ,  R O r C  and  R l w  are the turning radius of point  C , point  B  and the left rear wheel of the vehicle when the instantaneous center of rotation is  O r , respectively, and by symmetry,  R O r B = R O l A ,  R O r C = R O l D  . The proof of Theorem 2 will be given in the rest of this section.
Proof of Theorem 2.
 
Determination of Parameter θ S min
The parking maneuver is considered in reverse, two conditions need to be meet for the vehicle does not collide with the parking space in the process of exit the spot: (1.) During the first circle arc, the right front and rear corner of the vehicle have, respectively, no collision with the front and lateral obstacles of the parking slot. The minimum length and width of the parking slot can be geometrically calculated by this condition. (2.) During the second circle arc, the right rear wheel of the vehicle has no collision with the surrounding obstacles of the parking slot and other parked vehicles. Under this condition, the minimum central angle of the arc θ S min corresponding to the collision-free condition can be calculated geometrically, provided that W l e f t and vehicle characteristics are known.
The coordinate system is established as shown in Figure 8, At the end of the parking, the coordinate of the reference point of the vehicle is P e n d ( 0 , 0 ) , so the coordinates of the tangent point and the left and right rotation centers can be obtained from the geometric relationship:
P c ( R min ( cos θ S 1 ) , R min sin θ S ) P i n i t ( 2 R min ( cos θ S 1 ) , 2 R min sin θ S ) O l ( X O l , Y O l ) = ( R min , 0 ) O r ( X O r , Y O r ) = ( R min ( 2 cos θ S 1 ) , 2 R min sin θ S ) .
The trajectory equation of the right rear wheel of the vehicle during the second circle arc is:
( x X O r ) 2 + ( y Y O r ) 2 = R r w 2
where
R r w = R min W v / 2 .
Under the extreme conditions, θ S = θ S min , the right rear wheel of the vehicle should pass exactly the upper left corner E ( W v / 2 W l e f t , L s l o t L b h ) of the parking space during the movement, where, L s l o t = L b h + R O l A 2 ( R min W v / 2 W l e f t ) 2 is the length of the parking slot, substituting this into above trajectory Equation (25) yields θ S min , as shown in Table 3, which gives the specific values for the θ S min in different W l e f t conditions.
Calculation of W e x t e r min
When the center angle is θ S min and the radius of both circle arcs is the minimum value, the external space required for parking is minimized, which can be represented by a simplified rectangular area, and the size of it is recorded as A r e a o u t . For regular small cars, there are p i / 2 > θ S min > A O l P > D O r P (see Table 3). Therefore, the analysis of the farthest position in this section is all based on the case1 model introduced in the previous section. The right boundary of the rectangular area representing the external parking space is the left boundary of the parking slot, and its horizontal coordinate is W v / 2 W l e f t . The left boundary of the rectangular area is determined by the farthest left position reached by the left front corner B during the parking process, denoted as X L e f t (as can we see in Figure 4).
X L e f t = X O r R O r B = R min ( 2 cos θ S min 1 ) R O r B
where R O r B = R O l A = ( R min + W v / 2 ) 2 + ( L v L b h ) 2 .
Thus, the minimum width of the external parking space is:
W e x t e r min = R min ( 1 2 cos θ S min ) + R O r B W v / 2 W l e f t
Calculation of L e x t e r min
The upper boundary of the rectangular area is determined by the highest position reached by the header of the vehicle during the parking process, noted as Y max . The lower boundary of the rectangular area is determined by the lowermost intersection of the outer contour of the vehicle and the left boundary of the parking slot during the whole parking maneuver, that is, the lower position of the intersection of the left rear corner trajectory of the vehicle during the first circle arc and the left rear wheel trajectory of the vehicle during the second circle arc with the left boundary of the parking slot, noted as Y intersection . As a result, Y max , Y intersection can be obtained as follows:
Y max = Y O r + L v L b h = 2 R min sin θ S min + L v L b h
Y intersection = min ( Y O r R O r C 2 ( W v / 2 W l e f t X O r ) 2 , R l w 2 ( W v / 2 W l e f t X O l ) 2 )
So the minimum length of the external parking space is:
L e x t e r min = Y max Y intersection = 2 R min sin θ S min + L v L b h min ( 2 R min sin θ S min R O r C 2 ( W v / 2 W l e f t R min ( 2 cos θ S min 1 ) ) 2 , R l w 2 ( W v / 2 W l e f t + R min ) 2 )
where, R O r C = R O l D = ( R min + W v / 2 ) 2 + L b h 2 and R l w = R min W v / 2 .
The proof of Theorem 2 is completed. □

Discussions

It is illustrated in Figure 9 that size of the external parking space under different values of W l e f t are growing with the increase of the central angle θ S . As a consequence, the external space required for parking is the smallest when θ S = θ S min . When W l e f t = 0 , the minimal external parking space is only related to the characteristics and mechanical properties of the vehicle, which can be widely extended to different scenarios.
In a real application scenario, if the lateral distance between the vehicle and the parking space at the initial position is far, the turning radius of the first arc can be appropriately increased to meet the actual parking demand, and of course, the required external parking space will also be increased.
The parking trajectory and the bounding rectangle of external parking space (red rectangular area) are shown in Figure 10, when W l e f t = 0.3 , the external parking space is smaller, but the required space for parking slot is larger, when W l e f t = 0 , the situation is the opposite. In actual application scenarios, the automatic parking system can choose W l e f t flexibly according to the scene information to complete the parking task at the least possible cost.

5. Minimum Space for One-Trial Parking Based on Continues-Curvature Curve

In the previous section, the minimum space required for parking in one trial based on admissible circle arcs is discussed. The parking space required by that method is almost the smallest in all one-trial parking methods. However, the curvature of this type of path is discontinuous and discontinuities occur at every transition between arcs with an opposite direction of rotation. The vehicle have to stop at every discontinuous point to reorient its front wheels. This process not only increases the total parking time, but also causes wear on the steering column and wheels. Parking based on continuous-curvature curve is a good choice to solve these problems. Considering the kinematics model of the vehicle in Section 2, a real car can well track the path with continuous curvature. The path has upper-bounded curvature and upper-bounded curvature derivative, which come from the fact that the vehicle steering angle and angular velocity have upper bounds. So in this section, clothoid is chosen to achieve the smooth transition of curvature, which is a parametric curve whose curvature is a polynomial function of its arc length and can satisfy all the three constraints mentioned above. As a matter of fact, the continuous-curvature curve (referred as CC curve) discussed in this section is made up of circular arcs and clothoids. Besides, in the same manner as the analysis in the previous section, the process of parking into the slot is considered in reverse and the path is constructed from the end of the parking.
Continuous-curvature path achieves smooth transition at the expense of more parking space, which greatly improves the comfort of driving. Compared with parking based on circle arcs, what is the increment of parking space, and what is the minimum internal and external space required for one-trial parking based on continues-curvature curve? These questions will be answered in this section.
Theorem 3.
The lower and upper bounds of the minimum length and width of internal parking space required for one-trial parking based on continuous-curvature curve can be obtained by the following formula:
{ L s l o t min = L b h + Δ 1 + R A min 2 ( Δ 2 + R min W v / 2 ) 2 L s l o t max = L b h + Δ 1 + R A max 2 ( Δ 2 + R min W v / 2 ) 2 { W s l o t min = W v / 2 + R D min ( R min + Δ 2 ) W s l o t max = W v / 2 + R D max ( R min + Δ 2 )
the lower and upper bounds of the minimum length and width of external parking space:
L e x t e r = 2 R min sin θ c o n t a c t + 2 ( Δ 1 + Δ 3 ) + L v L b h { W e x t e r min = 2 R min ( 1 cos θ c o n t a c t ) + Δ 2 + 2 Δ 4 + R B min R min W v / 2 W e x t e r max = 2 R min ( 1 cos θ c o n t a c t ) + Δ 2 + 2 Δ 4 + R B max R min W v / 2
where,  Δ 1  and  Δ 3  are the increments in the horizontal direction of the continues-curvature path with respect to the circular arc path,  Δ 2  and  Δ 4  are vertical increments,  θ c o n t a c t  is the orientation angle at the contact point.  R A min , R A max  are the lower and upper limit of the minimum turning radius of  A  respectively, and the same analysis for  R B , R D . The proof of Theorem 3 will be given in the rest of this section.

5.1. General Properties of Clothoid

A clothoid is a curve whose curvature varies linearly with its arc length:
k ( l ) = σ l + k ( 0 )
where l is the length of the curve from the starting point to the current point, and σ is the sharpness of the clothoid. The longer the length of the clothoid, the better the smoothing effect of the curve, but too long clothoid will lead to a long parking path and increase the requirement of parking space. Hence, to minimize the parking space, we take the maximum value of the steering angle and steering angular velocity, so that the length of the clothoid is as short as possible. The configuration of the reference point of the vehicle on the clothoid is defined as q i = ( x i , y i , θ i , k i ) , the angle between the orientation of q i and the tangent to the equivalent center of circle is denoted as β i . In the initial position, the curvature is 0, and the turning radius is , β max recorded as β i with maximum value. Subsequently the curvature gradually increases at a constant rate until it to the maximum value k max when the radius reaches a minimum value R min , β i decreasing to 0 and the clothoid arc ended at this point. Thereafter, if the path continues at maximum curvature, the trajectory is transformed into a circular arc of constant curvature.
The whole continuous-curvature path (referred as CC path) consists of two symmetric segments about the center of the contact point. The First segment of the path is made up of three parts: (1) a clothoid arc of sharpness σ = σ max whose curvature varies from 0 to k max ; (2) a circular arc of radius R min = k max 1 ; (3) a clothoid arc of sharpness σ whose curvature varies from k max to 0. At the end of this segment, the curvature is 0, and the orientation of the vehicle is θ c o n t a c t . The next segment is the inversion of this segment, where the path curvature varies continuously linearly up from 0 and then gradually back to 0. The vehicle track along the continues-curvature path is small-time controllable [31], And the set of configurations reachable from any configuration q before a time t contains a neighborhood of q for any t. When the vehicle velocity is constant, the configuration q t of the vehicle at time t is:
q t = { x t = π σ max 0 σ max π v t cos t 2 2 d t y t = π σ max 0 σ max π v t sin t 2 2 d t θ t = σ max v 2 t 2 2 k t = σ max v t t [ 0 , δ max v δ ]
The whole length of clothoid arc L s = k max / σ max = v t min ( v is the longitudinal velocity of the vehicle), and the steering angle of the vehicle are turning at a constant maximum angular velocity to δ max , so there are t min = δ max / v δ Combining these equations, the following relationship about the sharpness of clothoid can be deduced:
σ max = k max L s = v δ v δ max R min
In order to ensure the existence of circular arc segments in the path, the orientation angle at the contact point θ c o n t a c t needs to satisfy certain conditions, otherwise, the planned path will become a path consisting entirely of clothoid arcs. The variation of vehicle orientation after a clothoid arc is θ c l o = k max 2 / 2 σ max [28]. From symmetry, the following conditions need to be satisfied in the presence of a circular arc segment:
θ c o n t a c t 2 θ c l o = k max 2 σ max
The coordinate system is established as shown in Figure 11, the configuration of the vehicle at the end of the parking is q 0 = ( 0 , 0 , 0 , 0 ) , hence the coordinates of the end of the first clothoid arc and the center of the circular arc O c l o are:
{ x 1 = π / σ max F r C ( k max 2 σ max ) y 1 = π / σ max F r S ( k max 2 σ max ) { x c l o = π / σ max F r C ( k max 2 σ max ) R min sin ( θ c l o ) y c l o = π / σ max F r S ( k max 2 σ max ) + R min cos ( θ c l o )
with F r C and F r S , the Fresnel integrals:
F r C ( x ) = 0 x cos π 2 u 2 d u ,   F r S ( x ) = 0 x sin π 2 u 2 d u .  
The distance from the beginning of the clothoid segment to the center O c l o is denoted as R c l o , the angle between the orientation of q 0 and the tangent to the center O c l o is denoted as β max :
R c l o = x c l o 2 + y c l o 2 β max = arctan ( x c l o y c l o ) .  

5.2. Spatial Increments Relative to Circular Arc Path

As can be seen in Figure 11, that a segment of the continues-curvature path produces increments Δ 1 and Δ 3 , horizontally, and increments Δ 2 and Δ 4 ,vertically, with respect to the circular arc path. Draw a line parallel to the Y-axis through the center of the circle O c l o , intersecting the circle C O c l o , R min at C . Point C can be regarded as the starting point of circular arc path, the distance between it with the X-axis and Y-axis are Δ 1 , Δ 2 , separately
Δ 1 = π / σ max F r C ( k max 2 σ max ) R min sin θ c l o ,   Δ 2 = π / σ max F r S ( k max 2 σ max ) + R min ( cos θ c l o 1 ) .
The first segment is symmetrical about the line passing through O c l o with a slope of tan ( θ c o n t a c t / 2 + π / 2 ) , C is the point of symmetry of C about that line, and its distance from the contact point is d = Δ 1 2 + Δ 2 2 , The angle formed by the line between point C and the contact point and the tangent line is γ = arctan ( Δ 2 / Δ 1 ) . From the trigonometric relationship:
Δ 3 = d cos ( θ c o n t a c t γ ) ,   Δ 4 = d sin ( θ c o n t a c t γ ) .  
The whole continuous curvature path presents a centrosymmetric relation with respect to the contact point. Therefore, the total horizontal and vertical increments relative to the simple circle arc path are:
Δ L = 2 ( Δ 1 + Δ 3 ) = 2 ( π / σ max F r C ( k max 2 σ max ) R min sin θ c l o + d cos ( θ c o n t a c t γ ) ) , Δ W = 2 ( Δ 2 + Δ 4 ) = 2 ( π / σ max F r S ( k max 2 σ max ) + R min ( cos θ c l o 1 ) + d sin ( θ c o n t a c t γ ) ) .
In addition, when the radius of the first arc is larger than the minimum turning radius, the two arcs should be considered separately, through the above analysis method can also obtained the corresponding conclusions easily.
Proof of Theorem 3.
 
Calculation of Minimum Internal and External Parking Space
The vehicle travels on the continuous-curvature path between two extreme circles (radius of R min and R c l o ), shown in Figure 11, so the minimum internal and external parking space both have upper and lower bounds. To make the required parking space as small as possible, it is assumed that at the end of the parking, the vehicle is parked close to the left boundary of the parking space ( W l e f t = 0 ). We will tackle the problem by taking into account the process of retrieving vehicles from the parking slot based on non-collision conditions. In the exit procedure, as shown in Figure 12, when the vehicle’s right front corner A moves to the line O c l o E ¯ , if the vehicle’s reference point is located at the circular arc segment, the minimum parking slot reaches the lower bound in this situation, otherwise, if the reference point is located at the point of minimum curvature on the clothoid arc, the minimum parking slot reaches to the upper bound.
Based on the geometric analysis in the previous subsection and the application of the Pythagorean theorem to the triangle O c l o G E , the lower and upper bounds of the minimal length of the parking slot are:
L s l o t min = L b h + Δ 1 + R A min 2 ( Δ 2 + R min W v / 2 ) 2 L s l o t max = L b h + Δ 1 + R A max 2 ( Δ 2 + R min W v / 2 ) 2
where R A max can be calculated in the triangle O c l o P E by the cosine theorem
R A min = ( R min + W v / 2 ) 2 + ( L v L b h ) 2 R A max = ( R i 2 + d P A 2 2 cos ( π / 2 + θ f + β i ) R i d P A ) max = R c l o 2 + d P A 2 2 cos ( π / 2 + θ f + β max ) R c l o d P A .
As shown in Figure 13, When the left front corner B of the vehicle moves to the parallel line of the Y-axis past the center of the circle O c l o , the reference point of the vehicle is located on the circular arc segment, the highest position Y u p that the vehicle can reach during the parking maneuver is the smallest. Otherwise the reference point located on the clothoid arc segment, Y u p is relatively larger. From the geometric relationship, it yields:
Y u p min = 2 R min ( 1 cos θ c o n t a c t ) + Δ W + R B min ( R min + Δ 2 ) Y u p max = 2 R min ( 1 cos θ c o n t a c t ) + Δ W + R B max ( R min + Δ 2 ) ,
Y d o w n min = ( R D min ( R min + Δ 2 ) ) Y d o w n max = ( R D max ( R min + Δ 2 ) ) .
So, the lower and upper bounds of the minimal width of the parking slot:
W s l o t min = W v / 2 + R D min ( R min + Δ 2 ) W s l o t max = W v / 2 + R D max ( R min + Δ 2 ) .
The length of the minimum external parking space:
L e x t e r = 2 R min sin θ c o n t a c t + Δ L + L v L b h
The lower and upper bounds of the minimal width of the external parking space:
W e x t e r min = 2 R min ( 1 cos θ c o n t a c t ) + Δ W + R B min ( R min + Δ 2 ) W v / 2 W e x t e r max = 2 R min ( 1 cos θ c o n t a c t ) + Δ W + R B max ( R min + Δ 2 ) W v / 2 .
where,
R B min = ( R min + W 2 ) 2 + ( L L b h ) 2 ,   R D min = ( R min + W 2 ) 2 + L b h 2 R B max = ( R i 2 + d P B 2 2 cos ( π / 2 + θ f + β i ) R i d P B ) max = R c l o 2 + d P B 2 2 cos ( π / 2 + θ f + β max ) R c l o d P B R D max = ( R i 2 + d P D 2 2 cos ( π / 2 + θ b + β i ) R i d P D ) max = R c l o 2 + d P D 2 2 cos ( π / 2 + θ b + β max ) R c l o d P D θ f = arctan ( W / 2 L L b h ) ,   θ b = arctan ( W / 2 L b h ) .
The proof of Theorem 3 is completed. □

5.3. Discussions

Figure 14 shows the upper and lower limits of the minimum internal and external parking space required for continuous-curvature (CC) parking in one trial as a function of vehicle velocity, and compares them to the minimum space required for one-trial and n-trial circular arc parking ( Δ s = 0.5 m). As can be seen, the space required for parking in one-trial is considerably bigger than parking in n-trial, so when the available space detected by the automatic parking system is smaller than the space required by the one-trial parking based on circular arc but larger than the n-trial parking, parking in several trials should be considered for path planning. However, when the detected space is big enough and the vehicle is parked at low speed, we prefer to plan a continuous-curvature path to parking, thus reducing the wear of the vehicle steering column and increasing driving comfort. Curvature continuity is a desirable property. The simulation on Matlab of the vehicle parking based continuous-curvature curve and circular arc is shown in Figure 15 when v is kept constant as 1 m/s., and the red and light blue rectangle area represents the lower limit and upper limit of space required by continuous curvature parking, respectively.

6. Conclusions

In this paper, the minimum parking space required for automatic parallel parking was considered based on a geometric analysis approach, which is an important prerequisite for future automatic parking systems. First, without limiting the number of parking maneuvers, the minimum internal and external parking spaces required for automatic parallel parking based on circular arc were given, and the conclusions were presented as closed-form solutions. Without loss of generality, the minimum parking spaces are only related to vehicle characteristics and mechanical properties, and have nothing to do with environmental factors. In addition, the minimum internal and external parking spaces are all approximately equivalent to the size of the bounding rectangle of the vehicle when vehicle performance constraints are discounted. Furthermore, for the classical one-trial parking based on simple admissible circular arcs and the improved parking based on continuous-curvature curve, the computational formulas of the minimum parking space were given, while the latter was presented as a set of upper and lower bounds in closed form. At last, the minimum internal and external parking space required for the different parking methods mentioned in this paper were compared and discussed. For the automatic parking system, a suitable path planning method can be selected by comparing the minimum parking space and the detected space to guide the vehicle to complete the parking maneuver.
The results of this paper are only for automatic parallel parking of small and medium-sized cars. In the future, the research will be extended to other vehicle configurations with more complex vehicle characteristics and kinematic models, such as articulated vehicles. Associated work is already on the agenda.

Author Contributions

Conceptualization, X.W.; methodology, Z.D., X.W. and M.Z.; software, X.W.; formal analysis, Z.D., X.W. and M.Z.; writing—original draft preparation, Z.D., X.W. and M.Z.; writing—review and editing, M.Z., X.W. and Z.D.; funding acquisition, X.W., M.Z., Z.D. and Z.L. All authors have read and agreed to the published version of the manuscript.

Funding

Supported by the National Natural Science Foundation of China (62001152), Anhui Provincial Natural Science Foundation (2008085QF321), the Fundamental Research Funds for the Central Universities (JZ2020HGQA0184, PA2020GDSK0082).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ma, S.; Jiang, H.; Han, M.; Xie, J.; Li, C. Research on automatic parking systems based on parking scene recognition. IEEE Access 2017, 5, 21901–21917. [Google Scholar] [CrossRef]
  2. Roca-Riu, A.B.; Fernández, E.; Estrada, M. Parking slot assignment for urban distribution: Models and formulations. Omega 2015, 57, 157–175. [Google Scholar] [CrossRef]
  3. Miller, A. Automated Driving: The Technology and Implications for Insurance. Thatcham Research. 2016. Available online: http://www.brakepro.org/assets/docs/eventresources/invehicle-tech-Dec16/Thatcham_Research_Webinar.pdf (accessed on 12 January 2022).
  4. Banzhaf, H.; Nienhuser, D.; Knoop, S. The Future of Parking: A Survey on Automated Valet Parking with an Outlook on High Density Parking. In Proceedings of the 2017 IEEE Intelligent Vehicles Symposium (IV), Los Angeles, CA, USA, 11–14 June 2017; pp. 1827–1834. [Google Scholar]
  5. Yurtsever, E.; Lambert, J.; Carballo, A.; Takeda, K. A survey of autonomous driving: Common practices and emerging technologies. IEEE Access 2020, 8, 58443–58469. [Google Scholar] [CrossRef]
  6. Jang, C.; Kim, C.; Lee, S.; Kim, S.; Lee, S.; Sunwoo, M. Re-Plannable Automated Parking System with a Standalone around View Monitor for Narrow Parking Lots. IEEE Trans. Intell. Transp. Syst. 2020, 21, 777–790. [Google Scholar] [CrossRef]
  7. Suhr, J.K.; Jung, H.G. Automatic Parking Space Detection and Tracking for Underground and Indoor Environments. IEEE Trans. Ind. Electron. 2016, 63, 5687–5698. [Google Scholar] [CrossRef]
  8. Qazi, S.; Sabir, F.; Khawaja, B.A.; Atif, S.M.; Mustaqim, M. Why is internet of autonomous vehicles not as plug and play as we think? Lessons to be learnt from present internet and future directions. IEEE Access 2020, 8, 133015–133033. [Google Scholar] [CrossRef]
  9. Yang, Y.; Hua, K. Emerging technologies for 5G-enabled vehicular networks. IEEE Access 2019, 7, 181117–181141. [Google Scholar] [CrossRef]
  10. Hao, Z.; Yuen, K.V.; Mihaylova, L.; Leung, H. Overview of Environment Perception for Intelligent Vehicles. IEEE Trans. Intell. Transp. Syst. 2017, 18, 2584–2601. [Google Scholar] [CrossRef] [Green Version]
  11. Kim, I.Y.; Yang, K.S.; Jin, J.B.; Hwang, S.-H. Development of Intelligent Electric Vehicle for Study of Unmanned Autonomous Driving Algorithm. In Proceedings of the 2013 World Electric Vehicle Symposium and Exhibition (EVS27), Barcelona, Spain, 17–20 November 2013; pp. 1–6. [Google Scholar] [CrossRef] [Green Version]
  12. Reeds, J.A.; Shepp, R.A. Optimal paths for a car that goes both forward and backward. Pac. J. Math. 1991, 145, 367–393. [Google Scholar] [CrossRef] [Green Version]
  13. Dubins, L.E. On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 1957, 79, 497–516. [Google Scholar] [CrossRef]
  14. Boissonnat, J.D.; Cérézo, A.; Leblond, J. Shortest path of bounded curvature in the plane. J. Intell. Robot. Syst. 1994, 11, 5–20. [Google Scholar] [CrossRef]
  15. Fraichard, T.; Scheuer, A. From Reeds and Shepp’s to Continuous-Curvature Paths. IEEE Trans. Robot. 2004, 20, 1025–1035. [Google Scholar] [CrossRef] [Green Version]
  16. Gupta, A.; Divekar, R. Autonomous parallel parking methodology for Ackerman configured vehicles. Int. J. Commun. 2013, 1, 1–6. [Google Scholar]
  17. Choi, S.; Boussard, C. Easy path planning and robust control for automatic parallel parking. IFAC Proc. Vol. 2011, 44, 656–661. [Google Scholar] [CrossRef] [Green Version]
  18. Lo, Y.K.; Rad, A.B.; Wong, C.W.; Ho, M.L. Automatic Parallel Parking. In Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems, Shanghai, China, 12–15 October 2003; IEEE: New York, NY, USA, 2003. [Google Scholar]
  19. Vorobieva, H.; Glaser, S.; Minoiu-Enache, N.; Mammar, S. Automatic parallel parking in tiny spots: Path planning and control. IEEE Trans. Intell. Transp. Syst. 2015, 16, 396–410. [Google Scholar] [CrossRef] [Green Version]
  20. Wang, L.; Guo, L.; He, Y. Path Planning Algorithm for Automatic Parallel Parking from Arbitrary Initial Angle. In Proceedings of the 2017 10th International Symposium on Computational Intelligence and Design (ISCID), Hangzhou, China, 9–10 December 2017; pp. 55–58. [Google Scholar] [CrossRef]
  21. Muller, B.; Deutscher, J.; Grodde, S. Continuous curvature trajectory design and feedforward control for parking a car. IEEE Trans. Control Syst. Technol. 2007, 15, 541–553. [Google Scholar] [CrossRef]
  22. Kanayama, Y.; Hartman, B.I. Smooth Local Path Planning for Autonomous Vehicles. In Proceedings of the 1989 IEEE International Conference on Robotics and Automation, Scottsdale, AZ, USA, 14–19 May 1989; IEEE: New York, NY, USA, 1989. [Google Scholar]
  23. Ghilardelli, F.; Lini, G.; Piazzi, A. Path generation using η4-spine for a truck and trailer vehicle. IEEE Trans. Autom. Sci. Eng. 2014, 11, 187–203. [Google Scholar] [CrossRef]
  24. Eilers, P.; Rijnmond, D.M.; Marx, B.D. Flexible smoothing with B-splines and penalties. Stat. Sci. 1996, 11, 89–121. [Google Scholar] [CrossRef]
  25. Ammoun, S.; Nashashibi, F. Design and efficiency measurement of cooperative driver assistance system based on wireless communication devices. Transp. Res. Part C Emerg. Technol. 2010, 18, 408–428. [Google Scholar] [CrossRef]
  26. Nelson, W.L. Continuous-Curvature Paths for Autonomous Vehicles. In Proceedings of the 1989 IEEE International Conference on Robotics and Automation, Scottsdale, AZ, USA, 14–19 May 1989; IEEE: New York, NY, USA, 1989. [Google Scholar]
  27. Fraichard, T.; Scheuer, A. Continuous-Curvature Path Planning for Car-Like Vehicles. In Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robots & Systems. Innovative Robotics for Real-World Applications. IROS ’97, Grenoble, France, 11 September 1997. [Google Scholar]
  28. Vorobieva, H.; Enache, N.M.; Glaser, S.; Mammar, S. Geometric Continuous-Curvature Path Planning for Automatic Parallel Parking. In Proceedings of the 2013 10th IEEE International Conference on Networking, Sensing and Control, Evry, France, 10–12 April 2013. [Google Scholar]
  29. Yi, Y.; Lu, Z.; Xin, Q.; Lei, J.; Wang, J. Smooth Path Planning for Autonomous Parking System. In Proceedings of the 2017 IEEE Intelligent Vehicles Symposium (IV), Los Angeles, CA, USA, 11–14 June 2017; pp. 167–173. [Google Scholar] [CrossRef]
  30. Vorobieva, H.; Glaser, S.; Minoiu-Enache, N.; Mammar, S. Geometric path planning for automatic parallel parking in tiny spots. IFAC Proc. Vol. 2012, 45, 36–42. [Google Scholar] [CrossRef] [Green Version]
  31. Scheuer, A.; Laugier, C. Planning Sub-Optimal and Continuous-Curvature Paths for Car-Like Robots. In Proceedings of the 1998 IEEE/RSJ International Conference on Intelligent Robots & Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), Victoria, BC, Canada, 17 October 1998. [Google Scholar]
Figure 1. Simplified model of vehicle and parking slot (a); and vehicle kinematic model (b).
Figure 1. Simplified model of vehicle and parking slot (a); and vehicle kinematic model (b).
Sensors 22 00795 g001
Figure 2. S-shaped forward and backward movement (a); and schematic representation of the space required for parking (b).
Figure 2. S-shaped forward and backward movement (a); and schematic representation of the space required for parking (b).
Sensors 22 00795 g002
Figure 3. Two cases of S-shaped forward movement.
Figure 3. Two cases of S-shaped forward movement.
Sensors 22 00795 g003
Figure 4. Two cases of S-shaped backward movement.
Figure 4. Two cases of S-shaped backward movement.
Sensors 22 00795 g004
Figure 5. The trend of maximum central angle.
Figure 5. The trend of maximum central angle.
Sensors 22 00795 g005
Figure 6. Variation of minimal internal and external parking space.
Figure 6. Variation of minimal internal and external parking space.
Sensors 22 00795 g006
Figure 7. Simulation of the parking for two situations: (a) situation1; (b) situation 2.
Figure 7. Simulation of the parking for two situations: (a) situation1; (b) situation 2.
Sensors 22 00795 g007
Figure 8. Parking in one trial based on circle arcs.
Figure 8. Parking in one trial based on circle arcs.
Sensors 22 00795 g008
Figure 9. Variation of the minimal external parking space for different W l e f t .
Figure 9. Variation of the minimal external parking space for different W l e f t .
Sensors 22 00795 g009
Figure 10. Simulation of the parking for two different W l e f t .
Figure 10. Simulation of the parking for two different W l e f t .
Sensors 22 00795 g010
Figure 11. Continuous-curvature turns.
Figure 11. Continuous-curvature turns.
Sensors 22 00795 g011
Figure 12. Minimum parking space in two cases: (a) lower bound; (b) upper bound.
Figure 12. Minimum parking space in two cases: (a) lower bound; (b) upper bound.
Sensors 22 00795 g012
Figure 13. The trajectory of continuous curvature parking.
Figure 13. The trajectory of continuous curvature parking.
Sensors 22 00795 g013
Figure 14. Comparison of the minimum internal and external parking space required by different parking methods.
Figure 14. Comparison of the minimum internal and external parking space required by different parking methods.
Sensors 22 00795 g014aSensors 22 00795 g014b
Figure 15. For the comparison between parking with continuous-curvature curve and circular arcs.
Figure 15. For the comparison between parking with continuous-curvature curve and circular arcs.
Sensors 22 00795 g015
Table 1. Parameters of used vehicle model.
Table 1. Parameters of used vehicle model.
Notation L v W v L w L f h L b h δ m a x v δ
Value4235
(mm)
1765
(mm)
2510
(mm)
700
(mm)
1025
(mm)
35
(°)
25
(°/s)
Table 2. Minimum parking space under different Δ s .
Table 2. Minimum parking space under different Δ s .
Δ s   ( m ) 00.1000.2500.5000.7501.000
n I n f 25314051024526
L s l o t min , L e x t e r min 4.2354.3354.4854.7354.9855.235
W s l o t min 1.7651.80941.87491.97592.08132.1560
W e x t e r min 1.7651.80861.86981.96052.03692.0990
Table 3. Variation of external parking space dimension data with W l e f t .
Table 3. Variation of external parking space dimension data with W l e f t .
W l e f t   ( m ) θ S m i n   ( ° ) W o u t , m i n   ( m ) L o u t , m i n   ( m ) A r e a o u t   ( m 2 ) L s l o t   ( m )
041.0812.7997.92222.1815.817
0.142.2842.8007.30620.4575.872
0.243.4302.7997.12119.9315.924
0.344.6332.8017.01019.6375.974
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, X.; Zhou, M.; Liu, Z.; Ding, Z. On Minimum Parking Space Required by Automatic Parallel Parking. Sensors 2022, 22, 795. https://doi.org/10.3390/s22030795

AMA Style

Wang X, Zhou M, Liu Z, Ding Z. On Minimum Parking Space Required by Automatic Parallel Parking. Sensors. 2022; 22(3):795. https://doi.org/10.3390/s22030795

Chicago/Turabian Style

Wang, Xuan, Momiao Zhou, Zhengqiong Liu, and Zhizhong Ding. 2022. "On Minimum Parking Space Required by Automatic Parallel Parking" Sensors 22, no. 3: 795. https://doi.org/10.3390/s22030795

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop