Name
Abstract | ||
|---|---|---|
The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is presented. The mobile object was taken as a point-size auto equipped with a sensor system, which is used to detect previously all visible parts of the obstacles surrounding it. Both the visibility and the tangent graph were modified and used in this algorithm to construct the basic concept. At each stage, the next subgoal was selected from local information provided by the sensor. Furthermore, in order to expand the algorithm to handle nonconvex polygonal obstacles and mazes, it was modified by adding backtracking and by removing visited vertices. The algorithm was implemented in MATLAB language, and several numerical examples are shown to evaluate its feasibility. Moreover, the convergence of the algorithm was examined using the visibility graph, and the performance of the algorithm was evaluated by simply comparing with other algorithms for both the length of the path and the traveling time from the initial point to the target point. (C) 2010 Wiley Periodicals, Inc. Comput Appl Eng Educ 20: 713720, 2012 |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1002/cae.20441 | COMPUTER APPLICATIONS IN ENGINEERING EDUCATION |
Keywords | Field | DocType |
on-line algorithm,convex polygonal obstacle,path planning | Convergence (routing),Motion planning,Visibility,Polygon,Mathematical optimization,Visibility graph,Simulation,Computer science,Terrain,Algorithm,Suurballe's algorithm,Backtracking | Journal |
Volume | Issue | ISSN |
20.0 | 4.0 | 1061-3773 |
Citations | PageRank | References |
1 | 0.37 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chien-Wan Hun | 1 | 1 | 0.37 |
| Hun-Chen Chen | 2 | 108 | 11.20 |
| Ming-Fung Hwang | 3 | 1 | 0.37 |