Abstract: A method for ascertaining a direction of travel and/or a future path of travel of a robot and/or a vehicle, movable at least semiautonomously or autonomously in a dynamically changeable surrounding area.

Abstract: A computer-implemented method for determining a motion trajectory for a mobile robot based on an occupancy prior indicating probabilities of presence of dynamic objects and/or individuals in a map of an environment. Occupancy priors are determined by a reward function defined by reward function parameters. The determining of the reward function parameters includes: providing semantic maps; providing training trajectories for each of semantic maps; computing a gradient as a difference between an expected mean feature count and an empirical mean feature count depending on each of the semantic maps and on each of the training trajectories, the empirical mean feature count is the average number of features accumulated over the provided training trajectories of the semantic maps, wherein the expected mean feature count is the average number of features accumulated by trajectories generated depending on the current reward function parameters; and updating the reward function parameters depending on the gradient.

Abstract: A method for predicting at least one future velocity vector and/or a future pose of a pedestrian in an area of prediction. A map of a surrounding environment of the pedestrian and current velocity vectors of other pedestrians in the area of prediction are taken into account in the prediction.

Abstract: A computer-implemented method for planning an optimized motion path. The optimized motion path is determined applying a sampling-based motion-planning algorithm depending on a sample node set including sample nodes. The sample nodes in the sample node set are deterministically selected from a configuration node set including all obstacle free nodes. The sample nodes are selected to optimize a given dispersion criterion. The dispersion criterion selects the sample nodes so that the largest uncovered area/space within the configuration node set is as small as possible.

Abstract: A method of controlling a vehicle or robot. The method includes the following steps: determining a first control sequence, determining a second control sequence for controlling the vehicle or robot depending on the first control sequence, a current state of the vehicle or robot, and on a model characterizing a dynamic behavior of the vehicle or robot, controlling the vehicle or robot depending on the second control sequence, wherein the determining of the first control sequence is performed depending on a first candidate control sequence and a second candidate control sequence.

Abstract: A computer-implemented method for determining a control trajectory for a robotic device. The method includes: performing an information theoretic model predictive control applying a control trajectory sample prior in each time step to obtain a control trajectory for a given time horizon; determining the control trajectory sample prior depending on a data-driven trajectory prediction model which is trained to output a control trajectory sample as the control trajectory sample prior based on an actual state of the robotic device.

Abstract: A computer-implemented method for determining an appropriate control strategy for a mobile agent for an environment with one or more dynamic objects. The method includes: providing a number of different scenarios wherein to each of the scenarios a number of dynamic objects is associated, wherein for each of the scenarios, each of the dynamic objects is associated with a start, a goal and a behavior specification; providing a number of control strategy candidates for the mobile agent; benchmarking each of the control strategy candidates in any of the scenarios; selecting the control strategy for the mobile agent depending on the result of the benchmarking of the control strategy candidates.

Abstract: A computer-implemented method for determining a control trajectory for a robotic device. The method includes: performing an information theoretic model predictive control applying a control trajectory sample prior in each time step to obtain a control trajectory for a given time horizon; determining the control trajectory sample prior depending on a data-driven trajectory prediction model which is trained to output a control trajectory sample as the control trajectory sample prior based on an actual state of the robotic device.

Abstract: A computer-implemented method for determining a motion trajectory for a mobile robot based on an occupancy prior indicating probabilities of presence of dynamic objects and/or individuals in a map of an environment. Occupancy priors are determined by a reward function defined by reward function parameters. The determining of the reward function parameters includes: providing semantic maps; providing training trajectories for each of semantic maps; computing a gradient as a difference between an expected mean feature count and an empirical mean feature count depending on each of the semantic maps and on each of the training trajectories, the empirical mean feature count is the average number of features accumulated over the provided training trajectories of the semantic maps, wherein the expected mean feature count is the average number of features accumulated by trajectories generated depending on the current reward function parameters; and updating the reward function parameters depending on the gradient.

Abstract: A computer-implemented method for planning a motion path for multiple agents. The method includes: performing a conflict-based motion planning for the multiple agents, wherein conflict-free motion paths for each of the agents are determined depending on movement costs, determining the poses and velocities of one or more individual objects and one or more groups of objects; calculating the movement costs depending on interaction costs of each of the agents with the one or more objects and/or the one or more groups of objects.

Abstract: A computer-implemented method for planning an optimized motion path. The optimized motion path is determined applying a sampling-based motion-planning algorithm depending on a sample node set including sample nodes. The sample nodes in the sample node set are deterministically selected from a configuration node set including all obstacle free nodes. The sample nodes are selected to optimize a given dispersion criterion. The dispersion criterion selects the sample nodes so that the largest uncovered area/space within the configuration node set is as small as possible.

Abstract: A method for predicting at least one future velocity vector and/or a future pose of a pedestrian in an area of prediction. A map of a surrounding environment of the pedestrian and current velocity vectors of other pedestrians in the area of prediction are taken into account in the prediction.

Abstract: A method of controlling a vehicle or robot. The method includes the following steps: determining a first control sequence, determining a second control sequence for controlling the vehicle or robot depending on the first control sequence, a current state of the vehicle or robot, and on a model characterizing a dynamic behavior of the vehicle or robot, controlling the vehicle or robot depending on the second control sequence, wherein the determining of the first control sequence is performed depending on a first candidate control sequence and a second candidate control sequence.

Abstract: A method is provided for modulating transport of an oxodicarboxylate across the mitochondrial membrane of a yeast which method comprises modulating in said yeast the activity of one or more Odc1p and/or Odc2p yeast mitochondrial transport polypeptides.