GitHub / danielbal21 / BMC_Path_Planning
Solve grid-based pathfinding challenges efficiently. Our tool transforms grids into SAT problems using Kripke Structures and Boolean formulas, ensuring step-by-step validity while avoiding collisions. Simplify navigation in dynamic environments with central and dynamic agents.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbal21%2FBMC_Path_Planning
PURL: pkg:github/danielbal21/BMC_Path_Planning
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 54.6 MB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 1 year ago
Pushed at: over 1 year ago
Last synced at: over 1 year ago
Topics: automata-theory, bmc, hyper-properties, kripke, pathfinding, pathplanning, sat, z3