The study of algorithms using receptor geometric model in the problems of physical route tracing in aviation technology

Aviation technologies


Аuthors

Nyi N. H.*, Kyaw H. -.**, Markin L. V.***

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

*e-mail: nyinyihtun@live.com
**e-mail: kyawhtike85@gmail.com
***e-mail: markinl@list.ru

Abstract

The subject of this research paper is the development of the mathematical methods and software of computer-aided design for aviation technology. We consider the computer-aided design system for connecting the routes between already placed objects, particularly electrical wiring, pneumatic and drainage systems, hydraulic systems; this problem seems to be more difficult that the development of the systems of automated arrangement of airplane’s technical compartment. The dimensions of the routes between already placed objects, the objects dimensions, and the minimal radii of curvatures can be compared and they must be variable; this is the main peculiarity of the considered problem.
The use of the discrete grid-based method based on the receptor geometric model which simulates the basis designs of the routes in layout space for the design algorithm is proposed. Advantages and disadvantages of the use of the receptor geometric models were also described in the presented paper. Thus, the advantage of the proposed method is the possibility of an effective direction search at each step of the route design, and its ability to determine the intersection of the projected route with the pre-composed objects. The drawback of this method is an inability to secure the smoothness of the projected track, and its high requirements to the computational power. However, the computational power of modern computers provides a practical implementation of this method.
The main obtained result consists in the development of the simulation software in C# and testing of routing algorithm between already placed objects. The possibility of the algorithm to find effective obstacle avoidance (as already arranged objects) is shown and more options are available to smooth the path to reach the required minimum radii of curvature. Due to the new data structure of algorithm in improvement for speed compared to traditional routing solution with discrete-tracing algorithm A* (A-star), new algorithm is about 1300 times faster than the classic A* and approximately 15% more effective compared to using the most effective modifications of A* algorithm by Masatomo Kanehara.
The scope of application of the obtained results is the computer-aided design system for aircrafts and other transport systems, i.e. technical objects with a high density layout. However, an additional difficulty of wide practical application of this method is the need to develop a transition module for the conversion of geometric parametric models used by designers and specified in drawings in a geometric model of the receptor (in fact, intra-machine), and need to use back and forth.
As a result of the investigations, the possibility of the use of a method of computer-aided design of the connecting lines of a given size and minimum radii of curvature of the objects is shown; a relatively short computation time is need (few minutes). The essential difference between the existing algorithms and proposed one is the ability to modify the size and length of the tracks directly in computation process. Another features and applications of the algorithm is beyond the scope of this article (e.g. related research - Masatomo Kanehara algorithm - was created to design the route obstacle avoidance robot manipulator).

Keywords:

designing, route tracing, receptor geometric modeling, physical trace, canal surface, obstacle avoidance, path smoothing

References

  1. Gavrilov V.N. Avtomatizirovannaya komponovka pribornykh otsekov letatel'nykh apparatov (Automated configuration of the instruments in the compartments of aircrafts), Moscow, Engineering, 1988, 136 p.
  2. Stoyan Yu.G., Yakovlev S.V. Matematicheskie modeli i optimizatsionnye metody geometricheskogo proektirovaniya (Mathematical models and optimization methods of geometric design), Kiev, Naukova Dumka, 1986, 268 p.
  3. Stoyan Yu.G., Gil' N.I. Metody i algoritmy razmeshcheniya ploskikh geometricheskikh ob"ektov (Methods and algorithms for accomodation of flat geometric objects), Kiev, Naukova Dumka, 1976, 248 p.
  4. Osipov V.A. Mashinnye metody proektirovaniya nepreryvno-karkasnykh poverkhnostei (Computer Methods for designing in continuous-frame surfaces), Moscow, Engineering, 1979, 248 p.
  5. Aristova I.V. Metodologiya resheniya prikladnykh optimizatsionnykh zadach, Sbornik statei, Kiev, 1992, pp. 30-35.
  6. Kalinin B.V. Avtomatizatsiya sinteza i topologii razmeshcheniya kommunikatsionnykh setei (Automation of synthesis and topology of the communications network), Abstracts of PhD thesis, Kuibyshev, KuAI, 1985, 16 p.
  7. Zozulevich D.M., Sherling D.R. Metody realizatsii na ETsVM teoretiko-mnozhestvennykh operatsii nad ploskimi mnogosvyazannymi oblastyami , Sbornik statei, Minsk, ITK AN BSSR, 1969, pp. 26-35.
  8. Korn G.V. Primenenie retseptornykh modelei pri komponovke izdelii aviatsionnoi tekhniki, Sbornik statei, Moscow, 1989, pp. 155-157.
  9. Sithu Lin. Materialy VII Vserossiiskoi konferentsii studentov, aspirantov i molodykh uchenykh «Ispol'zovanie retseptornykh modelei dlya komponovki nezapolnen-nykh prostranstv», Moscow, 2010, pp. 87-88.

Download

mai.ru — informational site MAI

Copyright © 2000-2019 by MAI

Вход