Approach to spatial modeling of networks and groups of objects on the basis of the weighted graph construction procedure

2020 ◽  
Vol 964 (10) ◽  
pp. 49-58
Author(s):  
V.I. Bilan ◽  
A.N. Grigor’ev ◽  
G.G. Dmitrikov ◽  
E.A. Dudin
Keyword(s):  
Spatial Configuration ◽  
Weighted Graph ◽  
Edge Length ◽  
Buffer Zones ◽  
Typical Structure ◽  
Spatial Graph ◽  
Object Based ◽  
Complementary Graph ◽  
Spatial Parameters ◽  
The Given

The direction of research on the development of a scientific and methodological tool for the analysis of spatial objects in order to determine their generalized spatial parameters was selected. An approach to the problem of modeling networks and groups of objects based on the synthesis of a weighted graph is proposed. The spatial configuration of objects based on the given conditions is described by a weighted graph, the edge length of which is considered as the weight of the edges. A generalization to the typical structure of a spatial graph is formulated; its essence is representation of nodal elements as two-dimensional (polygonal) objects. To take into account the restrictions on the convergence of the vertices described by the buffer zones, a complementary graph is formed. An algorithm for constructing the implementation of a spatial object based on the sequential determination of vertices that comply with the given conditions is proposed. Using the software implementation of the developed algorithm, an experiment was performed to evaluate the spatial parameters of the simulated objects described by typical graph structures. The following parameters were investigated as spatial ones

DISTANCE VISIBILITY GRAPHS

1992 ◽  
Vol 02 (04) ◽  
pp. 349-362 ◽  
Author(s):  
COLLETTE COULLARD ◽  
ANNA LUBIW
Keyword(s):  
Simple Polygon ◽  
Weighted Graph ◽  
Visibility Graph ◽  
Necessary Condition ◽  
Connected Component ◽  
Graph Problem ◽  
Visibility Graphs ◽  
Vertex Ordering ◽  
Euclidean Distances ◽  
The Given

A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?

scholarly journals Finding Optimal Manipulator Arm Shapes to Avoid Collisions in a Static Environment

2020 ◽  
Vol 11 (1) ◽  
pp. 64
Author(s):  
Tomáš Kot ◽  
Zdenko Bobovský ◽  
Mathias Brandstötter ◽  
Václav Krys ◽  
Ivan Virgala ◽  
...  
Keyword(s):  
Degrees Of Freedom ◽  
Particle Swarm Optimization Algorithm ◽  
Industrial Robots ◽  
Kinematic Structure ◽  
Typical Structure ◽  
Swarm Optimization ◽  
Six Degrees Of Freedom ◽  
Manipulator Arm ◽  
The Given ◽  
Collaborative Robot

In situations of a confined workplace with a lot of obstacles and a complicated required trajectory of the endpoint of an industrial or collaborative robot, it may be impossible to find a suitable robot and its position within the workplace to fulfill the given task. In some cases, it could be favorable to design a custom manipulator arm with an unusual kinematic structure or shapes of some of its links. This article presents a novel way of finding the optimal lengths and shapes of two crucial links of a manipulator arm, where the target lengths are as short as possible to reduce mass, and the shape in the form of a Bézier curve is chosen to avoid collisions. The chosen type of kinematic structure of the manipulator arm is fixed and is based on the most typical structure of existing industrial robots, with six degrees of freedom. Two algorithm variants were proposed; one method uses iterations to find the solution based on in-depth collision analysis, and the second method uses the particle swarm optimization algorithm. Both methods were implemented in a simulation system and verified in several testing workplaces.

scholarly journals ALGORITHMS OF SEAFLOOR INDUSTRIAL MACHINERY INSPECTION USING AUV

2020 ◽  
Author(s):  
А.В. Инзарцев ◽  
М.А. Панин ◽  
В.А. Бобков
Keyword(s):  
Autonomous Underwater Vehicles ◽  
A Priori ◽  
Laser Scanner ◽  
Final Model ◽  
New Information ◽  
Object Based ◽  
Object Inspection ◽  
Priori Information ◽  
Available Information ◽  
The Given

АНПА могут быть применены для автоматизированной инспекции объектов подводных добычных комплексов. При наличии априорной информации об объекте (его модели) целью обследования может быть детальная фотосъемка заданных фрагментов объекта. Для выхода АНПА к этим фрагментам используются алгоритмы точной навигационной привязки к объекту на базе анализа последовательности стереоизображений и имеющейся информации о расположении характерных точек объекта. В случае отсутствия априорной информации целью обследования может быть построение детальной 3D модели объекта (с помощью лазерного сканера или многолучевого эхолокатора). Для этого АНПА производит первоначальное обнаружение (локализацию) объекта. Далее его траектория формируется динамически от одной видовой позиции к другой по мере поступления новой информации об объекте. В качестве критерия при выборе очередной видовой позиции используется оценка ее информативности (т.е. объем получаемой новой информации об объекте). Итоговая модель объекта формируется по собранной информации с использованием методов фотограмметрии. В работе рассматриваются подходы и алгоритмы, которые могут быть использованы при обследовании объектов для этих двух случаев. Autonomous underwater vehicles (AUV) can be used for automatized inspection of the objects of marine mining complexes. If a priori information about the object (or its model) is available, the examination can be aimed at detailed photographing the given fragments of the object. Routing AUV to these fragments relies on algorithms of precise navigation referencing to the object based on analysis of the sequence of stereo images and available information about specific points of the object. In case of the necessary information absence, the inspection may target the goal of building the detailed 3D model of the object (using a laser scanner or multibeam echosounder). In that case, AUV performs the initial detection (localization) of the object at first. Then its motion trajectory is generated dynamically from one view position to another as new information about the object becomes available. A criterion of the viewing position selection used is its informational value (i.e., the amount of further information received about the object). The final model is built using gathered information processed with methods of photogrammetry. The paper considers approaches and algorithms applicable for object inspection in two above described cases.

scholarly journals Towards understanding of classes versus data types in conceptual modeling and UML

2012 ◽  
Vol 9 (2) ◽  
pp. 505-539
Author(s):  
Dragan Milicev
Keyword(s):  
Theoretical Study ◽  
Conceptual Modeling ◽  
Structured Data ◽  
Semantic Interpretation ◽  
Data Types ◽  
Unambiguous Discrimination ◽  
Relationship Types ◽  
Object Based ◽  
The Given

Traditional conceptual modeling and UML take different vague, ambiguous, and apparently incompatible approaches to making a distinction between two different entity types - classes and data types. In this paper, an in-depth theoretical study of these ambiguities and discrepancies is given and a new semantic interpretation is proposed for consolidation. The interpretation is founded on the premise that populations of the two kinds of entity types are defined in two substantially different ways: by intensional (for data types) and extensional (for classes) definitions. The notion of a generative relationship set is introduced to explain the role of specific relationship types that are used to define populations of structured data types by cross-combinations of populations of the related entity types. Finally, some important semantic consequences are described through the proposed interpretation: value-based vs. object-based semantics, associations vs. attributes, and identity vs. identification. The given interpretation is based on runtime semantics and allows for fully unambiguous discrimination of the related concepts, yet it fits into intuitive understanding and common practical usage of these concepts.

Conceptual structuring of the English prepositions between, among, and amid, and their Spanish equivalent entre

2019 ◽  
Vol 6 (1) ◽  
pp. 103-129
Author(s):  
Javier Morras ◽  
Antonio Barcelona
Keyword(s):  
Spatial Configuration ◽  
Spatial Language ◽  
Conceptual Basis ◽  
Geometric Information ◽  
Full Account ◽  
Semantic Extension ◽  
Functional Consequences ◽  
Spatial Parameters ◽  
New Perspective ◽  
Semantics Of Space

Abstract Spatial language has been traditionally understood as encoding purely spatio-geometric information. However, much more than that must be considered for a full account of the semantics of space. It turns out that spatial arrangements manifest functional consequences which are non-spatial, so prepositional vehicles cannot be equated solely with spatial elements (Vandeloise 1991, 1994). These non-spatial parameters in turn, play a major role in spatial, non-spatial, and temporal conceptions. This provides solid ground to propose a motivation behind these types of meanings that prepositions usually convey. This paper attempts to show how the conceptual basis for each preposition proposed, is a key component within conceptual processes such as elaboration and extension (Langacker 1987). Such an analysis provides a better understanding of the spatial configuration of the English and Spanish prepositions, as well as an account for the semantic extension of non-spatial and temporal conceptions. Using a corpus-driven methodology to evidence the prepositions’ use types, the results obtained favor the hypothesis that non-spatial conceptions are ultimately motivated by spatial ones. This in turn, shows the language-specific character of parameterization due to the clear differences that exist between the English prepositions between, among, and amid, and their Spanish equivalent entre. The cognitive linguistic analysis showed in this research may also offer a new perspective in the area of Language Teaching. The paper concludes with suggestions for further research on the plausibility of psycholinguistic validation and pedagogical applications of the conceptual bases proposed.

The magnetospheric interactions of predicted ULF wave power

2021 ◽  
Author(s):  
Sarah Bentley ◽  
Rhys Thompson ◽  
Clare Watt ◽  
Jennifer Stout ◽  
Teo Bloch
Keyword(s):  
Solar Wind ◽  
Radiation Belt ◽  
Internal State ◽  
Low Frequency ◽  
Ulf Waves ◽  
Wave Power ◽  
Ulf Wave ◽  
Radiation Belt Electrons ◽  
Spatial Parameters ◽  
The Given

<p>We present and analyse a freely-available model of the power found in ultra-low frequency waves (ULF, 1-15 mHz) throughout Earth’s magnetosphere. Predictions can be used to test our understanding of magnetospheric dynamics, while accurate models of these waves are required to characterise the energisation and transport of radiation belt electrons in space weather.</p><p>This model is constructed using decision tree ensembles, which iteratively partition the given parameter space into variable size bins. Wave power is determined by physical driving parameters (e.g. solar wind properties) and spatial parameters of interest (magnetic local time MLT, magnetic latitude and frequency). As a parameterised model, there is no guarantee that individual physical processes can be extracted and analysed. However, by iteratively considering smaller scale driving processes, we identify predominant wave drivers and find that solar wind driving of ULF waves are moderated by internal magnetospheric conditions. Significant remaining uncertainty occurs with mild solar wind driving, suggesting that the internal state of the magnetosphere should be included in future.</p><p>Models such as this may be used to create global magnetospheric “maps” of predicted wave power which may then be used to create radial diffusion coefficients determining the effect of ULF waves on radiation belt electrons.</p>

Designing Agent-Based Negotiation for E-Marketing

2011 ◽  
pp. 287-299
Author(s):  
V. K. Murthy
Keyword(s):  
Data Structures ◽  
Weighted Graph ◽  
Negotiation Process ◽  
Agent Based ◽  
Negotiation Protocol ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages

This chapter describes how to design agent-based negotiation systems in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called a protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures. We also describe how to detect the termination of the negotiation process based on Commission-Savings-Tally Algorithm. A simple example illustrates how a set of agents can participate in a negotiation protocol to find the shortest travel route on a map of cities represented as a directed weighted graph.

Designing Agent-Based Negotiation for E-Marketing

2011 ◽  
pp. 665-678
Author(s):  
V. K. Murthy
Keyword(s):  
Data Structures ◽  
Weighted Graph ◽  
Negotiation Process ◽  
Agent Based ◽  
Negotiation Protocol ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages

This chapter describes how to design agent-based negotiation systems in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called a protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures. We also describe how to detect the termination of the negotiation process based on Commission-Savings-Tally Algorithm. A simple example illustrates how a set of agents can participate in a negotiation protocol to find the shortest travel route on a map of cities represented as a directed weighted graph.

A Convergent Convex Decomposition of Polyhedral Objects

1992 ◽  
Vol 114 (3) ◽  
pp. 468-476 ◽  
Author(s):  
Yong Se Kim ◽  
D. J. Wilde
Keyword(s):  
Decomposition Method ◽  
Feature Recognition ◽  
Current Method ◽  
Convex Decomposition ◽  
Object Based ◽  
Geometric Objects ◽  
Polyhedral Objects ◽  
Volumetric Representation ◽  
Boundary Information ◽  
The Given

A convex decomposition method, called Alternating Sum of Volumes (ASV), uses convex hulls and set difference operations. ASV decomposition, however, may not converge, which severely limits the domain of geometric objects that the current method can handle. We investigate the cause of non-convergence and present a remedy; we propose a new convex decomposition called Alternating Sum of Volumes with Partitioning (ASVP) and prove its convergence. ASVP decomposition is a hierarchical volumetric representation which is obtained from the boundary information of the given object based on convexity. As an application, from feature recognition by ASVP decomposition if briefly discussed.

Sign in / Sign up

Export Citation Format

Share Document