HOW TO MOVE A CHAIR THROUGH A DOOR.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The author defines the door-width of a simple polygon (a 'chair') and give an O(n**2) algorithm for computing its door-width. It is first shown that all passages of the chair through the door can be reduced to a sequence of certain elementary motions. The author introduces the technique of constraint analysis in characterizing elementary motions. The algorithm actually constructs a motion of the chair through a door, and thus is a 'local expert' for planning motion through doors. Such algorithms have applications in more general motion-planning systems in robotics.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages1320-1325
Number of pages6
ISBN (Print)0818607874
StatePublished - 1987

Fingerprint

Motion planning
Robotics

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yap, C. (1987). HOW TO MOVE A CHAIR THROUGH A DOOR. In Unknown Host Publication Title (pp. 1320-1325). IEEE.

HOW TO MOVE A CHAIR THROUGH A DOOR. / Yap, Chee.

Unknown Host Publication Title. IEEE, 1987. p. 1320-1325.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yap, C 1987, HOW TO MOVE A CHAIR THROUGH A DOOR. in Unknown Host Publication Title. IEEE, pp. 1320-1325.
Yap C. HOW TO MOVE A CHAIR THROUGH A DOOR. In Unknown Host Publication Title. IEEE. 1987. p. 1320-1325
Yap, Chee. / HOW TO MOVE A CHAIR THROUGH A DOOR. Unknown Host Publication Title. IEEE, 1987. pp. 1320-1325
@inproceedings{feee96e5e61244aab135e35cb7511f1e,
title = "HOW TO MOVE A CHAIR THROUGH A DOOR.",
abstract = "The author defines the door-width of a simple polygon (a 'chair') and give an O(n**2) algorithm for computing its door-width. It is first shown that all passages of the chair through the door can be reduced to a sequence of certain elementary motions. The author introduces the technique of constraint analysis in characterizing elementary motions. The algorithm actually constructs a motion of the chair through a door, and thus is a 'local expert' for planning motion through doors. Such algorithms have applications in more general motion-planning systems in robotics.",
author = "Chee Yap",
year = "1987",
language = "English (US)",
isbn = "0818607874",
pages = "1320--1325",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - HOW TO MOVE A CHAIR THROUGH A DOOR.

AU - Yap, Chee

PY - 1987

Y1 - 1987

N2 - The author defines the door-width of a simple polygon (a 'chair') and give an O(n**2) algorithm for computing its door-width. It is first shown that all passages of the chair through the door can be reduced to a sequence of certain elementary motions. The author introduces the technique of constraint analysis in characterizing elementary motions. The algorithm actually constructs a motion of the chair through a door, and thus is a 'local expert' for planning motion through doors. Such algorithms have applications in more general motion-planning systems in robotics.

AB - The author defines the door-width of a simple polygon (a 'chair') and give an O(n**2) algorithm for computing its door-width. It is first shown that all passages of the chair through the door can be reduced to a sequence of certain elementary motions. The author introduces the technique of constraint analysis in characterizing elementary motions. The algorithm actually constructs a motion of the chair through a door, and thus is a 'local expert' for planning motion through doors. Such algorithms have applications in more general motion-planning systems in robotics.

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

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

M3 - Conference contribution

AN - SCOPUS:0023246986

SN - 0818607874

SP - 1320

EP - 1325

BT - Unknown Host Publication Title

PB - IEEE

ER -