Presentation 2001/1/15
New Characterization of a d_1-Optimal Motion for a Rod
Tetsuo Asano, Kirkpatrick David, Norihisa Matsumoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper gives a new characterization to the problem of finding a feasible motion from a starting configuration to a target one avoiding polygonal obstacles so that the length of the trace followed by a predetermined reference point. It gives more concise description of constituent primitive motions required for optimal motion than the traditional cell decomposition method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Robot motion planning / polynomial-time algorithm / d_1-optimality
Paper # COMP2000-72
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/1/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) New Characterization of a d_1-Optimal Motion for a Rod
Sub Title (in English)
Keyword(1) Robot motion planning
Keyword(2) polynomial-time algorithm
Keyword(3) d_1-optimality
1st Author's Name Tetsuo Asano
1st Author's Affiliation School of Information Science, JAIST()
2nd Author's Name Kirkpatrick David
2nd Author's Affiliation Dept.of Computer Science, UBC
3rd Author's Name Norihisa Matsumoto
3rd Author's Affiliation School of Information Science, JAIST
Date 2001/1/15
Paper # COMP2000-72
Volume (vol) vol.100
Number (no) 568
Page pp.pp.-
#Pages 6
Date of Issue