RESEARCH ON PATH PLANNING OF MOBILE ROBOT WITH COVERING-PATH FEATURE
Kai Li
Abstract
Kai Li
Abstract
This paper gives concept of covering path planning, its mathematics description as well as its designing method about full covering path planning. The paper also describes several kinds of performance functions of covering path motion. According to this, we design a full covering path planner based on sequence of elementary motion with synthetical performance function.
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.
This paper gives concept of covering path planning, its mathematics description as well as its designing method about full covering path planning. The paper also describes several kinds of performance functions of covering path motion. According to this, we design a full covering path planner based on sequence of elementary motion with synthetical performance function.
Key concepts: Motion planning, Computer science, Path (computing), Any-angle path planning, Planner, Mobile robot, Motion (physics), Sequence (biology)