The HAP Heuristic System for Assembly-Operation Sequence Planning

662 Ogledov
325 Prenosov
Izvoz citacije: ABNT
ZORC, Samo ;NOE, Dragica .
The HAP Heuristic System for Assembly-Operation Sequence Planning. 
Strojniški vestnik - Journal of Mechanical Engineering, [S.l.], v. 49, n.1, p. 5-15, july 2017. 
ISSN 0039-2480.
Available at: <https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/>. Date accessed: 06 jun. 2020. 
doi:http://dx.doi.org/.
Zorc, S., & Noe, D.
(2003).
The HAP Heuristic System for Assembly-Operation Sequence Planning.
Strojniški vestnik - Journal of Mechanical Engineering, 49(1), 5-15.
doi:http://dx.doi.org/
@article{.,
	author = {Samo  Zorc and Dragica  Noe},
	title = {The HAP Heuristic System for Assembly-Operation Sequence Planning},
	journal = {Strojniški vestnik - Journal of Mechanical Engineering},
	volume = {49},
	number = {1},
	year = {2003},
	keywords = {assembly planning; assembly sequence planning; AND-OR graphs; heuristic algorithms; },
	abstract = {The assembly-operation sequence-determination process is a part of the computer-aided assemblyplanning system. Computer-aided assembly-sequence planning decisions are based on the productassembly description and the relations between parts. The space relations between product parts are directly related to the movement geometry during the assembly process, and so for the assembly sequence determination a description of the space relation between the product parts can be used. The space of all possible assembly sequences is represented by an AND/OR graph. The graph is searched for the best sequence using a variant of the AO* heuristic algorithm. Assembly sequences are evaluated with respect to geometry feasibility, stability and modularity. To cope with the flexibility, efficient algorithms for generating and searching the problem space were developed and used. Empirical evaluations show the system can deal with real-world assemblies.},
	issn = {0039-2480},	pages = {5-15},	doi = {},
	url = {https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/}
}
Zorc, S.,Noe, D.
2003 July 49. The HAP Heuristic System for Assembly-Operation Sequence Planning. Strojniški vestnik - Journal of Mechanical Engineering. [Online] 49:1
%A Zorc, Samo 
%A Noe, Dragica 
%D 2003
%T The HAP Heuristic System for Assembly-Operation Sequence Planning
%B 2003
%9 assembly planning; assembly sequence planning; AND-OR graphs; heuristic algorithms; 
%! The HAP Heuristic System for Assembly-Operation Sequence Planning
%K assembly planning; assembly sequence planning; AND-OR graphs; heuristic algorithms; 
%X The assembly-operation sequence-determination process is a part of the computer-aided assemblyplanning system. Computer-aided assembly-sequence planning decisions are based on the productassembly description and the relations between parts. The space relations between product parts are directly related to the movement geometry during the assembly process, and so for the assembly sequence determination a description of the space relation between the product parts can be used. The space of all possible assembly sequences is represented by an AND/OR graph. The graph is searched for the best sequence using a variant of the AO* heuristic algorithm. Assembly sequences are evaluated with respect to geometry feasibility, stability and modularity. To cope with the flexibility, efficient algorithms for generating and searching the problem space were developed and used. Empirical evaluations show the system can deal with real-world assemblies.
%U https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/
%0 Journal Article
%R 
%& 5
%P 11
%J Strojniški vestnik - Journal of Mechanical Engineering
%V 49
%N 1
%@ 0039-2480
%8 2017-07-07
%7 2017-07-07
Zorc, Samo, & Dragica  Noe.
"The HAP Heuristic System for Assembly-Operation Sequence Planning." Strojniški vestnik - Journal of Mechanical Engineering [Online], 49.1 (2003): 5-15. Web.  06 Jun. 2020
TY  - JOUR
AU  - Zorc, Samo 
AU  - Noe, Dragica 
PY  - 2003
TI  - The HAP Heuristic System for Assembly-Operation Sequence Planning
JF  - Strojniški vestnik - Journal of Mechanical Engineering
DO  - 
KW  - assembly planning; assembly sequence planning; AND-OR graphs; heuristic algorithms; 
N2  - The assembly-operation sequence-determination process is a part of the computer-aided assemblyplanning system. Computer-aided assembly-sequence planning decisions are based on the productassembly description and the relations between parts. The space relations between product parts are directly related to the movement geometry during the assembly process, and so for the assembly sequence determination a description of the space relation between the product parts can be used. The space of all possible assembly sequences is represented by an AND/OR graph. The graph is searched for the best sequence using a variant of the AO* heuristic algorithm. Assembly sequences are evaluated with respect to geometry feasibility, stability and modularity. To cope with the flexibility, efficient algorithms for generating and searching the problem space were developed and used. Empirical evaluations show the system can deal with real-world assemblies.
UR  - https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/
@article{{}{.},
	author = {Zorc, S., Noe, D.},
	title = {The HAP Heuristic System for Assembly-Operation Sequence Planning},
	journal = {Strojniški vestnik - Journal of Mechanical Engineering},
	volume = {49},
	number = {1},
	year = {2003},
	doi = {},
	url = {https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/}
}
TY  - JOUR
AU  - Zorc, Samo 
AU  - Noe, Dragica 
PY  - 2017/07/07
TI  - The HAP Heuristic System for Assembly-Operation Sequence Planning
JF  - Strojniški vestnik - Journal of Mechanical Engineering; Vol 49, No 1 (2003): Strojniški vestnik - Journal of Mechanical Engineering
DO  - 
KW  - assembly planning, assembly sequence planning, AND-OR graphs, heuristic algorithms, 
N2  - The assembly-operation sequence-determination process is a part of the computer-aided assemblyplanning system. Computer-aided assembly-sequence planning decisions are based on the productassembly description and the relations between parts. The space relations between product parts are directly related to the movement geometry during the assembly process, and so for the assembly sequence determination a description of the space relation between the product parts can be used. The space of all possible assembly sequences is represented by an AND/OR graph. The graph is searched for the best sequence using a variant of the AO* heuristic algorithm. Assembly sequences are evaluated with respect to geometry feasibility, stability and modularity. To cope with the flexibility, efficient algorithms for generating and searching the problem space were developed and used. Empirical evaluations show the system can deal with real-world assemblies.
UR  - https://www.sv-jme.eu/sl/article/the-hap-heuristic-system-for-assembly-operation-sequence-planning/
Zorc, Samo, AND Noe, Dragica.
"The HAP Heuristic System for Assembly-Operation Sequence Planning" Strojniški vestnik - Journal of Mechanical Engineering [Online], Volume 49 Number 1 (07 July 2017)

Avtorji

Inštitucije

  • University of Ljubljana, Faculty of Mechanical Engineering, Slovenia
  • University of Ljubljana, Faculty of Mechanical Engineering, Slovenia

Informacije o papirju

Strojniški vestnik - Journal of Mechanical Engineering 49(2003)1, 5-15

The assembly-operation sequence-determination process is a part of the computer-aided assemblyplanning system. Computer-aided assembly-sequence planning decisions are based on the productassembly description and the relations between parts. The space relations between product parts are directly related to the movement geometry during the assembly process, and so for the assembly sequence determination a description of the space relation between the product parts can be used. The space of all possible assembly sequences is represented by an AND/OR graph. The graph is searched for the best sequence using a variant of the AO* heuristic algorithm. Assembly sequences are evaluated with respect to geometry feasibility, stability and modularity. To cope with the flexibility, efficient algorithms for generating and searching the problem space were developed and used. Empirical evaluations show the system can deal with real-world assemblies.

assembly planning; assembly sequence planning; AND-OR graphs; heuristic algorithms;