Relevant bibliographies by topics / Graph-based enumeration

Academic literature on the topic 'Graph-based enumeration'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph-based enumeration.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph-based enumeration"

1

Sanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi, and Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques." ACM Transactions on Knowledge Discovery from Data 15, no. 5 (June 26, 2021): 1–21. http://dx.doi.org/10.1145/3446637.

Full text
Abstract:
Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected structures with applications in bioinformatics and social network analysis. However, enumerating quasi-cliques in a graph is a challenging problem, even harder than the problem of enumerating cliques. We consider the enumeration of top- k degree-based quasi-cliques and make the following contributions: (1) we show that even the problem of detecting whether a given quasi-clique is maximal (i.e., not contained within another quasi-clique) is NP-hard. (2) We present a novel heuristic algorithm K ernel QC to enumerate the k largest quasi-cliques in a graph. Our method is based on identifying kernels of extremely dense subgraphs within a graph, followed by growing subgraphs around these kernels, to arrive at quasi-cliques with the required densities. (3) Experimental results show that our algorithm accurately enumerates quasi-cliques from a graph, is much faster than current state-of-the-art methods for quasi-clique enumeration (often more than three orders of magnitude faster), and can scale to larger graphs than current methods.
APA, Harvard, Vancouver, ISO, and other styles
2

Simoni, Roberto, Andrea Piga Carboni, and Daniel Martins. "Enumeration of parallel manipulators." Robotica 27, no. 4 (July 2009): 589–97. http://dx.doi.org/10.1017/s0263574708004979.

Full text
Abstract:
SUMMARYIn this paper, we present a new method of enumeration of parallel manipulators with one end-effector. The method consists of enumerating all the manipulators possible with one end-effector that a single kinematic chain can originate. A very useful simplification for kinematic chain, mechanism and manipulator enumeration is their representation through graphs. The method is based on group theory where abstract structures are used to capture the internal symmetry of a structure in the form of automorphisms of a group. The concept used is orbits of the group of automorphisms of a colored vertex graph. The theory and some examples are presented to illustrate the method.
APA, Harvard, Vancouver, ISO, and other styles
3

shaik, Fathimabi, RBV Subramanyam, and DVLN Somayajulu. "Map-Reduce based Multiple Sub-Graph Enumeration Using Dominating-Set Graph Partition." International Journal of Information Engineering and Electronic Business 9, no. 2 (March 8, 2017): 36–44. http://dx.doi.org/10.5815/ijieeb.2017.02.05.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Trefftz, Christian, Hugh McGuire, Zachary Kurmas, and Jerry Scripps. "Exhaustive Community Enumeration in Parallel." Parallel Processing Letters 26, no. 02 (June 2016): 1650006. http://dx.doi.org/10.1142/s0129626416500067.

Full text
Abstract:
An algorithm to evaluate/count all the possible communities of a graph is presented. An associated unrank function is described. An implementation of an existing algorithm to evaluate all the possible partitions of a graph, based on an unrank function, is presented as well. Performance results of the parallelizations of these algorithms obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.
APA, Harvard, Vancouver, ISO, and other styles
5

Ma, Ming Yue, and Xiang Yang Xu. "A Novel Algorithm for Enumeration of the Planetary Gear Train Based on Graph Theory." Advanced Materials Research 199-200 (February 2011): 392–99. http://dx.doi.org/10.4028/www.scientific.net/amr.199-200.392.

Full text
Abstract:
As well known, graph theory is a powerful tool for mechanism design. The enumeration of planet gear trains can be converted the synthesis of graphs while a planetary gear train is converted to a graph. During the enumeration of graphs, the problem of isomorphism should be solved. This paper proposes a novel algorithm used to generate non-isomorphism graphs and thereby omits the part of isomorphism detection. The vertex characteristic is firstly defined in this paper that is the core of the enumeration algorithm. This paper also gives an example of the application for the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Shanshan, Chenglong Xiao, and Wanjun Liu. "Parallel Enumeration of Custom Instructions Based on Multidepth Graph Partitioning." IEEE Embedded Systems Letters 11, no. 1 (March 2019): 1–4. http://dx.doi.org/10.1109/les.2018.2812784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Lu, Chengfei Liu, Rui Zhou, Jiajie Xu, and Jianxin Li. "Efficient maximal biclique enumeration for large sparse bipartite graphs." Proceedings of the VLDB Endowment 15, no. 8 (April 2022): 1559–71. http://dx.doi.org/10.14778/3529337.3529341.

Full text
Abstract:
Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs. Maximal biclique enumeration (MBE) is challenging since the number of the maximal bicliques grows exponentially w.r.t. the number of vertices in a bipartite graph in the worst case. However, a large bipartite graph is usually very sparse, which is against the worst case and may lead to fast MBE algorithms. The uncharted opportunity is taking advantage of the sparsity to substantially improve the MBE efficiency for large sparse bipartite graphs. We observe that for a large sparse bipartite graph, a vertex u may converge to a few vertices in the same vertex set as u via its neighbours, which reveals that the enumeration scope for a vertex could be very small. Based on this observation, we propose novel concepts: unilateral coreness for individual vertices, unilateral order for each vertex set and unilateral convergence (ζ) for a large sparse bipartite graph, ζ could be a few thousand for a large sparse bipartite graph with hundreds of million edges. Using the unilateral order, every vertex with τ unilateral coreness only needs to check at most 2 τ combinations so that all maximal bicliques can be enumerated and τ is bounded by ζ, which leads to a novel MBE algorithm running in O * (2 ζ ). We then propose a batch-pivots technique to eliminate all enumerations resulting in non-maximal bicliques, which guarantees that every maximal biclique is reported in O (ζ e )-delay, where e is the number of edges. We devise novel data structures that allow storing subgraphs at omissible space for further speeding up MBE. Extensive experiments are conducted on synthetic and real large datasets to justify that our proposed algorithm is faster and more scalable than the existing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
8

KHAKABIMAMAGHANI, SAHAND, MASOOD MASJOODY, and LADISLAV STACHO. "Traversal with Enumeration of Geometric Graphs in Bounded Space." Journal of Interconnection Networks 19, no. 04 (December 2019): 1950008. http://dx.doi.org/10.1142/s0219265919500087.

Full text
Abstract:
In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph G with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph can be traversed using a known algorithm which is based on face routing. To overcome the problem with hypothetical vertices and edges, we develop an algorithm for visiting any k-th neighborhood of a vertex in a graph straight-line drawn in the plane using O(k log k) memory. The memory needed to complete the traversal of a geometric graph then turns out to depend on the maximum graph distance among pairs of distinct vertices of G whose Euclidean distance is greater than one and less than [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Yu, An Wang, Hua Wang, Wei-Ting Zhao, and Dao-Qiang Sun. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution." Mathematics 7, no. 5 (May 24, 2019): 472. http://dx.doi.org/10.3390/math7050472.

Full text
Abstract:
The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction. Motivated from the study of graph surgeries on evolutionary dynamics, we consider the subtree problems of fan graphs, wheel graphs, and the class of graphs obtained from “partitioning” wheel graphs under dynamic evolution. The enumeration of these subtree numbers is done through the so-called subtree generation functions of graphs. With the enumerative result, we briefly explore the extremal problems in the corresponding class of graphs. Some interesting observations on the behavior of the subtree number are also presented.
APA, Harvard, Vancouver, ISO, and other styles
10

Kruse, Sebastian, Zoi Kaoudi, Bertty Contreras-Rojas, Sanjay Chawla, Felix Naumann, and Jorge-Arnulfo Quiané-Ruiz. "RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems." VLDB Journal 29, no. 6 (May 18, 2020): 1287–310. http://dx.doi.org/10.1007/s00778-020-00612-x.

Full text
Abstract:
AbstractData analytics are moving beyond the limits of a single platform. In this paper, we present the cost-based optimizer of Rheem, an open-source cross-platform system that copes with these new requirements. The optimizer allocates the subtasks of data analytic tasks to the most suitable platforms. Our main contributions are: (i) a mechanism based on graph transformations to explore alternative execution strategies; (ii) a novel graph-based approach to determine efficient data movement plans among subtasks and platforms; and (iii) an efficient plan enumeration algorithm, based on a novel enumeration algebra. We extensively evaluate our optimizer under diverse real tasks. We show that our optimizer can perform tasks more than one order of magnitude faster when using multiple platforms than when using a single platform.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graph-based enumeration"

1

Jayachandran, Jayakanth. "Improving resiliency using graph based evolutionary algorithms." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2010. http://scholarsmine.mst.edu/thesis/pdf/Jayachandran_09007dcc807d6ba6.pdf.

Full text
Abstract:
Thesis (M.S.)--Missouri University of Science and Technology, 2010.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed July 19, 2010) Includes bibliographical references (p. 56-62).
APA, Harvard, Vancouver, ISO, and other styles
2

Jira, Jindalertudomdee. "Chemical Compound Enumeration and Host-Pathogen Protein Interaction Prediction by Graph-Based Approaches." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/217198.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph-based enumeration"

1

Wells, J. B., and Boris Yakobowski. "Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis." In Logic Based Program Synthesis and Transformation, 262–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11506676_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Hui, Yue Ma, and Nicole Bidoit. "Hypergraph-Based Inference Rules for Computing $$\mathcal{EL}\mathcal{}^+$$-Ontology Justifications." In Automated Reasoning, 310–28. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_19.

Full text
Abstract:
AbstractTo give concise explanations for a conclusion obtained by reasoning over ontologies, justifications have been proposed as minimal subsets of an ontology that entail the given conclusion. Even though computing one justification can be done in polynomial time for tractable Description Logics such as $$\mathcal{EL}\mathcal{}^+$$ EL + , computing all justifications is complicated and often challenging for real-world ontologies. In this paper, based on a graph representation of $$\mathcal{EL}\mathcal{}^+$$ EL + -ontologies, we propose a new set of inference rules (called H-rules) and take advantage of them for providing a new method of computing all justifications for a given conclusion. The advantage of our setting is that most of the time, it reduces the number of inferences (generated by H-rules) required to derive a given conclusion. This accelerates the enumeration of justifications relying on these inferences. We validate our approach by running real-world ontology experiments. Our graph-based approach outperforms PULi [14], the state-of-the-art algorithm, in most of cases.
APA, Harvard, Vancouver, ISO, and other styles
3

Bottreau, Anne, and Yves Métivier. "Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling." In Lecture Notes in Computer Science, 110–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053545.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bhattacharya, Somak, Samresh Malhotra, and S. K. Ghosh. "An Attack Graph Based Approach for Threat Identification of an Enterprise Network." In Cyber Security and Global Information Assurance, 23–47. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-326-5.ch002.

Full text
Abstract:
As networks continue to grow in size and complexity, automatic assessment of the security vulnerability becomes increasingly important. The typical means by which an attacker breaks into a network is through a series of exploits, where each exploit in the series satisfies the pre-condition for subsequent exploits and makes a causal relationship among them. Such a series of exploits constitutes an attack path where the set of all possible attack paths form an attack graph. Attack graphs reveal the threat by enumerating all possible sequences of exploits that can be followed to compromise a given critical resource. The contribution of this chapter is to identify the most probable attack path based on the attack surface measures of the individual hosts for a given network and also identify the minimum possible network securing options for a given attack graph in an automated fashion. The identified network securing options are exhaustive and the proposed approach aims at detecting cycles in forward reachable attack graphs. As a whole, the chapter deals with identification of probable attack path and risk mitigation which may facilitate in improving the overall security of an enterprise network.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph-based enumeration"

1

Abidi, Aman, Rui Zhou, Lu Chen, and Chengfei Liu. "Pivot-based Maximal Biclique Enumeration." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/492.

Full text
Abstract:
Enumerating maximal bicliques in a bipartite graph is an important problem in data mining, with innumerable real-world applications across different domains such as web community, bioinformatics, etc. Although substantial research has been conducted on this problem, surprisingly, we find that pivot-based search space pruning, which is quite effective in clique enumeration, has not been exploited in biclique scenario. Therefore, in this paper, we explore the pivot-based pruning for biclique enumeration. We propose an algorithm for implementing the pivot-based pruning, powered by an effective index structure Containment Directed Acyclic Graph (CDAG). Meanwhile, existing literature indicates contradictory findings on the order of vertex selection in biclique enumeration. As such, we re-examine the problem and suggest an offline ordering of vertices which expedites the pivot pruning. We conduct an extensive performance study using real-world datasets from a wide range of domains. The experimental results demonstrate that our algorithm is more scalable and outperforms all the existing algorithms across all datasets and can achieve a significant speedup against the previous algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Hong-Sen, Feng-Ming Ou, and Ming-Feng Tang. "An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks." In ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57295.

Full text
Abstract:
An algorithm is presented, based on graph theory, for enumerating all feasible serial and/or parallel combined mechanisms from the given rotary or translational power source and specific kinematic building blocks. Through the labeled out-tree representations for the configurations of combined mechanisms, the enumeration procedure is developed by adapting the algorithm for the enumeration of trees. A rotary power source and four kinematic building blocks: a crank-rocker linkage, a rack-pinion, a double-slider mechanism, and a cam-follower mechanism, are chosen as the combination to illustrate the algorithm. And, two examples are provided to validate the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

Herber, Daniel R. "Enhancements to the Perfect Matching Approach for Graph Enumeration-Based Engineering Challenges." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22774.

Full text
Abstract:
Abstract Graphs can be used to represent many engineering systems and decisions because of their ability to capture discrete compositional and relational information. In this article, improved methods for effectively representing and generating all graphs in a space defined by certain complex specifications are presented. These improvements are realized through enhancements to the original perfect matching-inspired approach utilizing a component catalog definition to capture the graphs of interest. These enhancements will come in many forms, including more efficient graph enumeration and labeled graph isomorphism checking, expansion of the definition of the component catalog, and the effective inclusion of new network structure constraints. Several examples are shown, including improvements to the original case studies (with up to 971× reduction in computational cost) as well as graph problems in common system architecture design patterns. The goal is to show that the work presented here and tools developed from it can play a role as the domain-independent architecture decision support tool for a variety of graph enumeration-based engineering design challenges.
APA, Harvard, Vancouver, ISO, and other styles
4

Amiri, Behzad, Jorg Kliewer, and Lara Dolecek. "Analysis and enumeration of absorbing sets for non-binary graph-based codes." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Xuanxiang, Yacine Izza, Alexey Ignatiev, and Joao Marques-Silva. "On Efficiently Explaining Graph-Based Classifiers." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/34.

Full text
Abstract:
Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifiers, globally referred to as decision graphs, and which include decision trees and binary decision diagrams, but also their multi-valued variants, there exist polynomial-time algorithms for computing one PI-explanation. In addition, the paper also proposes a polynomial-time algorithm for computing one contrastive explanation. These novel algorithms build on explanation graphs (XpG's). XpG's denote a graph representation that enables both theoretical and practically efficient computation of explanations for decision graphs. Furthermore, the paper proposes a practically efficient solution for the enumeration of explanations, and studies the complexity of deciding whether a given feature is included in some explanation. For the concrete case of decision trees, the paper shows that the set of all contrastive explanations can be enumerated in polynomial time. Finally, the experimental results validate the practical applicability of the algorithms proposed in the paper on a wide range of publicly available benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
6

Mitrouchev, Peter, Fre´de´ric Maffray, Slim Amri, Abdelghafour Nafiss, and Marc Dahan. "Number Enumeration of Planar Pin-Joined Driving Mechanisms." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-47056.

Full text
Abstract:
This paper deals with the development of a new method for the morphological number enumeration for planar pin-jointed driving mechanisms applied in robotic design. The method is based on linkage graph presentation by using geometrical symmetries of kinematic chains and combinatorial analysis. The restricting criteria being the position of: the frame, the end-effector and the actuators (motors) of the robot, different cases of symmetries for planar pin-jointed driving mechanisms of mobility 1 and 2 are addressed. New expressions for calculating the number of different possibilities to position the frame, the end-effector and the actuators in a mechanism are presented, thus reducing the number of the possible solutions by avoiding those that are isomorphic. A further consequence of the present work is the ability for it to be extended to mechanisms with three degrees of mobility and more.
APA, Harvard, Vancouver, ISO, and other styles
7

Nelson, Carl A. "Concurrent Type and Dimensional Synthesis of Planar Mechanisms Using Graph-Theoretic Enumeration, Automatic Loop Closure Equation Generation, and Descent-Based Optimization." In ASME 2011 International Mechanical Engineering Congress and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/imece2011-64055.

Full text
Abstract:
An approach to concurrent type and dimensional synthesis of planar mechanisms is presented. Using graph-theoretic enumeration of mechanisms and determination of loops, automatic loop closure equations are generated. Using constrained optimization routines based on descent methods, and given an appropriate goal function, optimal mechanism designs can be determined. These are not limited to traditional problems such as rigid-body guidance and path generation, but can be more flexibly expressed according to designer needs. This method can be effective at finding mechanism solutions when topology has not been determined a priori and may also be extensible to synthesis of spatial mechanisms. This paper presents the data flow and algorithm outline, simulation results, and examples of nonstandard synthesis problems solvable with this method.
APA, Harvard, Vancouver, ISO, and other styles
8

Pucheta, Martín A., Nicolás E. Ulrich, and Alberto Cardona. "Combined Graph Layout Algorithms for Automated Sketching of Kinematic Chains." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70665.

Full text
Abstract:
The graph layout problem arises frequently in the conceptual stage of mechanism design, specially in the enumeration process where a large number of topological solutions must be analyzed. Two main objectives of graph layout are the avoidance or minimization of edge crossings and the aesthetics. Edge crossings cannot be always avoided by force-directed algorithms since they reach a minimum of the energy in dependence with the initial position of the vertices, often randomly generated. Combinatorial algorithms based on the properties of the graph representation of the kinematic chain can be used to find an adequate initial position of the vertices with minimal edge crossings. To select an initial layout, the minimal independent loops of the graph can be drawn as circles followed by arcs, in all forms. The computational cost of this algorithm grows as factorial with the number of independent loops. This paper presents a combination of two algorithms: a combinatorial algorithm followed by a force-directed algorithm based on spring repulsion and electrical attraction, including a new concept of vertex-to-edge repulsion to improve aesthetics and minimize crossings. Atlases of graphs of complex kinematic chains are used to validate the results. The layouts obtained have good quality in terms of minimization of edge crossings and maximization of aesthetic characteristics.
APA, Harvard, Vancouver, ISO, and other styles
9

Hossain, Kazi M., Carl A. Nelson, and Prithviraj Dasgupta. "Enumeration of Configurations and Their Kinematics for ModRED II Modular Robots." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60307.

Full text
Abstract:
Modular robotics is a popular topic for robotic applications and design. The reason behind this popularity is the ability to use and re-use the same robot modules for accomplishing different tasks through reconfiguration. The robots are capable of self-reconfiguration based on the requirements of the task and environmental constraints. It is possible to have a large number of configuration combinations for the same set of modules. Therefore, it is important to identify unique configurations from among the full set of possible configurations and establish a kinematic strategy for each before reconfiguring the robots into a new shape. This becomes more difficult for robot units having more than one connection type and more degrees of freedom. For example, ModRED II modules have two types of connections and four degrees of freedom per module. In this paper, the set of configurations is enumerated, and determination of configuration isomorphism is accomplished for ModRED II modules using graph theory. Kinematic equations are then derived for unique configurations. The kinematic method is then demonstrated for certain example configurations using ModRED II modules.
APA, Harvard, Vancouver, ISO, and other styles
10

Arikawa, Keisuke. "Classification and Enumeration of Topological Structures of Robotic Mechanisms: Generation of Robotic Mechanisms With Unconventional Topological Structures." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34992.

Full text
Abstract:
This paper discusses the classification and enumeration of topological structures of robotic mechanisms, aiming to develop practical robotic mechanisms with unconventional topological structures. First, we consider the features of topological structures of conventional robotic mechanisms and we point out that almost all of these can be constructed by using only one simple basic unit and two simple connection rules. Then, we present an efficient way to enumerate the topological structures which cannot be constructed from the basic unit and the connection rules, or unconventional topological structures. Then, we discuss the sequence required to construct robotic mechanisms from the enumerated unconventional topological structures. In the discussion, some effective tools, “graph division”, “graph management tool” and “DOF setting based on Kuzbach criterion”, which help designers construct a variety of mechanisms from the same topological structure are introduced. Finally, some examples of the sequences allowing the generation of robotic mechanisms with unconventional topological structures are shown.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph-based enumeration' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography