Then a algorithm is applied for shortest path search 然后利用a ~ *算法實(shí)現(xiàn)最短路徑搜索。
Thirdly , the technology of paths searched plan is discussed 接著,本文討論了搜索路徑規(guī)劃技術(shù)。
Integrated processing strategies for spatial query and path search 空間查詢(xún)和路徑搜索的集成處理策略
Forward and backward path searching methods were achieved . the trajectory is displayed on screen with 2d and / or 3d method 在軌跡顯示上,既可以在二維地圖上,同時(shí)也可以在三維空間中顯示出直升機(jī)的運(yùn)動(dòng)軌跡。
Abstract : a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint 文摘:給出了一種基于等高線(xiàn)求解坡度約束下曲面上兩點(diǎn)間最短路徑的搜索算法。
Using heuristic search theory for reference , this paper presented the concept of heuristic paths searched plan technology for the mapping system 文中借鑒人工智能理論中的啟發(fā)式搜索思想,提出了標(biāo)圖系統(tǒng)中的啟發(fā)式搜索路徑規(guī)劃的概念。
It can be extended to fuzzy logic systems and some lattice - valued logic systems . 3 . the study on automated reasoning a new automated reasoning method based on path searching was proposed 2 、提出一種利用神經(jīng)邏輯單元?jiǎng)討B(tài)地構(gòu)造神經(jīng)網(wǎng)絡(luò)的算法來(lái)對(duì)一些邏輯系統(tǒng)中的邏輯公式的真值進(jìn)行計(jì)算。
On the further study of image vectorization principle , an auto - adapting adjust approach based on direction module is proposed to track image edges , which optimized paths searched 研究了基于圖像邊緣矢量化原理,提出了基于方向模塊的自適應(yīng)調(diào)節(jié)方法,對(duì)圖像邊緣進(jìn)行跟蹤,優(yōu)化了輪廓搜索路徑。
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 對(duì)存在運(yùn)動(dòng)物體的視頻圖像,采用啟發(fā)式最優(yōu)路徑搜索算法尋找到圖像間拼接的最佳縫合線(xiàn),并使用多分辨率原理進(jìn)行圖像拼接后的平滑處理。
During the realization of integration optimization , based on former integration scheme relation drawings , paper brings forward the integration scheme optimize - path searching algorithm and self - optimize algorithm and gets the integration scheme objects ensemble which is 在聚集優(yōu)化的實(shí)現(xiàn)當(dāng)中,本文基于原聚集方案關(guān)系圖,提出了一種聚集方案最優(yōu)尋徑算法與自身優(yōu)化算法,從而得到一個(gè)聚集代價(jià)較低,又能夠滿(mǎn)足當(dāng)前用戶(hù)需求的聚集方案實(shí)體化集合。