Search Results for "a star algorithm path" - Page 3

...It's very important to give the exact argument number to functions as well. To use the calculator in the terminal regardless of current path, add the executable to the path for looking up programs, or simply move the program into a path already set up. Case you're on windows there's already a program by the name calc provided by windows, either uninstal it or change the name of this executable.

It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data.

C# OO Implementation of Dijkstra's algorithm aimed at finding the path with the minimum cost. It now supports finding the shortest paths from the source vertex to every other vertex. The C# source files are now available.

This program is centered on a graphical Hertzsprung-Russell or color-magnitude diagram (CMD). It can show animated evolutionary tracks of stars of different masses, for a single star or a population of stars. In addition, it can show the CMD of a large number of existing open clusters, based on scientific survey data, and overlay isochrones (the curve in a CMD from stars born at the same time) to determine the age, distance and interstellar reddening of the cluster. Determining these parameters can be done automatically with a global search algorithm (more specifically a genetic algorithm). ...

This a NetBeans project developed to create a small Hexagon map library with a few basic functionalities. It is possible to measure distance between tiles's centres and calculate the best path between two of them (if any). It is possible to define tiles where it is not possible to pass (or reenabling them) by right clicking on them (they will become red), creating therefore obstacles that can help testing the path finding algorithm. This library is licences under GPL licence.

Development of FHeap and BHeap data structures Implemenation of Dijsktra's shortest path algorithm using Simple/FHeap/BHeap strategies

Image Sizer Simple - The light version of original "Image Sizer", with no picture preview, and much faster "resizing" algorithm.

sqlamp is an implementation of an efficient algorithm for working with hierarchical data structures — Materialized Path. sqlamp uses (and depends of) SQLAlchemy.

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.

Star Trek Online ((C) Cryptic) Player Selector. (S.T.O.P.S) For use by machinima artists, this little utility allows easy access and launching of STO .demo files made with the /demorecord feature without the need to manipulate shortcuts!

A GPS simulator created in java. It contains a graphical interface and the shortest path will be found using Dijkstra algorithm

MicroPather is a path finder and A* solver (astar or a-star) written in platform independent C++ that can be easily integrated into existing code. MicroPather focuses on being a path finding engine for video games but is a generic A* solver.

C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.

A simple A star path finding library in C++ An exemple of the result of a pqthfinding in a map is given.

AAMS is a tool for creating simulations visually. It has a library of processing elements (PE), that you can drop on the sim designer.Connect pins between PE, in data path define the control path, and run the simulation. Supports distributed simulations

Simple Dijkstra shortest path implementation - for learning and teaching

PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.

sectar: a program that creates encrypted tape archives(tar files), using the AES algorithm Rijndael. Encryption exported under exemption TSU 740.13. Was star, now sectar.

The goal of the Rats and Mazes project is to build a simple genetic algorithm to find general solutions to random non-cyclic single path mazes. I believe that the solutions will tend towards either the right/left-hand rule.

It's an implementation of the A* algorithm together with a grid processor which pre-processes 8-bit bpm graphic files using a variable resolution and an SDL user interface to test it.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)