首页> 外文会议>International Symposium on Current Progress in Mathematics and Sciences >The shortest path determination on hexacopter based RGB image processing
【24h】

The shortest path determination on hexacopter based RGB image processing

机译:基于Hexacopter的RGB图像处理的最短路径确定

获取原文

摘要

This research reports two methods which used in controlling hexacopter, namely, avoiding objects with three colors of pattern and determining the shortest path. The obstacle object with three colors of pattern that has a dimension of 40 cm × 60 cm and placed on a pillar with a position of 1.5 meter above the floor. The obstacle that had been captured was saved in jpg format then registered on RGB-based image processing program. The image will be classified into 8 binary based on the intensity of color and projected against the floor. If the object was detected by a hexacopter camera when flown and matched with the objects that has registered on the program, the hexacopter will avoid the object. The position of the object that has projected was used for the program to determine the shortest path. The shortest path determination is represented on a 20 × 20 square-shaped floor box format, which the box has 32 × 24 pixel dimension. This process is using A (x, y) = B (x, y) + C (x, y) equation. B(x, y) stated the distance where the hexacopter moves to the starting point and the value of C stated the distance from the hexacopter position to the final point. The value of A (x, y) stated A sum of the two and look for the smallest value of the order to surrounding squares. The result of this research stated that the hexacopter were able to fly through the shortest way in order to avoid the objects with a success rate of about 70 % in a guided fly mode (waiting for a command from the computer).
机译:本研究报告了两种用于控制六泊车的方法,即避免具有三种颜色的图案和确定最短路径的对象。具有三种颜色图案的障碍物对象,其尺寸为40cm×60厘米,放置在柱上,位置在地板上方1.5米。已被捕获的障碍以JPG格式保存,然后在基于RGB的图像处理程序上注册。基于颜色强度并投影在地板上,图像将被分类为8二进制。如果在飞行时由六泊车摄像机检测到物体并与在程序上注册的物体匹配时,六泊车将避免对象。投影的对象的位置用于该程序以确定最短路径。最短路径确定在20×20方形地板箱格式上表示,该盒子具有32×24像素尺寸。该过程使用(x,y)= b(x,y)+ c(x,y)方程。 B(x,y)表示六泊位移动到起始点的距离,C的值将距六泊位位置的距离表示到最终点。 a(x,y)的值表示两者的总和,并寻找到周围方块的顺序的最小值。该研究的结果表示,六泊泊车能够通过最短的方式飞行,以避免在导向飞模式下成功率约为70%的物体(从计算机上等待命令)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号