Abstract: A method and a device for the mutual monitoring and/or control of a multiplicity of autonomous technical systems which are at least partially interconnected to one another via a communication network is provided. At least one of the autonomous technical systems is embodied as a monitoring autonomous technical system and monitors the operating behaviour of other autonomous technical systems. Since a specified first rule, the monitoring autonomous technical system detects an operating behavior, which is contrary to the rule, of a first autonomous technical system and generates a status message about the operating behavior which is contrary to the rule therefrom. Depending on the evaluation, a control rule is derived for the first autonomous technical system and communicated to a control module which is assigned to the first autonomous technical system. The operating behavior of the first autonomous technical system is controlled on the basis of the control rule.

Abstract: A method for the computer-aided calculation of the movement of an object using sensor data from a sensor arranged on the object is provided. The sensor data comprise measuring point set measured at different time points, and the movement of the object is determined between different measuring point sets. From the measuring point sets, initially structural information is extracted and stored together with the measuring points that are not to be associated with any structural type. Subsequently, associations between the structural elements with the same structure type are determined and a corresponding transformation for representing the structural elements is performed. An association of the unassignable measuring points and the structural elements is created and a corresponding transformation of the superimposed associated measuring points and structural elements is performed.

Abstract: A graph structure is generated to describe an area with a free area and an occupied area. In this case a topological graph structure for the free area is determined. A point of the topological graph structure is selected and for this a nearest adjacent occupied area point is determined. For this nearest adjacent occupied area point location information is determined. The graph structure is formed from at least the selected point of the topological graph structure and from the associated location information of the nearest adjacent occupied area point.

Abstract: A method for the computer-aided calculation of the movement of an object using sensor data from a sensor arranged on the object is provided. The sensor data comprise measuring point set measured at different time points, and the movement of the object is determined between different measuring point sets. From the measuring point sets, initially structural information is extracted and stored together with the measuring points that are not to be associated with any structural type. Subsequently, associations between the structural elements with the same structure type are determined and a corresponding transformation for representing the structural elements is performed. An association of the unassignable measuring points and the structural elements is created and a corresponding transformation of the superimposed associated measuring points and structural elements is performed.

Abstract: A graph structure is generated to describe an area with a free area and an occupied area. In this case a topological graph structure for the free area is determined. A point of the topological graph structure is selected and for this a nearest adjacent occupied area point is determined. For this nearest adjacent occupied area point location information is determined. The graph structure is formed from at least the selected point of the topological graph structure and from the associated location information of the nearest adjacent occupied area point.

Abstract: A graph structure is generated to describe an area with a free area and an occupied area. In this case a topological graph structure for the free area is determined. A point of the topological graph structure is selected and for this a nearest adjacent occupied area point is determined. For this nearest adjacent occupied area point location information is determined. The graph structure is formed from at least the selected point of the topological graph structure and from the associated location information of the nearest adjacent occupied area point.

Abstract: In the method for determining a relative position of a mobile unit by comparing scans of an environment, scans of an environment of the mobile unit are recorded continuously by a distance sensor and stored in a memory. Furthermore the processing unit compares a first scan with a second scan, with a relative position of the mobile unit at the time of the second scan being determined in relation to a position at the time of the first scan. The method is characterized by the fact that the processing unit compares the first scan iteratively with subsequent scans, with a new relative position of the mobile unit at the time of the relevant subsequent scan being determined relative to the position at the time of the first scan, and with the last relative position determined in each case being taken into account as a-priori information.

Abstract: When a sub-section of a predefined path temporarily cannot be traversed by an autonomous mobile unit, an extended path is found for subsequently traversing the temporarily blocked sub-section. A first path point of the predefined path is determined using at least one predefinable distance criterion, which takes into consideration the distance of the temporarily blocked sub-section from the first path point. An extension sub-section is determined which begins at the first path point, terminates at a second path point of the predefined path and encompasses at least the temporarily blocked sub-section. The extended path is programmed with the extension sub-section being integrated into the predefined path at the first path point.

Abstract: In the method for determining a relative position of a mobile unit by comparing scans of an environment, scans of an environment of the mobile unit are recorded continuously by a distance sensor and stored in a memory. Furthermore the processing unit compares a first scan with a second scan, with a relative position of the mobile unit at the time of the second scan being determined in relation to a position at the time of the first scan. The method is characterized by the fact that the processing unit compares the first scan iteratively with subsequent scans, with a new relative position of the mobile unit at the time of the relevant subsequent scan being determined relative to the position at the time of the first scan, and with the last relative position determined in each case being taken into account as a-priori information.

Abstract: A graph structure is generated to describe an area with a free area and an occupied area. In this case a topological graph structure for the free area is determined. A point of the topological graph structure is selected and for this a nearest adjacent occupied area point is determined. For this nearest adjacent occupied area point location information is determined. The graph structure is formed from at least the selected point of the topological graph structure and from the associated location information of the nearest adjacent occupied area point.

Abstract: When a sub-section of a predefined path temporarily cannot be traversed by an autonomous mobile unit, an extended path is found for subsequently traversing the temporarily blocked sub-section. A first path point of the predefined path is determined using at least one predefinable distance criterion, which takes into consideration the distance of the temporarily blocked sub-section from the first path point. An extension sub-section is determined which begins at the first path point, terminates at a second path point of the predefined path and encompasses at least the temporarily blocked sub-section. The extended path is programmed with the extension sub-section being integrated into the predefined path at the first path point.

Abstract: In a path planning method is disclosed for surface processing machines such as, for example, cleaning machines in a supermarket first, potential sub-paths are produced that, proceeding from boundary lines of obstacles or the work area parallel to these boundary lines shifted by the width of the processing device are erected in the form of concentric circles. These potential sub-paths are then sub-divided by maneuvering marks according to an heuristics, for example on the basis of the maneuverability of the mobile unit, and are connected to one another by sub-paths. The respective sub-paths are subsequently evaluated with a cost function that considers the distances, the area already covered, and the maneuverability of the unit, and the most cost-beneficial path is combined to form a planned path for the mobile unit.