IN THIS ARTICLE, WE PRESENT THE DEVELOPMENT OF A SIMPLE MULTIAGENT-BASED SYSTEM FOR THE CONTROL OF A FLEXIBLE MANUFACTURING SYSTEM. WE FOLLOWED THE STAGES OF A METHODOLOGY SPECIALLY CONCEIVED FOR THE DEVELOPMENT OF AGENT-BASED SYSTEM, WHICH IS AN INTEGRATION OF THE CLASSICAL METHODOLOGY FOR AGENT-ORIENTED ANALYSIS AND DESIGN GAIA, AND AUML (AGENT-UNIFIED MODELING LANGUAGE). WE ADOPTED AS STUDY CASE THE CIMUBB LABORATORY AT THE UNIVERSITY OF BIO-BIO, WHICH HAS A FLEXIBLE MANUFACTURING SYSTEM INCLUDING THREE FLEXIBLE MANUFACTURING CELLS INTERCONNECTED BY A CONVEYOR BELT. IN THE ANALYSIS STAGE, WE IDENTIFIED ROLES INVOLVED, AND WE DESIGN MODELS REPRESENTING ROLES AND PROTOCOLS. IN THE DESIGN STAGE, WE APPLIED GAIA AGENT, SERVICES, AND ACQUAINTANCE MODELS FROM GAIA, AND WE COMPLEMENTED WITH AUML AS THE ADOPTED METHODOLOGY SUGGESTS. WITH THE DEVELOPED MODELS, WE CONSTRUCTED A FULLY FUNCTIONAL SYSTEM WHERE EACH AGENT WAS BUILT AS AN INDEPENDENT PROCESS TREE. AGENTS COMMUNICATE BY PASSING MESSAGES THROUGH THE ETHERNET NETWORK WITH SOCKET INTERFACES. VARIOUS TESTS EXECUTED IN OUR LABORATORY SCALE MANUFACTURING SYSTEM SHOW THE EFFECTIVENESS OF OUR IMPLEMENTATION. COPYRIGHT © 2015 JOHN WILEY & SONS, LTD.

A NOVEL PARALLELIZATION OF THE LEPP-BISECTION ALGORITHM FOR TRIANGULATION REFINEMENT ON MULTICORE SYSTEMS IS PRESENTED. RANDOMIZATION AND WISE USE OF THE MEMORY HIERARCHY ARE SHOWN TO HIGHLY IMPROVE ALGORITHM PERFORMANCE. GIVEN A LIST OF SELECTED TRIANGLES TO BE REFINED, RANDOM SELECTION OF CANDIDATES TOGETHER WITH PRE-FETCHING OF LEPP-SUBMESHES LEAD TO A SCALABLE AND EFFICIENT MULTI-CORE PARALLEL IMPLEMENTATION. THE QUALITY OF THE REFINEMENT IS SHOWN TO BE PRESERVED.

LONGEST EDGE (NESTED) ALGORITHMS FOR TRIANGULATION REFINEMENT IN TWO DIMENSIONS ARE ABLE TO PRODUCE HIERARCHIES OF QUALITY AND NESTED IRREGULAR TRIANGULATIONS AS NEEDED BOTH FOR ADAPTIVE FINITE ELEMENT METHODS AND FOR MULTIGRID METHODS. THEY CAN BE FORMULATED IN TERMS OF THE LONGEST EDGE PROPAGATION PATH (LEPP) AND TERMINAL EDGE CONCEPTS, TO REFINE THE TARGET TRIANGLES AND SOME RELATED NEIGHBORS. WE DISCUSS A PARALLEL MULTITHREAD ALGORITHM, WHERE EVERY THREAD IS IN CHARGE OF REFINING A TRIANGLE T AND ITS ASSOCIATED LEPP NEIGHBORS. THE THREAD MANAGES A CHANGING LEPP(T) (ORDERED SET OF INCREASING TRIANGLES) BOTH TO FIND A LAST LONGEST (TERMINAL) EDGE AND TO REFINE THE PAIR OF TRIANGLES SHARING THIS EDGE. THE PROCESS IS REPEATED UNTIL TRIANGLE T IS DESTROYED. WE DISCUSS THE ALGORITHM, RELATED SYNCHRONIZATION ISSUES, AND THE PROPERTIES INHERITED FROM THE SERIAL ALGORITHM. WE PRESENT AN EMPIRICAL STUDY THAT SHOWS THAT A REASONABLY EFFICIENT PARALLEL METHOD WITH GOOD SCALABILITY WAS OBTAINED.

WE DISCUSS A NEW SIMPLE LEPP-BASED ALGORITHM FOR MESH REFINEMENT THAT USE NEW SIMPLE POINT INSERTION STRATEGIES. WE PRESENT AN EMPIRICAL STUDY OF THE ALGORITHM BEHAVIOR TO OBTAIN GOOD QUALITY 2-DIMENSIONAL AND 3-DIMENSIONAL MESHES. THE QUALITY OF THE ELEMENTS OF THE FINAL MESHES ARE MEASURED BY USING QUALITY METRICS BASED ON THE SHAPE OF THE ELEMENTS AND THE MINIMAL INTERIOR ANGLE.

AN IMPROVED LEPP BASED, TERMINAL TRIANGLES CENTROID ALGORITHM FOR CONSTRAINED DELAUNAY QUALITY TRIANGULATION IS DISCUSSED AND STUDIED. FOR EACH BAD QUALITY TRIANGLE T, THE ALGORITHM USES THE LONGEST EDGE PROPAGATING PATH (LEPP(T)) TO FIND A COUPLE OF DELAUNAY TERMINAL TRIANGLES (WITH LARGEST ANGLES LESS THAN OR EQUAL TO 120?) SHARING A COMMON LONGEST (TERMINAL) EDGE. THEN THE CENTROID OF THE TERMINAL QUADRILATERAL IS DELAUNAY INSERTED IN THE MESH. BISECTION OF SOME CONSTRAINED EDGES ARE ALSO PERFORMED TO ASSURE FAST CONVERGENCE. WE PROVE ALGORITHM TERMINATION AND THAT A GRADED, OPTIMAL SIZE, 30? TRIANGULATION IS OBTAINED, FOR ANY PLANAR STRAIGHT LINE GRAPH (PSLG) GEOMETRY WITH CONSTRAINED ANGLES GREATER THAN OR EQUAL TO 30?.