Pinned Repositories
RR1
RR1: Real Robot One - a DIY 3D-Printable Desktop Robotic Arm. RR1 is a 6-axis robotic arm based on 3D printed parts, uses stepper motors Nema 23 and Nema 17 and custom (split ring) planetary gearboxes.
boOX
Multi-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.
reLOC
An experimental package for solving various versions of multi-agent path finding problem (MAPF). Most of solvers in the package are based on the reduction to propositional satisfiability (SAT). This is the original implementation of the MDD-SAT solver.
mutEX
A research library for experimenting with mutex networks.
realX
This repository was intended as a collection of experimental programs for continuous motion planning but as many times before contains some completely unrelated programs too (such as network embedding based on SAT).
RR_xoft
Real Robot Software
sigmaSAT
An experimental package for Boolean formula preprocessing. This is rather a collection of functions than a standalone program. The goal of preprocessing is to generate a formula that is equisatisfiable but hopefully simpler than the input one. Believe it or not, the resulting formula is sometimes really simpler.
vsat
This is an implementation of vanilla CDCL SAT solver. Includes standard features but nothing above that. If you cannot beat any solver from the SAT competition but still want to beat someone, then vsat is your choice...
surynek's Repositories
surynek/RR_xoft
Real Robot Software
surynek/RR1
RR1: Real Robot One - a DIY 3D-Printable Desktop Robotic Arm. RR1 is a 6-axis robotic arm based on 3D printed parts, uses stepper motors Nema 23 and Nema 17 and custom (split ring) planetary gearboxes.
surynek/realX
This repository was intended as a collection of experimental programs for continuous motion planning but as many times before contains some completely unrelated programs too (such as network embedding based on SAT).
surynek/boOX
Multi-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.
surynek/reLOC
An experimental package for solving various versions of multi-agent path finding problem (MAPF). Most of solvers in the package are based on the reduction to propositional satisfiability (SAT). This is the original implementation of the MDD-SAT solver.
surynek/mutEX
A research library for experimenting with mutex networks.
surynek/sigmaSAT
An experimental package for Boolean formula preprocessing. This is rather a collection of functions than a standalone program. The goal of preprocessing is to generate a formula that is equisatisfiable but hopefully simpler than the input one. Believe it or not, the resulting formula is sometimes really simpler.
surynek/vsat
This is an implementation of vanilla CDCL SAT solver. Includes standard features but nothing above that. If you cannot beat any solver from the SAT competition but still want to beat someone, then vsat is your choice...