CONTENT BASED SEARCH OF MECHANICAL ASSEMBLIES
| dc.contributor.advisor | Gupta, Satyandra K | en_US |
| dc.contributor.author | Deshmukh, Abhijit | en_US |
| dc.contributor.department | Mechanical Engineering | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2007-02-01T20:22:06Z | |
| dc.date.available | 2007-02-01T20:22:06Z | |
| dc.date.issued | 2006-11-24 | en_US |
| dc.description.abstract | The increased use of 3D CAD systems by product development organizations has resulted in large databases of assemblies; this explosion of assembly data will continue in the future. Currently, there are no effective content-based techniques to search these databases. Ability to perform content-based searches on these databases is expected to help the designers in the following two ways. First, it can facilitate reuse of existing assembly designs, thereby reducing the design time. Second, a lot of useful Design for Manufacturing and Assembly (DFMA) knowledge is embedded in existing assemblies. Therefore a capability to locate existing assemblies and examine them can be used as a learning tool by the designers to learn from the existing assembly designs and hence transfer the best DFMA practices to new designers. This thesis describes a system for performing content-based searches on assembly databases. It lists the templates identified for comprehensive search definitions and describes algorithms to perform content-based searches for mechanical assemblies. The characteristics of mechanical assemblies were identified and categorized based on their similarity and computational complexity to perform comparison. The characteristics were extracted from the CAD data to prepare a CAD independent signature of the assembly. The search methodology consists of exact and approximate string matching, number matching and computing graph compatibility. Various research groups have solved the former two problems. This thesis describes a new algorithm to solve graph compatibility problem using branch and bound search. The performance of this algorithm has been experimentally characterized using randomly generated graphs. This search software provides a CAD format independent tool to perform content based search of assemblies based on the form of assemblies. The capabilities of the search software have been illustrated in this thesis through several examples. This search tool can contribute to significantly reduce the design time and reuse of the knowledge in existing designs. | en_US |
| dc.format.extent | 1245090 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4140 | |
| dc.language.iso | en_US | |
| dc.subject.pqcontrolled | Engineering, Mechanical | en_US |
| dc.title | CONTENT BASED SEARCH OF MECHANICAL ASSEMBLIES | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1