{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-11262200","patent":{"patent_number":"US-11262200","title":"Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning","assignee":null,"inventors":[],"filing_date":"2019-10-15T00:00:00.000Z","publication_date":"2022-03-01T00:00:00.000Z","cpc_codes":["G01C","G01C","G01C"],"num_claims":20,"abstract":"Systems and methods related to roadmaps for robotic devices are provided. A computing device can receive a roadmap representing a plurality of paths through an environment. The computing device can discretize the roadmap to obtain a discrete planning graph having a plurality of states corresponding to discretized segments of the plurality of paths of the roadmap such that states corresponding to adjacent discretized path segments are connected in the discrete planning graph. The computing device can determine a Boolean equation representing at least a portion of the discrete planning graph. The computing device can determine a sequence of states from the plurality of states of the discrete planning graph such that the determined sequence of states satisfies the Boolean equation. The computing device can provide a route through the environment for a robotic device based on the determined sequence of states."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning","description":"Systems and methods related to roadmaps for robotic devices are provided. A computing device can receive a roadmap representing a plurality of paths through an environment. The computing device can di","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-11262200","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-11262200","citation_suggestion":"Patentable. \"Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning\" (US-11262200). https://patentable.app/patents/US-11262200","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-11262200","json":"https://patentable.app/api/llm-context/US-11262200","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-05-30T17:37:53.329Z"}