Two-handed assembly sequencing:
Abstract: "This paper considers the computational complexity of automatically determining assembly sequences for mechanical products. Specifically, we address the partitioning problem: given an assembly of rigid parts, identify a proper subassembly that can be removed as a rigid object without...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1478 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper considers the computational complexity of automatically determining assembly sequences for mechanical products. Specifically, we address the partitioning problem: given an assembly of rigid parts, identify a proper subassembly that can be removed as a rigid object without disturbing the rest of the assembly. We examine the complexity of the paritioning problem under varying types of relative motions allowed for the subassemblies. We show that when arbitrary motions are allowed to separate the two subassemblies, partitioning is NP- complete. We then describe a general framework for reasoning about assembly motions called the interference diagram. In its most general form the interference diagram yields an exponential-time algorithm to partition an assembly However, two special cases of the interface diagram studied in this paper yield polynomial-time sequencing algorithms. The first case occurs when assembly motions are restricted to single translations. The second case considers infinitesimal rigid motions in translation and rotation, and yields a superset of all feasible partitionings. |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041470 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31371872 | ||
| 035 | |a (DE-599)BVBBV009041470 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 245 | 1 | 0 | |a Two-handed assembly sequencing |c Randall H. Wilson ... |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1478 | |
| 520 | 3 | |a Abstract: "This paper considers the computational complexity of automatically determining assembly sequences for mechanical products. Specifically, we address the partitioning problem: given an assembly of rigid parts, identify a proper subassembly that can be removed as a rigid object without disturbing the rest of the assembly. We examine the complexity of the paritioning problem under varying types of relative motions allowed for the subassemblies. We show that when arbitrary motions are allowed to separate the two subassemblies, partitioning is NP- complete. We then describe a general framework for reasoning about assembly motions called the interference diagram. In its most general form the interference diagram yields an exponential-time algorithm to partition an assembly | |
| 520 | 3 | |a However, two special cases of the interface diagram studied in this paper yield polynomial-time sequencing algorithms. The first case occurs when assembly motions are restricted to single translations. The second case considers infinitesimal rigid motions in translation and rotation, and yields a superset of all feasible partitionings. | |
| 650 | 4 | |a Robotics | |
| 700 | 1 | |a Wilson, Randall H. |e Sonstige |4 oth | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1478 |w (DE-604)BV008928280 |9 1478 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982794 | ||
Datensatz im Suchindex
| _version_ | 1804123396272816128 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV009041470 |
| ctrlnum | (OCoLC)31371872 (DE-599)BVBBV009041470 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02025nam a2200301 cb4500</leader><controlfield tag="001">BV009041470</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31371872</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041470</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two-handed assembly sequencing</subfield><subfield code="c">Randall H. Wilson ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1478</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper considers the computational complexity of automatically determining assembly sequences for mechanical products. Specifically, we address the partitioning problem: given an assembly of rigid parts, identify a proper subassembly that can be removed as a rigid object without disturbing the rest of the assembly. We examine the complexity of the paritioning problem under varying types of relative motions allowed for the subassemblies. We show that when arbitrary motions are allowed to separate the two subassemblies, partitioning is NP- complete. We then describe a general framework for reasoning about assembly motions called the interference diagram. In its most general form the interference diagram yields an exponential-time algorithm to partition an assembly</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">However, two special cases of the interface diagram studied in this paper yield polynomial-time sequencing algorithms. The first case occurs when assembly motions are restricted to single translations. The second case considers infinitesimal rigid motions in translation and rotation, and yields a superset of all feasible partitionings.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robotics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilson, Randall H.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1478</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1478</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982794</subfield></datafield></record></collection> |
| id | DE-604.BV009041470 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982794 |
| oclc_num | 31371872 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 26 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Two-handed assembly sequencing Randall H. Wilson ... Stanford, Calif. 1993 26 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1478 Abstract: "This paper considers the computational complexity of automatically determining assembly sequences for mechanical products. Specifically, we address the partitioning problem: given an assembly of rigid parts, identify a proper subassembly that can be removed as a rigid object without disturbing the rest of the assembly. We examine the complexity of the paritioning problem under varying types of relative motions allowed for the subassemblies. We show that when arbitrary motions are allowed to separate the two subassemblies, partitioning is NP- complete. We then describe a general framework for reasoning about assembly motions called the interference diagram. In its most general form the interference diagram yields an exponential-time algorithm to partition an assembly However, two special cases of the interface diagram studied in this paper yield polynomial-time sequencing algorithms. The first case occurs when assembly motions are restricted to single translations. The second case considers infinitesimal rigid motions in translation and rotation, and yields a superset of all feasible partitionings. Robotics Wilson, Randall H. Sonstige oth Computer Science Department: Report STAN CS Stanford University 1478 (DE-604)BV008928280 1478 |
| spellingShingle | Two-handed assembly sequencing Robotics |
| title | Two-handed assembly sequencing |
| title_auth | Two-handed assembly sequencing |
| title_exact_search | Two-handed assembly sequencing |
| title_full | Two-handed assembly sequencing Randall H. Wilson ... |
| title_fullStr | Two-handed assembly sequencing Randall H. Wilson ... |
| title_full_unstemmed | Two-handed assembly sequencing Randall H. Wilson ... |
| title_short | Two-handed assembly sequencing |
| title_sort | two handed assembly sequencing |
| topic | Robotics |
| topic_facet | Robotics |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT wilsonrandallh twohandedassemblysequencing |