Invention Grant
- Patent Title: Boolean satisfiability (SAT) reduction for geometry and kinematics agnostic multi-agent planning
-
Application No.: US15387503Application Date: 2016-12-21
-
Publication No.: US10480947B2Publication Date: 2019-11-19
- Inventor: Geoffrey Lalonde , Peter Anderson-Sprecher
- Applicant: X Development LLC
- Applicant Address: US CA Mountain View
- Assignee: X Development LLC
- Current Assignee: X Development LLC
- Current Assignee Address: US CA Mountain View
- Agency: McDonnell Boehnen Hulbert & Berghoff LLP
- Main IPC: G01C21/20
- IPC: G01C21/20 ; G01C21/34

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.
Public/Granted literature
- US20180172450A1 Boolean Satisfiability (SAT) Reduction for Geometry and Kinematics Agnostic Multi-Agent Planning Public/Granted day:2018-06-21
Information query
IPC分类: