Mobile robot tracking of pre-planned Paths是國外頂尖級專家篆寫的有關機器人路徑規劃的文章。雖然是2000年的，但是很有價值。
標簽： pre-planned tracking Mobile robot
上傳時間： 2014-01-02
上傳用戶：wmwai1314
嵌入式文件系統ucfs.zip This project should serve as an "easy start" with /FS. All Paths are relative to the project file. You should therefore be able to copy the entire directory (including all subdirectories) to any location on your harddrive.
標簽： relative project should Paths
上傳時間： 2015-04-28
上傳用戶：zhliu007
單源點最短路徑算法的設計與實現 算法 SHORTEST-Paths求出了v0至其它各結點的最短路徑，但是沒有給出這些最短路徑。補充該算法，使新算法在找出這些最短路徑長度的同時，也能求出路徑上的結點序列。
標簽： SHORTEST-Paths 最短路徑 算法
上傳時間： 2015-09-08
上傳用戶：小草123
k Shortest Paths David Eppstein s method ICTCLAS研究學習組 http://groups.google.com/group/ictclas?msg=subscribe
標簽： Shortest Eppstein ICTCLAS ictclas
上傳時間： 2013-12-30
上傳用戶：youmo81
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權可正可負 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結束：dis即為所有點對的最短路徑矩陣 3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
標簽： Floyd-Warshall Shortest Pairs Paths
上傳時間： 2013-12-01
上傳用戶：dyctj
c pgm to find redundant Paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network Paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such Paths. Note that, these Paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two Paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint Paths and the Paths themselves on separate lines. In case of multiple Paths the output should be in order of Paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽： Multiplicative undirected Shortest measured
上傳時間： 2017-04-08
上傳用戶：邶刖
function [r_path, r_cost] = dijkstra(Paths, pathE, transmat) The Dijkstra s algorithm, Implemented by Yi Wang, 2005 This version support detecting _cyclic-Paths_
標簽： Implemente algorithm function dijkstra
上傳時間： 2017-07-16
上傳用戶：zyt
The software and hardware development fields evolved along separate Paths through the end of the 20th century. We seem to have come full circle, however. The previously rigid hardware on which our programs run is softening in many ways. Embedded systems are largely responsible for this softening. These hidden computing systems drive the electronic products around us, including consumer products like digital cameras and personal digital assistants, office automation equipment like copy machines and printers, medical devices like heart monitors and ventilators, and automotive electronics like cruise controls and antilock brakes. Embedded systems force designers to work under incredibly tight time-tomarket, power consumption, size, performance, flexibility, and cost constraints. Many technologies introduced over the past two decades have sought to help satisfy these constraints. To understand these technologies, it is important to first distinguish the underlying embedded systems elements.
標簽： development the software hardware
上傳時間： 2017-08-15
上傳用戶：cjf0304
his folder contains the following files: 1. 02490rxP802-15_SG3a-Channel-Modeling-Subcommittee-Report-Final.doc: This is the final report of the channel modeling sub-committee. 2. cmx_imr.csv (x=1, 2, 3, and 4) represent the files containing the actual 100 channel realizations for CM1, CM2, CM3, and CM4. The columns are organized as (time, amp, time, amp,...) 3. cmx_imr_np.csv (x=1, 2, 3, and 4) represent the files containing the number of Paths in each of the 100 multipath realizations. 4. cmx_imr.mat (x=1, 2, 3, and 4) are the .mat files that can be loaded directly into Matlab (TM). 5. *.m files are the Matlab (TM) files used to generate the various channel realizations.
標簽： a-Channel-Modeling-Subcommittee-R following contains folder
上傳時間： 2013-12-21
上傳用戶：hxy200501
