scholarly journals Configuration Space Analysis and Synthesis of Planar Variable Kinematic Joints

2012 ◽  
Author(s):  
Brian J. Slaboch ◽  
Philip A. Voglewede
Keyword(s):  
Configuration Space ◽  
Space Representation ◽  
New Approach ◽  
Space Analysis ◽  
Analysis And Synthesis ◽  
Prismatic Joints ◽  
Space Approach

This paper presents a new approach to the analysis and synthesis of planar variable kinematic joints using a configuration space approach. The advantage of this approach is that the configuration space representation contains both the joint topology and the configuration variables. Based on the same configuration space, different combinations of higher pair equivalent revolute and prismatic joints can be used to analyze and synthesize planar variable kinematic joints. Two practical examples will be presented to illustrate the proposed method.

Scientific-methodological approach to the substantiation of the rational seasonal scenario of using combine harvesters by large-scale agricultural producers

2020 ◽  
pp. 205-217
Author(s):  
V. Skibchyk ◽  
V. Dnes ◽  
R. Kudrynetskyi ◽  
O. Krypuch
Keyword(s):  
Large Scale ◽  
System Analysis ◽  
Methodological Approach ◽  
Production Unit ◽  
Agricultural Producers ◽  
New Approach ◽  
Rational Use ◽  
Road Map ◽  
Analysis And Synthesis ◽  
Combine Harvesters

Аnnotation Purpose. To increase the efficiency of technological processes of grain harvesting by large-scale agricultural producers due to the rational use of combine harvesters available on the farm. Methods. In the course of the research the methods of system analysis and synthesis, induction and deduction, system-factor and system-event approaches, graphic method were used. Results. Characteristic events that occur during the harvesting of grain crops, both within a single production unit and the entire agricultural producer are identified. A method for predicting time intervals of use and downtime of combine harvesters of production units has been developed. The roadmap of substantiation the rational seasonal scenario of the use of grain harvesters of large-scale agricultural producers is developed, which allows estimating the efficiency of each of the scenarios of multivariate placement of grain harvesters on fields taking into account influence of natural production and agrometeorological factors on the efficiency of technological cultures. Conclusions 1. Known scientific and methodological approaches to optimization of machine used in agriculture do not take into account the risks of losses of crops due to late harvesting, as well as seasonal natural and agrometeorological conditions of each production unit of the farmer, which requires a new approach to the rational use of rational seasonal combines of large agricultural producers. 2. The developed new approach to the substantiation of the rational seasonal scenario of the use of combined harvesters of large-scale agricultural producers allows taking into account the costs of harvesting of grain and the cost of the lost crop because of the lateness of harvesting at optimum variants of attraction of additional free combine harvesters. provides more profit. 3. The practical application of the developed road map will allow large-scale agricultural producers to use combine harvesters more efficiently and reduce harvesting costs. Keywords: combine harvesters, use, production divisions, risk, seasonal scenario, large-scale agricultural producers.

Optimal Robotic Assembly Planning Using Dijkstra’s Algorithm

1994 ◽  
Author(s):  
Sam Anand ◽  
Mohamed Sabri
Keyword(s):  
Configuration Space ◽  
Material Handling ◽  
Search Algorithm ◽  
Robotic Manipulators ◽  
Robotic Assembly ◽  
Graph Search ◽  
Assembly Planning ◽  
Robotic Welding ◽  
Fast Collision ◽  
Space Approach

Abstract Robots play an important role in the modern factory and are used in a manufacturing cell for several functions such as assembly, material handling, robotic welding, etc. One of the principal problems faced by robots while performing their tasks is the presence of obstacles such as fixtures, tools, and objects in the robot workspace. Such objects could result in a collision with one of the arms of the robots. Fast collision-free motion planning algorithms are therefore necessary for robotic manipulators to operate in a wide variety of changing environments. The configuration space approach is one of the widely used methods for collision-free robotic path planning. This paper presents a novel graph-based method of searching the configuration space for a collision-free path in a robotic assembly operation. Dijkstra’s graph search algorithm is used for optimizing the joint displacements of the robot while performing the assembly task. The methodology is illustrated using a simple robotic assembly planning task.

Configuration space analysis of the rheumatoid wrist

1997 ◽  
Vol 16 (2-3) ◽  
pp. 309-322 ◽  
Author(s):  
C.F. Small ◽  
R.E. Ellis ◽  
J.T. Bryant ◽  
I.L. Dwosh ◽  
D.R. Pichora ◽  
...  
Keyword(s):  
Configuration Space ◽  
Space Analysis ◽  
Rheumatoid Wrist

Analysis and Synthesis of Linear Transmission Mechanisms: Coupled Mechanisms and Mechanisms Wth Prismatic Joints

1994 ◽  
Author(s):  
Sun-Lai Chang
Keyword(s):  
Open Loop ◽  
Joint Motion ◽  
Transmission Mechanisms ◽  
Synthesis Of Mechanisms ◽  
Analysis And Synthesis ◽  
Prismatic Joints ◽  
Application Potential ◽  
Loop Chain

Abstract The characteristics of linear transmission mechanisms are studied. Using the characteristics, the kinematic and synthesis of linear transmission mechanisms are expanded. First, the synthesis of mechanisms with prismatic joints in the equivalent open-loop chain is developed. Then the kinematics and synthesis of mechanisms with coupled joint motion are also derived. Two coupled mechanisms are used as examples to demonstrate the application potential in the industry.

DIFFEOMORPHISM GROUPS AND CURRENT ALGEBRAS: CONFIGURATION SPACE ANALYSIS IN QUANTUM THEORY

1999 ◽  
Vol 11 (01) ◽  
pp. 1-23 ◽  
Author(s):  
S. ALBEVERIO ◽  
YU. G. KONDRATIEV ◽  
M. RÖCKNER
Keyword(s):  
Differential Geometry ◽  
Quantum Theory ◽  
Configuration Space ◽  
Current Algebra ◽  
Relativistic Quantum ◽  
Unitary Representations ◽  
Poisson Measure ◽  
Diffeomorphism Groups ◽  
Dirichlet Operator ◽  
Space Analysis

The constuction of models of non-relativistic quantum fields via current algebra representations is presented using a natural differential geometry of the configuration space Γ of particles, the corresponding classical Dirichlet operator associated with a Poisson measure on Γ, being the free Hamiltonian. The case with interactions is also discussed together with its relation to the problem of unitary representations of the diffeomorphism group on ℝd.

New approach for numerical solution of configuration-space Faddeev equations

1996 ◽  
Vol 101-102 (1) ◽  
pp. 391-399 ◽  
Author(s):  
J. Bernabéu ◽  
V. M. Suslov ◽  
T. A. Strizh ◽  
S. I. Vinitsky
Keyword(s):  
Numerical Solution ◽  
Configuration Space ◽  
Faddeev Equations ◽  
New Approach

scholarly journals Efficient Time and Space Representation of Uncertain Event Data

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 285 ◽  
Author(s):  
Marco Pegoraro ◽  
Merih Seran Uysal ◽  
Wil M. P. van der Aalst
Keyword(s):  
Process Mining ◽  
Graph Representation ◽  
Space Representation ◽  
Event Data ◽  
New Approach ◽  
Performance Improvements ◽  
Order Of Magnitude ◽  
Normative Models ◽  
Operational Processes ◽  
Asymptotic Time

Process mining is a discipline which concerns the analysis of execution data of operational processes, the extraction of models from event data, the measurement of the conformance between event data and normative models, and the enhancement of all aspects of processes. Most approaches assume that event data is accurately captured behavior. However, this is not realistic in many applications: data can contain uncertainty, generated from errors in recording, imprecise measurements, and other factors. Recently, new methods have been developed to analyze event data containing uncertainty; these techniques prominently rely on representing uncertain event data by means of graph-based models explicitly capturing uncertainty. In this paper, we introduce a new approach to efficiently calculate a graph representation of the behavior contained in an uncertain process trace. We present our novel algorithm, prove its asymptotic time complexity, and show experimental results that highlight order-of-magnitude performance improvements for the behavior graph construction.

Sign in / Sign up

Export Citation Format

Share Document