A novel approach for motion planning
Hongying Cheng, Hongying Cheng
Abstract
Hongying Cheng, Hongying Cheng
Abstract
The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.
Key concepts: Motion planning, Configuration space, Path (computing), Any-angle path planning, Representation (politics), Computer science, Motion (physics), Transformation (genetics)