PathPlannerApp Manual With Tutorial.doc is a path planning-tutorial that provides detailed explanation and pseudo-codes.
In order to get the most out of the tutorial, you should start with the "PathPlannerApp.base" and avoid looking through the "PathPlannerApp.solution" untill you have completed the project.
尋找函數的全局極小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.
This program demonstrates some function approximation capabilities of a Radial Basis Function Network.
The user supplies a set of training points which represent some "sample" points for some arbitrary curve. Next, the user specifies the number of equally spaced gaussian centers and the variance for the network. Using the training samples, the weights multiplying each of the gaussian basis functions arecalculated using the pseudo-inverse (yielding the minimum least-squares solution). The resulting network is then used to approximate the function between the given "sample" points.
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
Example of a digital data transmission implementing GMSK modulation
This Simulink model simulates as an example the transmission and reception of random digital data modulated with GMSK. The purpose of this model is to illustrate how part of the GSM transmission and reception works. It also measures the BER, affected by an AWGN channel
Math.NET開源數學庫
C#實現
具體功能:
- A linear algebra package, see MathNet.Numerics.LinearAlgebra.
- A sparse linear algebra package, see MathNet.Numerics.LinearAlgebra.Sparse.
- Non-uniform random generators, see MathNet.Numerics.Generators.
- Distribution fonctions, see MathNet.Numerics.Distributions.
- Statistical accumulator, see MathNet.Numerics.Statistics.
- Fourier transformations, see MathNet.Numerics.Transformations.
- Miscellaneous utilies (polynomials, rationals, collections).
Procedure TSPSA:
begin
init-of-T { T為初始溫度}
S={1，……，n} {S為初始值}
termination=false
while termination=false
begin
for i=1 to L do
begin
generate(S′form S) { 從當前回路S產生新回路S′}
Δt:=f(S′))-f(S) {f(S)為路徑總長}
IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])
S=S′
IF the-halt-condition-is-TRUE THEN
termination=true
End
T_lower
End
End
