Search Results for "path-setting"

...JCTools is also used by commercial products with great results. JCTools is maven built and requires an existing Maven installation and JDK8 (only for building, runtime is 1.6 compliant). With ‘MAVEN_HOME/bin’ on the path and JDK8 set to your ‘JAVA_HOME’ you should be able to run “mvn install” from this directory. While you are free to copy & extend JCTools, we would much prefer it if you have a versioned dependency on JCTools to enable better support, upgrade paths and discussion.

Control logic Java package is a set of Java classes aimed at: - Implementation of a real-time PC-based control - Simulation of control systems Setting up a control system involves working with so-called triggers. See project Wiki for detailed information and examples.

hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. It is accessible to learners at different levels, from beginners to more advanced users who want to reinforce their knowledge. ...

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design and a comprehensive set of unit and integration tests. Possibility to define additional stateless and stateful constraints/conditions to account for the richness of your problem. ...

PSF is a path-sensitive, inter-procedural program analysis framework developed on top of Soot.

All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.

The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.

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..

Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.