G05B2219/40446

SYSTEM AND METHOD FOR TRAJECTORY PLANNING FOR MANIPULATORS IN ROBOTIC FINISHING APPLICATIONS
20190321980 · 2019-10-24 ·

Methods, systems, and apparatus for automatically moving a tool attached to a robotic manipulator from a start position to a goal position. The method includes determining, using a processor, a plurality of next possible positions from the start position. The method includes selecting a second position from the plurality of next possible positions based on respective costs associated with moving the tool from the start position to each of the possible positions in the plurality of next possible positions. The method includes moving, using a plurality of actuators, the tool to the second position. The method includes determining an updated plurality of next possible positions, selecting a next position, and moving the tool to the next position until the goal position is reached.

SYSTEMS AND METHODS FOR FACILITATING THE MANAGEMENT OF ENERGY PRODUCTION OR PROCESSING FACILITIES

A method for facilitating the management of one or more energy production or processing facilities includes receiving an alert corresponding to an operational anomaly associated with the process equipment, interrogating a data structure linking together and organizing a plurality of distinct data sources, selecting a subset of data sources from the plurality of data sources identified as associated with a potential cause of the alert based on the interrogation of the data structure, statistically analyzing data sourced from the selected subset of data sources, identifying the potential cause of the alert based on the statistical analysis, and recommending a corrective action to resolve the identified potential cause of the alert using the plurality of distinct data sources.

MOTION PLANNING OF A ROBOT STORING A DISCRETIZED ENVIRONMENT ON ONE OR MORE PROCESSORS AND IMPROVED OPERATION OF SAME

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.

System for interacting with machines using natural language input

A method is provided. The method includes obtaining sensor data indicative of a set of objects detected within an environment. The method also includes generating a state graph based on the sensor data. The state graph includes a set of object nodes and a set of property nodes. The method further includes obtaining user input data generated based on a natural language input. The method further includes updating the state graph based on the user input data to generate an enhanced state graph. The enhanced state graph includes additional nodes generated based on the user input data. The method further includes generating a set of instructions for a set of mechanical systems based on the enhanced state graph. The method further includes operating the set of mechanical systems to achieve a set of objectives based on the set of instructions.

METHOD AND APPARATUS FOR IMPROVED SAMPLING-BASED GRAPH GENERATION FOR ONLINE PATH PLANNING BY A ROBOT

Disclosed techniques for graph generation for online path planning offer multiple advantages, such as providing for high-quality motion during online operation of the robot, while reducing the computational burden of graph generation. Achieving these competing goals involves reducing the dimensionality of the graph generation problem by performing unconstrained sampling that defines partial robot poses that set values for fewer than all configuration parameters of the robot. The remaining configuration parameters for each sample are then determined in dependence on a distance function that relates the partial pose to one or more reference robot poses that are associated with one or more tasks to be performed by the robot and are provided as inputs to the graph generation. Reference robot poses may be determined automatically based on computer analysis of the robot application or may be user-input values.

Motion planning of a robot storing a discretized environment on one or more processors and improved operation of same

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.

Method And Apparatus For Planning And/Or Control Of A Robot Application

A method for planning and/or controlling a robot application on the basis of system and/or process parameters includes storing parameter values and managing the parameter values using a graph structure that includes one or more nodes and injective, surjective, or bijective relations between the nodes. Managing the parameter values in the graph structure includes managing the values in clusters whereby two or more parameters are combined into a node.

METHOD, MACHINE CONTROL AND COMPUTER-PROGRAM PRODUCT FOR DETERMINING A PATH FOR AUTONAVIGATION
20240408759 · 2024-12-12 ·

In a method for determining at least part of a path (12) for connecting at least one starting point (14) to at least one finishing point (16) in a space (R) for at least one autonavigation of at least one movable component through the space on a machine (100), at least one model of the movable component and the machine is provided, information on the geometry is gathered, current positions are determined and these are brought into relation with one another to create a graph (10). An algorithm is used to calculate the path (12), collision-free autonavigation along the path (12) being carried out after a collision check has been performed. This assists the operator in adapting the machine cycle, while likewise bringing about an improvement in terms of the travel path, cycle time, reliability of the process, energy and wear.

Interacting with machines using natural language input and an enhanced state graph

A method is provided. The method includes obtaining a state graph that represents a set of objects within an environment and a set of positions of the set of objects within the environment. The state graph includes a set of object nodes and a set of property nodes. The method also includes obtaining user input data. The user input data is generated based on a natural language input. The method further includes updating the state graph based on the user input data to generate an enhanced state graph. The enhanced state graph includes additional nodes generated based on the user input data. The method further includes providing the enhanced state graph to a planning module. The planning modules generates instructions for operating a mechanical system based on the enhanced state graph.

Motion planning for multiple robots in shared workspace

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.