路徑尋找演算法 的英文怎麼說

中文拼音 [lùjìngxúnzhǎoyǎnsuànfǎ]
路徑尋找演算法 英文
path finding algorithm
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 找 : 動詞1 （尋找）look for; try to find; discover; seek 2 （退還余錢） give change 3 （求見; 查找） a...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  1. Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce

    因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。
  2. For a given power network model, once establishing initialization pheromone matrix, searching the path depending on the special ability of ant colony, combining with an improved method of refreshing pheromone, manhattan distance and the thought of flexibility, the best power distribution network planning path is found at a higher rate only if it exits

    對于給定的配電網模型，該演算法根據各配電網站點建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來搜索配電網布局路徑，並結合改進信息素刷新的方式和在蟻群搜索過程中引入曼哈頓距離以及彈性伸縮調節因子，使蟻群以較快的速度找到當前布局上的最優路徑。
  3. For a given muting plane, first of all, this algorithm generates the corresponding grid group by barriers and nets ' ports, establishes initialization pheromone matrix, then the algorithm will use the character of ant colony algorithm to find out the shortest muting path only if it exits

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  4. For video images with moving objects, an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images, and the images were smoothed by multi resolution theory after mosaics of images

    對存在運動物體的視頻圖像，採用啟發式最優路徑搜索演算法尋找到圖像間拼接的最佳縫合線，並使用多解析度原理進行圖像拼接后的平滑處理。
  5. This main study of paper centralizes on following aspect : 1. based on shortest path heuristic and greedy algorithms, using path similarity principle and genetic operations, provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ). 2

    基於最短路徑（ sph ）和greedy演算法，使用路徑相似性原：理和遺傳演算法的變異操作，提出了尋找滿足1個或2個約束條件的多路徑啟發式演算法（稱為k - sph演算法） 。
  6. Ga is used in traffic road networks plan firstly for finding multiple constrained paths

    將遺傳演算法應用到交通公路網路規劃，尋找滿足多個約束條件的多路徑方案。
  7. The new algorithm is one of quality guided path following methods, belonging to spatial phase unwrapping methods dependent on path. its framework consists of digital weighted filtering and modulation ordering

    新演算法屬于空間位相展開與路徑有關的方法中利用可靠度函數尋找優化路徑（ qualityguidedpathfollowingmethod ）的方法之一，由數字加權濾波和調制度排序構成。
  8. Optimum route sequence search in petri net based on ant colony algorithm

    基於蟻群演算法的petri網最優路徑序列尋找
  9. In this thesis, firstly, the existing heuristic algorithms for steiner tree problem are summarized ; secondly, a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented. through simulation, we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time. at last, the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented

    本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由演算法，該演算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最後，研究了wdm光傳送網中的多播路由和波長分配問題，並提出了wdm全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。
  10. At last, we study on robot path planning for an approach to find out a perfect path in a certain map using a heuristic search algorithm

    本文最後，還對移動機器人路徑規劃進行了研究，使用啟發式搜索演算法在給出的地圖信息空間中尋找理想的路徑。
  11. In this thesis, routing protocol and wireless resource management are combined for the voice service in the communication network. session triggers the source node to build the bandwidth reserved routing to the destination. for the data service, aodv protocol is used to find the shortest route between source and destination, and the data is transmitted hop by hop

    本文將路由協議與無線資源管理相結合，對于通信網路中的話音業務，每次會話觸發源節點發起建立預留帶寬的路由;對于數據業務，採用aodv路由演算法按需尋找從源節點到目的節點的最短路徑，然後逐跳進行預約傳送數據。
分享友人
分享到 Line

分享到臉書