Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.
DOI: 10.1109/icnsc.2005.1461309
|View full text |Cite
|
Sign up to set email alerts
|

Shortest trajectory planning of wheeled mobile robots with constraints

Abstract: In this paper, we suggest a shortest trajectory planning algorithm for wheeled mobile robots with constraints; bounded curvature paths and moving forwerd only motion of robots; for example, aerial vehicles or moving forward car-like mobile robots. The main purpose of the paper is to find the optimal shortest path between a starting point and a goal point with constraints. Based on the Dubins' car and the shortest path synthesis [I], a geometrical approach is addressed to solve the problem. First we define patt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 12 publications
0
5
0
1
Order By: Relevance
“…Cho and Ryeu [7] had configured the mobile platform's initial location at origin and initial orientation at zero degree. In order to simplify the identification, environment will be rotate until the desired orientation of mobile platform is equal to zero degree [8].…”
Section: Shortest Path Classificationmentioning
confidence: 99%
“…Cho and Ryeu [7] had configured the mobile platform's initial location at origin and initial orientation at zero degree. In order to simplify the identification, environment will be rotate until the desired orientation of mobile platform is equal to zero degree [8].…”
Section: Shortest Path Classificationmentioning
confidence: 99%
“…Ny et al [14] applied the Dubins path to solving the path planning of the traveling salesman problem (TSP). Yeol et al [15] gave a shortest trajectory planning algorithm based on the Dubins curve and suitable for aircraft or mobile robots. Dubins path was applied to UAV obstacle avoidance and multi-UAV collaborative operations [16] .…”
Section: Introductionmentioning
confidence: 99%
“…In computational geometry there are a lot of problems asking to construct a trajectory which is optimal with respect to some natural criteria, such as the distance, time, cost, resource consumption and so on. We refer to the papers [2,71,88,95] as good examples of finding the shortest path in a complex terrain; and to [7,35,90] as examples of finding the fastest route. We refer to the shortest paths as length-optimal trajectories and to the fastest routes as time-optimal trajectories.…”
Section: Computational Geometry and Applicationsmentioning
confidence: 99%
“…The second difficulty comes from the introduction of obstacles in the terrain. This type of problems is widely considered in computational geometry, see [1,88,95]. Usually obstacles are given by the continuous curves in three-dimensional space representing some geographic landscape.…”
Section: Computational Geometry and Applicationsmentioning
confidence: 99%
See 1 more Smart Citation