1 paper
Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu
We consider the path planning problem for a 2-link robot amidst polygonal obstacles. Our robot is parametrizable by the lengths ℓ1,ℓ2>0 of its two links, the thickness $…