2010
DOI: 10.1109/tro.2010.2062090
|View full text |Cite
|
Sign up to set email alerts
|

Trajectory Planning of Unicycle Mobile Robots With a Trapezoidal-Velocity Constraint

Abstract: We propose an efficient stochastic scheme for minimum-time trajectory planning of a nonholonomic unicycle mobile robot under constraints on path curvature, velocities, and torques. This problem, which is known to be complex, often requires important runtimes, particularly if obstacles are present and if full dynamics is considered. The proposed technique is a fast variant of the random-profile approach recently applied to wheeled-mobile robots. It incorporates a trapezoidal-velocity-profile constraint that hel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(13 citation statements)
references
References 33 publications
0
13
0
Order By: Relevance
“…Solutions A, B and C marked on Figure 3 are the extreme non-dominated solutions, which correspond to the minimum value of f 1 , f 2 and f 3 , respectively. Given the same parameter as Case I, contrastive simulations are performed where joint velocities are determined by conventional trapezoidal-velocity profile (mark as solution T) [30] (acceleration and deceleration time are both set as 30 seconds). The results listed in Table 3 are obtained by computing kinematics according to the four sets of joint trajectories.…”
Section: Resultsmentioning
confidence: 99%
“…Solutions A, B and C marked on Figure 3 are the extreme non-dominated solutions, which correspond to the minimum value of f 1 , f 2 and f 3 , respectively. Given the same parameter as Case I, contrastive simulations are performed where joint velocities are determined by conventional trapezoidal-velocity profile (mark as solution T) [30] (acceleration and deceleration time are both set as 30 seconds). The results listed in Table 3 are obtained by computing kinematics according to the four sets of joint trajectories.…”
Section: Resultsmentioning
confidence: 99%
“…Moreover, obstacle avoidance and multi-maneuver parking cannot be treated easily. In Haddad et al (2010), an optimization approach along with trapezoidal velocity constraints simplification solved the trajectory planning problem, and the simulation results showed considerable computation time reduction without losing much quality of the solution. In Li and Shao (2015) and Li et al (2016), the optimal control method is applied to solve the optimal trajectories for autonomous parking.…”
Section: Previous Workmentioning
confidence: 99%
“…Recently, we observe fast development of sampling-based motion planners building upon the concept of RRT (Rapidly Random exploring Trees) [11,15,17,20,23,30] and other closely related probabilistic approaches such as [13]. Their controller-driven variants are usually obtained by integration of a specific extend procedure into the planner.…”
Section: Related Workmentioning
confidence: 99%