The computational process for identifying bend points on a polyhedron model in a three-dimensional space is extremely complex. Therefore, calculating the shortest path consumes too much time for calculating the results from n independent nonlinear equations and for estimating the optimal solution from those results. This study presents a novel algorithm to derive an efficient motion planning on a polyhedron model. The proposed algorithm combines the computational geometry method with the numerical analysis method to obtain the bend points that pass through the shortest path. This algorithm should improve the efficiency of the motion planning process. The computational geometry method is applied to create fractional patches, to retrieve information about the patches, and to calculate the distance between two points. The numerical analysis method is applied to derive the feasible paths, and then the Dijkstra method is used to identify the shortest path between specific points of the edge boundary. An illustrative example demonstrates this algorithm's feasibility and effectiveness. The purpose of this research is to simplify the process of variant motion planning, eliminate the time needed for estimating the optimal solution of the Voronoi method, and enhance the working efficiency by around 99% of the network planning method.
|出版狀態||Published - 1 十二月 1999|
|事件||Proceedings of the 1999 IEEE/SICE/RSJ International Conference on Multisensor Fusion and Integration for Intelligent Systems, MFI'99 - Taipei, Taiwan|
持續時間: 15 八月 1999 → 18 八月 1999
|Conference||Proceedings of the 1999 IEEE/SICE/RSJ International Conference on Multisensor Fusion and Integration for Intelligent Systems, MFI'99|
|期間||15/08/99 → 18/08/99|