Ali Nourollah Articles List

List of Articles Ali Nourollah

Open Access Article
- Abstract Page
- Full-Text
1 - Analyzing and Designing a Domain Specific Language to Describe Structure and Movement of Linkages
A. nourollah N. Behzadpour
20.1001.1.16823745.1397.16.2.2.0

This research has been prepared in the field of linkage structures and their movements. A linkage is a set of line segments that can be interconnected via their ends, which exhibits numerous usages in modeling robot arms. To date, various domain-specific languages have More

This research has been prepared in the field of linkage structures and their movements. A linkage is a set of line segments that can be interconnected via their ends, which exhibits numerous usages in modeling robot arms. To date, various domain-specific languages have been introduced in the field of robot movements. In spite that some of the capabilities of these languages combined with general-purpose languages can be used to describe and create the movements of these linkages and their structures, yet they cannot be considered domain-specific languages for explaining the linkages and their movements. The domain-specific languages are programs that raise the level of abstraction, the ability to understand better, accelerating the development and requires less effort to learn relevant knowledge that will provide the same advantages. So like all software, have levels such as analysis, design, implementation, testing, maintenance and support. Therefore, in this paper, we attempt to analyze and design a domain-specific language and describe and create linkage movements and their structures. By using this domain specific language, there is no limit to the definition of simple linkages in terms of it’s number. Also, by defining the modules and their sequential and parallel combinations, the final movements of the linkages are generated, and by using the features of the language, the terms needed to start or terminate each final movements are defined. Applying this kind of attitude to specific general-purpose modeling, in addition to providing ease in defining the structure of linkages and diversity in their initial definition, allows for the coordination and collaboration of multiple robots to perform a single task and then implemented in the next step. Manuscript profile
Open Access Article
- Abstract Page
- Full-Text
2 - A New Approach to Count or Optimize Point Set Triangulation in the Plane Based on MIS
A. nourollah Zahra Rezayat
20.1001.1.16823745.1399.18.3.11.5

The triangulation of the given point set on the 2D-plane is the planar straight-line embedding of the graph whose vertices is exactly and set of its edges is maximal (with the most edge). Two important issues are being explored in this area. a) In how many ways can More

The triangulation of the given point set on the 2D-plane is the planar straight-line embedding of the graph whose vertices is exactly and set of its edges is maximal (with the most edge). Two important issues are being explored in this area. a) In how many ways can the given set of points be triangulated? b) Which triangulation is optimal based on the given particular feature? The first problem is an open problem, and except in special cases where it has a closed relation, a polynomial time algorithm for it has not been presented in general. The second problem is NP-HARD when the goal is to find a triangulation whose total edge length is the smallest (MWT). So research has been done to provide heuristic, meta heuristic, or approximation algorithms for it. In this paper, a method is presented in which by constructing the intersection graph obtained from all the line segments obtained from all pairs of points of and then algorithms for generating all maximal independent sets (MIS) of the intersection graph is introduced. Furthermore, an algorithm is introduced for counting the number of maximal independent sets. This approach in which constructing intersection graph and converting any triangulation problem to the maximal independent set problem is a new approach for triangulation problem in both cases (a) and (b). Considering difficulties to design algorithms for problems (a) and (b) because of its geometric natures, all the algorithms that have been proposed so far for problems (a) and (b) can be used to solve the triangulation problems in both cases by the approach proposed in this article. The proposed approach of converting triangulation problem to the MIS problem is a new approach that has never been reported to solve counting the number of triangulations or minimum weight triangulation. Furthermore a heuristic estimation algorithm will be introduced to estimate average number of triangulations on the given point set and the algorithm implementation shows its outputs is near to exact values for some instances. Manuscript profile

Current Issue

Published Issues

Menu

Browse

List of Articles Ali Nourollah