助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   搜索树算法 的翻译结果: 查询用时:0.226秒
图标索引 在分类学科中查询
所有学科
互联网技术
更多类别查询

图标索引 历史查询
 

搜索树算法
相关语句
  “搜索树算法”译为未确定词的双语例句
     At first, considering only complex static working environment, an algorithm combining optimization and Rapidly-exploring Random Tree is presented.
     首先针对复杂的静态环境,将快速随机搜索树算法与优化方法相结合,规划出即可避障又可满足机器人滚动约束的运动。
短句来源
     During producing local target, bias parameter is introduced to speed the search.
     并将选择性参数BIAS引入快速随机搜索树算法,加快了趋近速度。
短句来源
     Basing on basic features of LIN bus, the influent of packing algorithm for the bandwidth utilization of LIN bus was analyzed, and a new type of packing algorithm that can fully utilizes the bandwidth of the LIN-The entire tree search selected algorithm was proposed.
     针对LIN总线的特点,分析了数据打包算法对LIN总线带宽利用率性能的影响,提出了一种LIN总线带宽利用率最优的算法——完全搜索树算法
短句来源
  相似匹配句对
     B* Tree Algorithm for Searching Resolution Space
     解空间搜索中的B*算法
短句来源
     Random searching multicast tree generating heuristic
     随机搜索组播生成算法
短句来源
     A Routing Lookup Algorithm Based on Fast Search Trees
     基于快速搜索的路由查表算法
短句来源
     Searching strategy and algorithm in tree-structure parametric design
     结构参数化设计的搜索策略与算法
短句来源
     The Algorithm of Dynamic Equilibrium for AVL Tree
     AVL的动态平衡算法
短句来源
查询“搜索树算法”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  search tree algorithm
We can improve the running time for k-Vertex Cover by the following different bounded search tree algorithm.
      


In term of kinematic model of wheeled mobile robot, the motion planning under nonholonomic robotic rolling constraint is discussed. An algorithm is presented by combining optimization and rapidly-exploring random tree(RRT). The improved RRT generates local targets and new states with special iterative way to reach the given goal state. Optimization is used to derivate control input which can satisfy mobile robot kinematic nonholonomic constraint. The algorithm is applied to the mobile robot motion planning in...

In term of kinematic model of wheeled mobile robot, the motion planning under nonholonomic robotic rolling constraint is discussed. An algorithm is presented by combining optimization and rapidly-exploring random tree(RRT). The improved RRT generates local targets and new states with special iterative way to reach the given goal state. Optimization is used to derivate control input which can satisfy mobile robot kinematic nonholonomic constraint. The algorithm is applied to the mobile robot motion planning in dynamic environment. The result shows that the algorithm can successfully guide robot following avoidance obstacles path with nonholonomic constraint in dynamic environment.

根据轮移式机器人的运动学模型,研究受到滚动约束轮移式机器人在动态环境中的运动规划问题.将快速随机搜索树算法与优化方法相结合,实现了一种新的算法,规划出既可避障又可满足机器人滚动约束的运动.将该算法运用到动态环境下机器人的运动规划中,并通过仿真表明该算法能较好地引导机器人在动态环境中实现满足滚动约束的避障路径.

When a robot is required to track a moving object in dynamic environment,a dynamic algorithm must be taken.An algorithm called rolling timeframe biased rapidly-exploring random tree is proposed in this paper.Based on the analysis of the stochastic characteristics of rapidly-exploring random tree,a parameter called bias is introduced to speed up the search.Taking advantages of the rolling timeframe,robots collect the information of dynamic obstacles and object at the beginning of a period,and estimate their distributions...

When a robot is required to track a moving object in dynamic environment,a dynamic algorithm must be taken.An algorithm called rolling timeframe biased rapidly-exploring random tree is proposed in this paper.Based on the analysis of the stochastic characteristics of rapidly-exploring random tree,a parameter called bias is introduced to speed up the search.Taking advantages of the rolling timeframe,robots collect the information of dynamic obstacles and object at the beginning of a period,and estimate their distributions in operation space of next timeframe.The robot plans local path using biased rapidly-exploring random tree algorithm.After many times of such local planning,the robot gets its object at last.Simulation results show that the algorithm can obtain good results in tracking the object with changing direction in dynamic environments.

机器人要实现对动态环境中可变方向运动目标的跟踪,必须采用动态的规划算法.本文在快速随机搜索树算法的基础上,采用滚动时间帧的思想,周期性地采集环境信息与目标运动状况,来预测未来环境中障碍物的分布情况及运动目标位置.在每个周期内用B IAS_RRT来引导机器人行走,以适应障碍物与目标运动方向的变化.仿真结果表明,该算法能有效跟踪在多运动障碍物环境中方向可变的运动目标.

Basing on basic features of LIN bus, the influent of packing algorithm for the bandwidth utilization of LIN bus was analyzed, and a new type of packing algorithm that can fully utilizes the bandwidth of the LIN-The entire tree search selected algorithm was proposed. The results indicate that this algorithm can not only achieve the optimal bandwidth utilization of LIN bus, but also reduce the busload of LIN bus.

针对LIN总线的特点,分析了数据打包算法对LIN总线带宽利用率性能的影响,提出了一种LIN总线带宽利用率最优的算法——完全搜索树算法。研究结果表明,该算法能够实现LIN总线带宽利用率的最优解,并能进一步降低LIN总线的总线负载率。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关搜索树算法的内容
在知识搜索中查有关搜索树算法的内容
在数字搜索中查有关搜索树算法的内容
在概念知识元中查有关搜索树算法的内容
在学术趋势中查有关搜索树算法的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社