Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning

Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning

US Patent 11262200 · Granted Mar 1, 2022

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Detecting boxes2024
Detecting boxes2023
Using object observations of mobile robots to generate a spatio-temporal object 2023
Detecting boxes2023
Multi-agent coordination under sparse networking2021
Multi-agent coordination under sparse networking2021
Roadmap segmentation for robotic device coordination2021
Using object observations of mobile robots to generate a spatio-temporal object 2021
Detecting boxes2021
Dynamically adjusting roadmaps for robots based on sensed environmental data2021
Layered multi-agent coordination2021
Layered multi-agent coordination2021