Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change. Various aspects of such robot motion planning are implemented in particular systems and methods that facilitate motion planning of the robot for various environments and tasks.

Abstract: Systems, methods and user interfaces employ clearance or margin determinations in motion planning and motion control for robots in operational environments, the clearance or margin determinations representing an amount of clearance or margin between at least one portion of a robot and one or more objects in the operational environment. Clearances may be displayed in a presentation of motion, for instance displayed in a presentation of a roadmap or a number of paths in a representation of a three-dimensional environment in which the robot operates. Roadmaps may be adjusted based at least in part of determined clearances, for instance based on user input or autonomously.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change. Various aspects of such robot motion planning are implemented in particular systems and methods that facilitate motion planning of the robot for various environments and tasks.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change. Various aspects of such robot motion planning are implemented in particular systems and methods that facilitate motion planning of the robot for various environments and tasks.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change. Various aspects of such robot motion planning are implemented in particular systems and methods that facilitate motion planning of the robot for various environments and tasks.

Abstract: A motion planner performs motion planning with collision assessment, using a motion planning lattice that represents configuration states of a primary agent (e.g., autonomous vehicle) as nodes and transitions between states as edges. The system may assign cost values to edges, the cost values representing probability or likelihood of collision for the corresponding transition. The cost values may additionally or alternatively represent a severity of collision, for example generated via a parametric function with two or more parameters and one or more weights. A primary agent and/or dynamic obstacles may be represented as respective oriented bounding boxes. Some obstacles (e.g., road markings, edge of road) may be represented as curves.

Abstract: A system for motion planning for autonomous vehicles can include a plurality of sensors, a plurality of detectors in electrical communication with the plurality of sensors, and a motion planning module in electrical communication with the plurality of detectors and a computing system of an autonomous vehicle. The motion planning module stores a planning graph with each node representing, explicitly or implicitly, time and variables defining a state of the autonomous vehicle, an operating environment, or both the state of the autonomous vehicle and the operating environment. A reconfigurable processor can include a collision detection module and, optionally, a shortest path module. Pre-computed collision data and planning graph data reflecting logical/physical node mapping can be communicated to the processor during a programming phase and used during runtime.

Abstract: A processor-based system provides a user interface to facilitate generation of motion planning graphs or roadmaps, for example via autonomous generate of additional poses, for example neighboring poses, based on specified seed or origin pose, and/or generate or sub-lattice connecting poses and/or edges to couple separate regions or sub-lattices of the motion planning graph together. Such may include performing collision-checking and/or kinematic checking (e.g., taking into account kinematic constraints of robots being modeled). The resulting motion planning graphs or roadmaps are useful in controlling robots during runtime. Robots may include robots with appendages and/or robots in the form of autonomous vehicles.

Abstract: A motion planner of an autonomous vehicle's computer system uses reconfigurable collision detection architecture hardware to perform a collision assessment on a planning graph for the vehicle prior to execution of a motion plan. For edges on the planning graph, which represent transitions in states of the vehicle, the system sets a probability of collision with a dynamic object in the environment based at least in part on the collision assessment. Depending on whether the goal of the vehicle is to avoid or collide with a particular dynamic object in the environment, the system then performs an optimization to identify a path in the resulting planning graph with either a relatively high or relatively low potential of a collision with the particular dynamic object. The system then causes the actuator system of the vehicle to implement a motion plan with the applicable identified path based at least in part on the optimization.

Abstract: A system for motion planning for autonomous vehicles can include a plurality of sensors, a plurality of detectors in electrical communication with the plurality of sensors, and a motion planning module in electrical communication with the plurality of detectors and a computing system of an autonomous vehicle. The motion planning module stores a planning graph with each node representing, explicitly or implicitly, time and variables defining a state of the autonomous vehicle, an operating environment, or both the state of the autonomous vehicle and the operating environment. A reconfigurable processor can include a collision detection module and, optionally, a shortest path module. Pre-computed collision data and planning graph data reflecting logical/physical node mapping can be communicated to the processor during a programming phase and used during runtime.

Abstract: A motion planner of an autonomous vehicle's computer system uses reconfigurable collision detection architecture hardware to perform a collision assessment on a planning graph for the vehicle prior to execution of a motion plan. For edges on the planning graph, which represent transitions in states of the vehicle, the system sets a probability of collision with a dynamic object in the environment based at least in part on the collision assessment. Depending on whether the goal of the vehicle is to avoid or collide with a particular dynamic object in the environment, the system then performs an optimization to identify a path in the resulting planning graph with either a relatively high or relatively low potential of a collision with the particular dynamic object. The system then causes the actuator system of the vehicle to implement a motion plan with the applicable identified path based at least in part on the optimization.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change.

Abstract: A motion planner of a computer system of a primary agent, e.g., an autonomous vehicle, uses reconfigurable collision detection architecture hardware to perform a collision assessment on a planning graph for the primary agent prior to execution of a motion plan. For edges on the planning graph, which represent transitions in states of the primary agent, the system sets a probability of collision with another agent, e.g., a dynamic object, in the environment based at least in part on the collision assessment. Depending on whether the goal of the primary agent is to avoid or collide with a particular dynamic object in the environment, the system then performs an optimization to identify a path in the resulting planning graph with either a relatively low or relatively high potential of a collision with the particular dynamic object. The system then causes the actuator system of the primary agent to implement a motion plan with the applicable identified path based at least in part on the optimization.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change. Various aspects of such robot motion planning are implemented in particular systems and methods that facilitate motion planning of the robot for various environments and tasks.

Abstract: Collision detection useful in motion planning for robotics advantageously represents planned motions of each of a plurality of robots as obstacles when performing motion planning for any given robot in the plurality of robots that operate in a shared workspace, including taking into account the planned motions during collision assessment. Edges of a motion planning graph are assigned cost values, based at least in part on the collision assessment. Obstacles may be pruned as corresponding motions are completed. Motion planning requests may be queued, and some robots skipped, for example in response to an error or blocked condition.

Abstract: A motion planner performs motion planning with collision assessment, using a motion planning lattice that represents configuration states of a primary agent (e.g., autonomous vehicle) as nodes and transitions between states as edges. The system may assign cost values to edges, the cost values representing probability or likelihood of collision for the corresponding transition. The cost values may additionally or alternatively represent a severity of collision, for example generated via a parametric function with two or more parameters and one or more weights. A primary agent and/or dynamic obstacles may be represented as respective oriented bounding boxes. Some obstacles (e.g., road markings, edge of road) may be represented as curves.

Abstract: A robot control system determines which of a number of discretizations to use to generate discretized representations of robot swept volumes and to generate discretized representations of the environment in which the robot will operate. Obstacle voxels (or boxes) representing the environment and obstacles therein are streamed into the processor and stored in on-chip environment memory. At runtime, the robot control system may dynamically switch between multiple motion planning graphs stored in off-chip or on-chip memory. The dynamically switching between multiple motion planning graphs at runtime enables the robot to perform motion planning at a relatively low cost as characteristics of the robot itself change.