Search Results for "path-setting" - Page 2

An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..

PIMC++ is a code designed to perform fully-correlated simulations of quantum systems in continuous space at finite temperature using Path Integral Monte Carlo. It is designed in a modular way to facilitate easy addition of new algorithms.

Simulates and visualizes swarming algorithms with limited communication. Also provides an interface to animate particle motion by playback (with pause, fastforward, and rewind) of path information from files. Can output EPS figures and avi frames.

CoPP is an object-oriented framework for developing algorithms for robot path planning. One of of the design goals is to make it easy to make comparisons between various path planning algorithms.

SimKnowledge is a multi agent-based simulation that simulates human actors in an organizational setting. Specifically, the organization simulated is a software company building individual software for customers on a project basis.

...The online version doesn't require any download - simply write/edit your code and simulate it side by side! CNC Simulator is a Computer Numerical Control (CNC) lathe machine simulator. It simulates the path that the tool of a CNC lathe would take for a given program. The simulation is two-dimensional. with provision for final view in 3D using OpenGL.

A project originally for an undergraduate Freshman seminar on motion planning algorithms. Provides a basic interface for drawing obstacles in a 2-D plane and the ability to select an algorithm by which to plan a path in this user-defined world.

...We tackle these problems by introducing a bio-inspired algorithm, which lets the content place itself where it is needed. It is robust, scalable and adaptive. The transport path of content is exploited to replicate content and limited storage space is handled by clean-up mechanisms. We implemented a simulator to show the algorithm's performance and to test its behavior under real circumstances. It is easily extendable to support several new scenarios or changes to the algorithm (see replication and client models).