Search Results for "path finding matlab"
Sort By:
Showing 84 open source projects for "path finding matlab"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
1
Grey Wolf Optimizer for Path Planning
Grey Wolf Optimizer (GWO) path planning/trajectory
The Grey Wolf Optimizer for Path Planning is a MATLAB-based implementation of the Grey Wolf Optimizer (GWO) algorithm designed for UAV path and trajectory planning. It allows simulation of both two-dimensional and three-dimensional UAV trajectory planning depending on parameter setups. The tool provides built-in functions to configure different UAV environments and supports multiple optimization objectives. -
2
gptoolbox
Matlab toolbox for Geometry Processing
...It also implements discrete differential geometry operators, geodesic distance computations, and constructive solid geometry operations. Beyond geometry, gptoolbox includes features for quadratic programming, image colorization, and dithering. Most of the functions are pure MATLAB code, requiring only that the toolbox be added to the MATLAB path, while some specialized features depend on external libraries and compiled mex files. -
3
ngraph.path
Path finding in a graph
ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to... -
4
silomia
Through the path of words, touch the light
The website started in 2007, was updated and expanded since then, and was translated into English in 2021. The whole work is under the license: CC BY 4.0 (with tracking of the modifications if redistribution, see section 3a1B, hence the usefulness of the hosting at Github with versioning, checksum, and signature) Re-discover Rudyard Kipling's famous poem “If… you will be a man my son” that has inspired so many generations. It celebrates the courage to overcome hardships. I have put together... -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
Lucky
A full-featured Crystal web framework that catches bugs for you
...You and your users will love the extra dose of speed. Authentication, asset management, CORS, database ORM, and more can all be included when creating a new Lucky project. Instead of finding bugs in QA or in production, Lucky is designed to catch as many bugs as possible at compile time. Lucky uses Action classes for handling HTTP requests and responses. The classes map the routes and parameters it handles to a response block. Lucky can generate these classes for you with ’lucky gen.action`. Using a class per action provides very solid automatic error detection, as well as the generation of routing, path, and link helpers and methods. -
6
crwlr
Library for Rapid (Web) Crawler and Scraper Development
...For most real-world use cases, those two things go hand in hand, which is why this library helps with and combines both. A (web) crawler is a program that (down)loads documents and follows the links in it to load them as well. A crawler could just load actually all links it is finding (and is allowed to load according to the robots.txt file), then it would just load the whole internet (if the URL(s) it starts with are no dead end). Or it can be restricted to load only links matching certain criteria (on same domain/host, URL path starts with "/foo",...) or only to a certain depth. A depth of 3 means 3 levels deep. ... -
7
Lightning Network Daemon
A complete implementation of a Lightning Network node
The Lightning Network Daemon (lnd), is a complete implementation of a Lightning Network node. lnd has several pluggable back-end chain services including btcd (a full-node), bitcoind, and neutrino (a new experimental light client). The project's codebase uses the btcsuite set of Bitcoin libraries and also exports a large set of isolated re-usable Lightning Network-related libraries within it, and fully conforms to the Lightning Network specification (BOLTs). BOLT stands for Basis of... -
8
Learn AI Engineering
Learn AI and LLMs from scratch using free resources
...It’s equally useful for refreshers—dipping into a specific module before a project—as it is for a full, self-directed curriculum. By centralizing the best references in one place, the repo reduces the overhead of finding, filtering, and sequencing resources, letting you focus on learning and building. -
9
Path Finder for Processing
2D/3D Path finding library
V1.0 is compatible with Processing 2 & 3 This library provides a set of classes to define a graph comprising of nodes and edges. Then allow the user to select from 4 different algorithms (Depth First, Breadth First, Dijkstra, A*) to find a path through the graph. Although suitable for games it can be used in a wide range of problems involving networks. Although the download is packaged as a Processing library the actual code has no dependencies on Processing except the examples. To use... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
JSoko
The Sokoban game implemented in Java.
JSoko is a Java program for playing the Sokoban game. It features path finding, auto push, auto solving, undo/redo, deadlock detection, and more. -
11
StringTemplate-for-Octave
Interface for GNU Octave/MATLAB with StringTemplate V4 template engine
...A major sample presents a simple compiler, which passes its entire parse tree as a single deeply structured data object to the template engine for code generation. All you have to do is copying the wrapper script somewhere into your Octave search path and adjusting the Java class path such that the StringTemplate jar and all of your template files are found. Now, running the template expansion is one simple Octave command looking like: txt=st4Render(groupFile, template, attribute, value, attrib2, val2, ..) -
12
ArchCUT3-D
ArchCUT3-D: 3-D Analysis of Incised Archeological Surfaces
...Techné of Rock Engravings –the Timna Case Study. J Archaeol Method Theory 31, 1917–1953. https://doi.org/10.1007/s10816-024-09658-5 For advanced users, the open source MATLAB code is available at the following link: https://drive.google.com/drive/folders/1dDxapbCrfpzT7tqkLhSIsh3bz1quFZBS?usp=sharing -
13
GeoTools, the Java GIS toolkit
Toolkit for working with and mapping geospatial data
GeoTools is an open source (LGPL) Java code library which provides standards compliant methods for the manipulation of geospatial data. GeoTools is an Open Source Geospatial Foundation project. The GeoTools library data structures are based on Open Geospatial Consortium (OGC) specifications. -
14
Infinite Wisdom
Java RTS framework
A bare bones RTS game framework. It has networking and replay support, and have some building blocks to build AI agents (discretized path finding in a continous world). Update (2025. Jun): javax.xml.bind.annotation.XmlAccessType was removed from JDKs later than 1.8. So use the project with JDKs from 1.6 to 1.8. Write in the forum if you're interested in running it on a more modern JDK. The demo program's entry point is Dom1Bootstrapper. You can download a runnable demo jar from the files. ... -
15
Puzzle Dungeon
A cell-based puzzle game featuring classic and completely new puzzles
...Players can reload the same level if stuck - whether it’s newly generated or pre-created. Some puzzles are time-limited, others require strict adherence to rules, and many involve finding a path to the finish. Some levels even feature enemy encounters. -
16
AI for Games
Game framework with AI
Provides a framework / game engine for building 2D games and includes sophisticated AI routines to manage state-driven entities and autonomous agents. Although this library makes several very powerful AI techniques available and take care of all the calculations needed to update and render the game entities. -
17
Sobelow
Security-focused static analysis for the Phoenix Framework
Sobelow is a security-focused static analysis tool for the Phoenix framework. For security researchers, it is a useful tool for getting a quick view of points-of-interest. For project maintainers, it can be used to prevent the introduction of a number of common vulnerabilities. Potential vulnerabilities are flagged in different colors according to confidence in their insecurity. High confidence is red, medium confidence is yellow, and low confidence is green. A finding is typically marked... -
18
library-brainmap
Brain Neuron Map
...Maze Generation: Effortlessly generate mazes of varying complexity, perfect for games, puzzles, and simulations. Path-Finding Interface: Implement an intuitive path-finding interface to navigate through your designed maps and mazes. Customization: Fine-tune the appearance and behavior of your maps and mazes to match your project's unique requirements. Integration with Ronin Engine (https://sourceforge.net/p/ronin-engine) -
19
OptimTraj
A trajectory optimization library for Matlab
OptimTraj is a MATLAB toolbox for solving trajectory optimization problems. It supports direct collocation, shooting methods, and pseudospectral methods for finding optimal control inputs and system trajectories. It is useful for robotics, aerospace, biomechanics, and any domain requiring time-optimal or energy-optimal motion planning. -
20
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
21
JJ
JSON Stream Editor (command line utility)
JJ is a command line utility that provides a fast and simple way to retrieve or update values from JSON documents. It's powered by GJSON and SJSON under the hood. It's fast because it avoids parsing irrelevant sections of json, skipping over values that do not apply, and aborts as soon as the target value has been found or updated. -
22
TensorNetwork
A library for easy and efficient manipulation of tensor networks
...Common network families (MPS/TT, PEPS, MERA, tree networks) are expressed with concise APIs that encourage experimentation and comparison. The library provides automatic path finding and cost estimation, exposing when contractions will explode in memory and suggesting better orders. Because it supports backends such as NumPy, TensorFlow, PyTorch, and JAX, the same model can run on CPUs, GPUs, or TPUs with minimal code changes. Tutorials and visualization helpers make it easier to understand how network topology affects expressive power and computational cost. -
23
Still Yet Another Sokoban
An implementation of the popular Sokoban puzzle game. Win/Mac/Linux
An implementation of the popular Sokoban puzzle game. The goal is to push the crates onto the designated squares without getting stuck. Crates can only be pushed forward. The levels provided are assembled from various third-party sources. Sokoban was originally created in 1981 by Hiroyuki Imabayashi. Available as Windows installer, portable .zip for Windows, Mac .dmg file, or cross-platform source code. Source code: http://github.com/davidjoffe/sokoban (source code is C++, only... -
24
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
25
AllTheHaxx
Alternative Teeworlds Client with many exciting features!
A modified client for the open source online multiplayer game Teeworlds, featuring a Lua API. Other highlights include smooth UI design, an identity management system, A* path finding for race maps and a great customizability.
