Search Results for "path"
Sort By:
Showing 23 open source projects for "path"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Quadrotor
Quadrotor control, path planning and trajectory optimization
This MATLAB-based repository contains implementations of quadrotor control systems, path planning, and trajectory optimization algorithms developed as part of an advanced robotics course at the University of Pennsylvania. It includes PD controllers, path planning via Dijkstra and A* algorithms, and trajectory optimization (minimum snap/acceleration). Run code: change trajectories in file control/runsim.m and run. See quadrotor_dynamics.pdf for dynamic modeling of the quadrotor. ... -
2
gpsfeed+
A software gps simulator
A software gps simulator, providing TCP/IP, UDP, http and serial port connectivity in NMEA 0183, XML or user defined output format. Usable for testing all kinds of GPS applications. Can playback pre-recorded GPS files with NMEA output. -
3
SystemC Network Simulation Library (SCNSL) is an extension of SystemC to allow modelling packet-based networks such as wireless networks, ethernet, fieldbus, etc. As done by basic SystemC for signals on the bus, SCNSL provides primitives to model packet trasmission, reception, contention on the channel and wireless path loss. The use of SCNSL allows the easy and complete modelling of distributed applications of networked embedded systems such as wireless sensor networks, routers, and distributed plant controllers. SCNSL has migrated: please go to GitLab for the latest version: https://gitlab.com/open-kappa/scnsl
-
4
TEACUP
TCP Experiment Automation Controlled Using Python
TEACUP automates many aspects of running TCP performance experiments in a specially-constructed physical testbed. TEACUP enables repeatable testing of different TCP algorithms over a range of emulated network path conditions, bottleneck rate limits and bottleneck queuing disciplines. TEACUP utilises a text-based configuration file to define experiments as combinations of parameters specifying desired network path and end host conditions. When multiple values are provided (e.g. for TCP congestion control algorithm), an experiment is made up of multiple tests. ... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
5
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
6
A modeling and simulation tool for Routing problems on Graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulating a variety of real world routing solutions: Shortest path, TSP, VRP, VRP-TW. Check Git repository. https://github.com/guilhebl/routerapp
-
7
(RoboSim) Robot Simulator
(RoboSim) Java based Robot Localization and Path Planner Simulator.
Java based portable simulator to visualize and understand the Robot Localization, Path planning, Path Smoothing and PID controller concepts. It is very flexible and easy to use. It supports multiple platforms. The source code is available on Github where you can find latest development and up-to-date documentation. Source : https://github.com/habsoft/robosim Blog : https://robosimblog.wordpress.com Note : Use jre 1.7 to run it. 1.Histogram Filter 2.Histogram Filter with Sonar Range Finder (Experimental) 3.Kalman Filter 4.Particles Filter 5.Path Planning 6.Path Smoothing 7.PID Controller Path Planning Algorithms 1.BFS 2.DFS 3.A Star 4. ... -
8
**(9 march 2016) this project is continued on github : http://jaapkroe.github.io/polypy ** Python script to analyze (shortest-path) rings in structures read from xyz-files. It can be useful for example to identify defects in crystal structures or molecules.
-
9
xPyder PyMOL Plugin
Analyze and visualize coupled residues and their networks in proteins
xPyder is a PyMOL plugin to analyze and visualize on the 3D structure dynamical cross-correlation matrices (DCCM), linear mutual information (LMI), communication propensities (CP), intra- and inter-molecular interactions (e.g. PSN), and more, to produce highly customizable publication-quality images. xPyder identifies networks (using concepts from graph theory, such as hubs and shortest path searching), compares matrices and focuses the analysis on relevant information by filtering the data using a modular, user-expandable plugin system that takes advantage of structural and dynamical information, contributing to bridge the gap between dynamical and mechanical properties at the molecular level. -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
WISP
Weighted Implementation of Suboptimal Paths (WISP)
...Dynamical network analysis has been used to model this cooperation, helping to computationally explain how binding to an allosteric site can impact the behavior of a primary site often many angstroms away. Traditionally, computational efforts have focused on the most optimal path of correlated motions leading from the allosteric to the primary active site. We present a program called Weighted Implementation of Suboptimal Paths (WISP) capable of rapidly identifying additional suboptimal pathways that may also play important roles in the transmission of allosteric signals. Aside from providing signal redundancy, suboptimal paths traverse residues that, if disrupted through pharmacological or mutational means, could modulate the allosteric regulation of important drug targets. -
11
The developed graphical interface is based on the SKILL language which is a Lisp dialect used as a scripting language and PCell (Parameterized Cells) description language used in many EDA software suites by Cadence Design Systems.
-
12
islec
ISL Solid-Liquid Equilibrium Calculator
ISL Equilibrium Calculator,which process solid-liquid equilibrium calculation by using Harvie extended Pitzer's ion interaction electrolyte solution model and particle swarm optimization Gibbs free energy minimization (GEM). ISLEC is an efficient tool for solid-liquid equilibrium calculation, and can simulate the crystallization path of seawater and salt lake brines. ISLEC is suitable for related researches and process design. -
13
SPSens
Stochastic parameter sensitivity analysis for chemical networks
...It is possible to estimate sensitivities with respect to system parameters using the following algorithms: finite difference methods (crude monte carlo, common reaction path, coupled finite differences); likelihood ratio methods; and regularized pathwise derivatives. Additionally the package includes basic stochastic simulation algorithms. The package includes several example networks which can be easily modified for other networks. Serial and parallel MPI implementations can be built and called from the command line. ... -
14
Depolarization analysis tools
Tools for the accurate analysis of Raman depolarization measurement
...A numerical model is programme to calculate, for realistic experimental configurations, effective Raman line strength functions, which find their way into depolarization ratios. The model is based on interlinked integrations over the angles in the light collection path, and a finite Raman source volume along the excitation laser beam. The model deals as well with the conditional aperture parameters, associated with more than one optical component in the light collection path. Finally, the model also takes into account polarization aberrations introduced by the sample cell windows. -
15
MuLaViTo
A framework for the visualization of multi-layer networks
MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ... -
16
The sunflower library provides programming abstractions developed at the Autonomous Systems Lab http://www.asl.ethz.ch/. It contains a complete path planning and obstacle avoidance system, common mobile robotics tasks abstractions, and a 2D simulator.
-
17
This project at NICTA implements a broadcast routing protocol called Shortest Path Tree Broadcast (SPTB) under ns-2. This release also contains our implementation of a benchmark protocol called “TwoHop” which uses 2-hop neighbour information.
-
18
Software for simulating the flight path of high power rockets in six-degree-of-freedom. This software runs with Octave or Matlab and can simulate a wide range of scenarios including parachute recovery and multiple stage flights.
-
19
Projectile motion is a GUI based program that calculates various parameters of projectile motion based on initial velocity and height. It also plots the path of the projectile and can also find the location (x,y) as a function of time and vice versa.
-
20
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..
-
21
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.
-
22
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.
-
23
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.
- Previous
- You're on page 1
- Next
