NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A Hierarchical Assembly Planning system
dc.creator | Chakrabarty, Sugato | |
dc.date.accessioned | 2020-09-03T21:06:29Z | |
dc.date.available | 2020-09-03T21:06:29Z | |
dc.date.issued | 1994 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-1556639 | |
dc.description | Vita. | en |
dc.description.abstract | This dissertation addresses the problem of generating feasible assembly sequences for a mechanical product from a description of it in a fundamentally new way. An operation is a motion to bring together two subassemblies to build another larger subassembly. A series of such operations which make the product from the individual parts is an assembly sequence plan or assembly plan. Current assembly planners suffer from certain problems. Firstly, they cannot find plans for large assemblies because they run into combinatorial problems. Not only that, their architecture is such that they do not appear to be modifiable to be able to handle large assemblies in a meaningful manner. Secondly, they cannot meaningfully capture measures of goodness for a plan in many cases. This dissertation makes an attempt to rectify this situation. A new hierarchical input data structure is introduced and is shown to confer certain advantages in finding a plan. One of these is the fact that case-based knowledge or advice may be incorporated easily so that better goodness measures for plans for specific structures may be realized. The input structure is also closely tied to a new planning algorithm introduced in this dissertation, which finds plans that are not necessarily optimal but close to optimal. Although in the worst case, the time complexity remains exponential, the expected time complexity of this algorithm can be polynomial with respect to the number of parts when the number of levels in the input hierarchy grows in proportion to the log of the number of parts. Furthermore, when similar substructures are repeated within an assembly, the planner can reuse subplans, thus producing better plans more quickly. An assembly planner called Hierarchical Assembly Planner (HAP,) was implemented using the above methods. Experimental results are shown for several products7 demonstrating that the predicted time savings from suboptimizing and reusing plans for similar structures are in fact realized. | en |
dc.format.extent | xiv, 110 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Major computer science | en |
dc.subject.classification | 1994 Dissertation C435 | |
dc.title | A Hierarchical Assembly Planning system | en |
dc.type | Thesis | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
thesis.degree.name | Ph. D | en |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries | |
dc.identifier.oclc | 34947549 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.