Academic Journal
Προβολή σε EDS

D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly.
Συγγραφείς: Liangjun Zhang1 zlj@cs.unc.edu, Xin Huang1 huangxin@cs.unc.edu, Kim, Young J.2 kimy@ewha.ac.kr, Manocha, Dinesh1 dm@cs.unc.edu
Πηγή: Computer-Aided Design & Applications. 2008, Vol. 5 Issue 6, p774-786. 13p. 5 Color Photographs, 7 Diagrams, 3 Charts.
Θεματικοί όροι: *Prototypes, *Algorithms, *Computer-aided design, Disassemblers (Computer programs), Automobile parts, Topology
Περίληψη: We present a novel approach to compute a collision-free path for part disassembly simulation and virtual prototyping of part removal. Our algorithm is based on sample-based motion planning that connects collision-free samples in the configuration space using local planning. In order to effectively handle the tight-fitting scenarios, we describe techniques to generate samples in narrow passages and efficient local planning algorithms to connect them with collision-free paths. Our approach is general and makes no assumption about model connectivity or object topology, and can handle polygon soup models that frequently arise in CAD applications. We highlight the performance on many challenging benchmarks including the Alpha puzzle, maintainability of the windscreen wiper motion, and disassembly of a seat from the interior of a car body. [ABSTRACT FROM AUTHOR]
Copyright of Computer-Aided Design & Applications is the property of Computer-Aided Design & Applications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Business Source Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:bsx&genre=article&issn=16864360&ISBN=&volume=5&issue=6&date=20080701&spage=774&pages=774-786&title=Computer-Aided Design & Applications&atitle=D-Plan%3A%20Efficient%20Collision-Free%20Path%20Computation%20for%20Part%20Removal%20and%20Disassembly.&aulast=Liangjun%20Zhang&id=DOI:10.3722/cadaps.2008.774-786
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: bsx
DbLabel: Business Source Index
An: 35866200
RelevancyScore: 1171
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1171.3779296875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Liangjun+Zhang%22">Liangjun Zhang</searchLink><relatesTo>1</relatesTo><i> zlj@cs.unc.edu</i><br /><searchLink fieldCode="AR" term="%22Xin+Huang%22">Xin Huang</searchLink><relatesTo>1</relatesTo><i> huangxin@cs.unc.edu</i><br /><searchLink fieldCode="AR" term="%22Kim%2C+Young+J%2E%22">Kim, Young J.</searchLink><relatesTo>2</relatesTo><i> kimy@ewha.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Manocha%2C+Dinesh%22">Manocha, Dinesh</searchLink><relatesTo>1</relatesTo><i> dm@cs.unc.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer-Aided+Design+%26+Applications%22">Computer-Aided Design & Applications</searchLink>. 2008, Vol. 5 Issue 6, p774-786. 13p. 5 Color Photographs, 7 Diagrams, 3 Charts.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Prototypes%22">Prototypes</searchLink><br />*<searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br />*<searchLink fieldCode="DE" term="%22Computer-aided+design%22">Computer-aided design</searchLink><br /><searchLink fieldCode="DE" term="%22Disassemblers+%28Computer+programs%29%22">Disassemblers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Automobile+parts%22">Automobile parts</searchLink><br /><searchLink fieldCode="DE" term="%22Topology%22">Topology</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We present a novel approach to compute a collision-free path for part disassembly simulation and virtual prototyping of part removal. Our algorithm is based on sample-based motion planning that connects collision-free samples in the configuration space using local planning. In order to effectively handle the tight-fitting scenarios, we describe techniques to generate samples in narrow passages and efficient local planning algorithms to connect them with collision-free paths. Our approach is general and makes no assumption about model connectivity or object topology, and can handle polygon soup models that frequently arise in CAD applications. We highlight the performance on many challenging benchmarks including the Alpha puzzle, maintainability of the windscreen wiper motion, and disassembly of a seat from the interior of a car body. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer-Aided Design & Applications is the property of Computer-Aided Design & Applications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=35866200
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3722/cadaps.2008.774-786
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 774
    Subjects:
      – SubjectFull: Prototypes
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Computer-aided design
        Type: general
      – SubjectFull: Disassemblers (Computer programs)
        Type: general
      – SubjectFull: Automobile parts
        Type: general
      – SubjectFull: Topology
        Type: general
    Titles:
      – TitleFull: D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Liangjun Zhang
      – PersonEntity:
          Name:
            NameFull: Xin Huang
      – PersonEntity:
          Name:
            NameFull: Kim, Young J.
      – PersonEntity:
          Name:
            NameFull: Manocha, Dinesh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: 2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 16864360
          Numbering:
            – Type: volume
              Value: 5
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Computer-Aided Design & Applications
              Type: main
ResultId 1