Standard

Motion planning and control of a planar polygonal linkage. / Panina, G.; Siersma, D.

в: Journal of Symbolic Computation, Том 88, 01.09.2018, стр. 5-20.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Panina, G & Siersma, D 2018, 'Motion planning and control of a planar polygonal linkage', Journal of Symbolic Computation, Том. 88, стр. 5-20. https://doi.org/10.1016/j.jsc.2018.02.002

APA

Panina, G., & Siersma, D. (2018). Motion planning and control of a planar polygonal linkage. Journal of Symbolic Computation, 88, 5-20. https://doi.org/10.1016/j.jsc.2018.02.002

Vancouver

Panina G, Siersma D. Motion planning and control of a planar polygonal linkage. Journal of Symbolic Computation. 2018 Сент. 1;88:5-20. https://doi.org/10.1016/j.jsc.2018.02.002

Author

Panina, G. ; Siersma, D. / Motion planning and control of a planar polygonal linkage. в: Journal of Symbolic Computation. 2018 ; Том 88. стр. 5-20.

BibTeX

@article{824e7479ffa0404bb19b82afd6cddc32,
title = "Motion planning and control of a planar polygonal linkage",
abstract = "For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral.",
keywords = "Изгибаемый многоугольник, конфигурационное пространство, Configuration space, Motion planning, Navigation, Polygonal linkage",
author = "G. Panina and D. Siersma",
year = "2018",
month = sep,
day = "1",
doi = "10.1016/j.jsc.2018.02.002",
language = "English",
volume = "88",
pages = "5--20",
journal = "Journal of Symbolic Computation",
issn = "0747-7171",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Motion planning and control of a planar polygonal linkage

AU - Panina, G.

AU - Siersma, D.

PY - 2018/9/1

Y1 - 2018/9/1

N2 - For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral.

AB - For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral.

KW - Изгибаемый многоугольник, конфигурационное пространство

KW - Configuration space

KW - Motion planning

KW - Navigation

KW - Polygonal linkage

UR - http://www.scopus.com/inward/record.url?scp=85042141401&partnerID=8YFLogxK

U2 - 10.1016/j.jsc.2018.02.002

DO - 10.1016/j.jsc.2018.02.002

M3 - Article

VL - 88

SP - 5

EP - 20

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

SN - 0747-7171

ER -

ID: 14085927