Hangyina UAVs

Hangyina UAVs are Chinese UAVs developed by Jinan Hangyina Science & Technology Co. Ltd. (Hangyina, 济南航医纳科技有限公司), a firm founded by a disabled scientist Mr. Liu Zhensheng (刘振升). Hangyina UAVs include several models, some of which have been deployed by various Chinese governmental and civilian establishments for survey and patrol applications.

Hangyina UAVs
Role UAV
National origin China
Manufacturer Hangyina
First flight 2005
Status In service
Primary user China

Biekasi

Biekasi (别卡斯) UAV is the first UAV developed by Hangyina. The company's original attempt to develop UAV in 1999 was rejected by the Chinese authority when Hangyina applied for permission to develop UAVs of its own. Several years later, the opportunity reemerged when an agreement of joint development of UAV was reached with Ukrainian National Aerospace University Kharkov Aviation Institute, and the result is Biekasi that entered service in 2005. Biekasi has a service ceiling of 3 km and adopts a twin-boom configuration. Propulsion is provided by a two-blade propeller driven by a pusher engine installed at the rear end of the fuselage.[1]

Nativation Star 4

After completely mastered the UAV technology, Hangyina indigenously developed its own UAV, Navigation Star 4 (Hang-Xing Si-Hao or Hangxing Sihao, 航星4号). Navigation Star 4 is a development of earlier Biekasi and adopts the same twin boom configuration. The landing gear is slightly different than that of Biekasi in that it is extended from the side of the fuselage instead of below the fuselage as in Biekasi. Specification:[2]

  • Ceiling: 5 km
  • Speed: 120 km/h
  • Control: autonomous + remote control
  • Construction: carbon fiber

Aerial Survey UAV

Aerial Survey UAV (Hang-Pai Wu-Ren-Ji or Hangpai Wurenji, 航拍无人机) is another UAV developed by Hangyina that has been revealed to public, and it is also an indigenously developed UAV by Hangyina itself. The UAV adopts a conventional layout and the propulsion is provided by a two-blade propeller driven by a tractor engine mounted in the nose.[3]

gollark: ```pythonfrom z3 import *iters = [ Int(f"x{i}") for i in range(40) ]solver = Solver()for n,x in enumerate(iters): if n == 0: solver.add(x == 1111111) else: last = iters[n - 1] solver.add(Or(x == last, (x * 2) == last, x == ((last * 3) + 1)))solver.add(iters[-1] == 1)print(solver.check())print(solver.model())```This is the *best* way to do collatz.
gollark: It's a theorem prover. It can tell you if certain statements/sets of statements are satisfiable, and if so how.
gollark: And I don't think rust does TCO in general.
gollark: Halting is a side effect though.
gollark: Hmm, I wonder if I can horribly abuse z3 for collatz like I abused it for mazes.

See also

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.