210 skills found · Page 3 of 7
Kei18 / TswapSolving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution (ICAPS-22; AIJ-23)
zijinoier / Hetero MAPFSolve Multi-agent Path Finding problem for heterogeneous robots.
igrek51 / Coop PathfinderCooperative path-finding algorithm simulator for solving bottle-necks in multi-agent systems
ibrahimsaleem / PentestThinkingMCPA systematic, AI-powered penetration testing reasoning engine (MCP server) for attack path planning, CTF/HTB solving, and automated pentest workflows. Features Beam Search, MCTS, attack step scoring, and tool recommendations.
Rainyfish / 2E VRP ABCIn the process of solving the 2E-VRP problem, the large-scale destruction and repair algorithm is used to ensure that the algorithm does not fall into the local optimal solution. The process of the initialization process uses the greedy strategy to cluster the customers. The large-scale destruction process is to randomly remove the customer nodes on the satellite into the customer pool. The repair process is based on the reciprocal of the customer's distance to each customer in the customer pool. Gambling Select the satellite to which the customer belongs and engage in greedy insertion. For the second layer of path planning, you need to use multiple search operators, such as random sequence reversal exchange operator, crossover operator, damage and repair operator, and crossover operator variants, etc. to improve the artificial bee group algorithm Of the local search ability. To ensure that the global optimal situation can be found, the neighborhood of large-scale search. The improved artificial bee colony algorithm incorporates the idea of simulated annealing and improves the global optimization ability of artificial bee colony algorithm. For the artificial bee colony algorithm, the combination of global optimization ability and local optimization ability improves the possibility that the algorithm can find a better solution than the existing method. Multi - operator artificial bee colony algorithm, which extends the search range of the food source 's neighborhood, and more possibilities to find the global optimal solution. The experimental results show that the algorithm can get better path planning results
hezedu / FuckwinfsdelSolve Windows can't delete long paths file's bug.
aliezzahn / Most Profitable PathThis project solves the problem of finding the most profitable path for Alice in a tree, given that Bob is also moving from a specific node to the root. The solution is implemented in Rust.
DiogoRibeiro7 / Bmsspssspx is a clean, typed, and tested implementation of a deterministic Single‑Source Shortest Paths solver for directed graphs with non‑negative weights. It follows a BMSSP‑style divide‑and‑conquer design (levels, FindPivots, bounded base case) and includes a switchable frontier, an optional constant‑outdegree transform.
satinder147 / Maze Solving Using A Star AlgorithmIn this repository, I have made a maze solving system. The system takes in input of an maze using a camera. This Image is converted into a grid. It lets you find the shortest path between any two points
BessieChen / Coursera Advanced Algorithms And ComplexityThis course talks about networks flows which are used in more obvious applications such as optimal matchings, finding disjoint paths and flight scheduling as well as more surprising ones like image segmentation in computer vision. It then proceed to linear programming with applications in optimizing budget allocation, portfolio optimization, finding the cheapest diet satisfying all requirements, call routing in telecommunications and many others. Next discussing inherently hard problems for which no exact good solutions are known (and not likely to be found) and how to solve them in practice.
rick2x / GeopackerGeopacker is a QGIS plugin designed to solve the headache of broken paths when sharing QGIS projects. It bundles your entire current project (.qgz), vector layers, and raster layers into a single, clean .zip file ready to be shared.
dukduque / JPulseBaseJava codification of the pulse algorithm to solve the Constrained Shortest Path Problem (CSP)
chunibyo-wly / SDVRPSolving the Demand Splittable Vehicle Path Problem Using the Ant Colony Algorithm 使用蚁群算法求解需求可拆分车辆路径问题
ss892714028 / Maze PathFinder Visualization Python2D maze path solver visualizer implemented with python
surynek / BoOXMulti-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-based solvers are implemented. Recently also continuous variants of MAPF (MAPF^R) are supported.
Mechazo11 / Mobile Robot Path Planning Genetic AlgorithmSolves collision free shortest path planning problem for a mobile robot in a 2D static environment using Genetic Algorithm
prajwalsouza / Maze SolverSolves Mazes taking an image input, along with the starting and ending points. There are two Algorithms here which solve mazes. One of them is a Shortest Path Algorithm, the other, Minimal Tree Agorithm along with dead end filling.
albertorestifo / DijkstraDijkstra shortest path problem solved in Go
kylewray / EpicRobotic path planning using a CUDA-optimized potential field (log-space harmonic function) solver with ROS support.
threegoodprogrammers / SilkRoadSilk Road Graph Analyzer is an application in which you can draw you desired graph with arbitrary IDs and numbers, and solve Shortest Path and Traveling Sales Person problems.
