Lecture

Assembly: Mechanism Theory

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MICRO-301: Manufacturing technologies

This course gives an introduction to production methods and manufacturing technologies used in microengineering. The focus is given on the understanding of physical phenomena underlying the processes, the relation between materials, manufacturing processes ...

Description

This lecture covers the problem statement of assembly, precision assembly, and the introduction to Design For Assembly (DFA) principles. It discusses the cost of an assembly, the notion of assembly, precision requirements, common couplings, stability, positioning errors, spatial vectors, force, and velocity. The lecture also delves into graph theory, degrees of freedom, mobility analysis, and the methodologies for optimizing assembly design. It emphasizes the importance of Design For Assembly (DFA) and Design For Manufacturing (DFM) principles in reducing costs and optimizing manufacturing processes.

Instructors (2)

Yves Bellouard

Dr. Yves Bellouard is Associate Professor in Microengineering at Ecole Polytechnique Fédérale de Lausanne (EPFL) in Switzerland, where he heads the Galatea lab and the Richemont Chair in micromanufacturing. He received a BS in Theoretical Physics and a MS in Applied Physics from Université Pierre et Marie Curie in Paris, France in 1994-1995 and a PhD in Microengineering from Ecole Polytechnique Fédérale de Lausanne (EPFL) in Lausanne, Switzerland in 2000. For his PhD work, he received the Omega Scientific prize (2001) for outstanding contribution in the field of microengineering for his work on Shape Memory Alloys. Before joining EPFL in 2015, he was Associate Professor at Eindhoven University of Technologies (TU/e) in the Netherlands and prior to that, Research Scientist at Rensselaer Polytechnic Institute (RPI) in Troy, New York for about four years where he started working on femtosecond laser processing of glass materials. From 2010 until 2013, Yves Bellouard initiated and coordinated the Femtoprint project, a European research initiative aiming at investigating a table-top printer for microsystems ('3D printing of microsystems'). In 2013, he received a prestigious ERC Starting Grant (Consolidator-2012) from the European Research Council and a JSPS Fellowship from the Japan Society for the Promotion of Science. His current research interests are on new paradigms for system integration at the microscale and in particular laser-based methods to tailor material properties for achieving higher level of integration in microsystems, like for instance integrating optics, mechanics and fluidics in a single monolith. These approaches open new opportunities for direct-write methods of microsystems (3D printing). Personal website

Vivek Subramanian

Teaching & PhD PhD Students Giovanni Ruffolo, Giada Romano, Sanjay Manoharan, Kyle Haas, Claude Dahan, Biruktait Ayele Lemecho, Yagmur Ceren Alatas, Tugçe Delipinar Past EPFL PhD Students Amin Hodaei, Mustafa Mohieldin Fadlelmula Fadlelseed Past EPFL PhD Students as codirector Mohammad Jafarpour Courses Organic and printed electronics MICRO-505 This course addresses the implementation of organic and printed electronics technologies using large area manufacturing techniques. It will provide

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Graph (discrete mathematics)

In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges.

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Related lectures (49)

Facebook Social Graph: Structure and Small-World Phenomenon

Examines the Facebook social graph structure, small-world phenomenon, four degrees of separation, and user homophily.

Assembly: Physics of Manufacturing

Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.

Linear Transformations: Matrices and Kernels

Covers linear transformations, matrices, kernels, and properties of invertible matrices.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Newton's Laws: Inertia and Motion

Covers Newton's first and second laws, inertia, force, momentum, and action-reaction principle in mechanics.