Abstract: The present disclosure relates to a method for planning a path navigation, a storage medium and an electronic device in the technical field of path navigation. The method for planning the path navigation includes: planning an initial path of a sweeping robot, performing obstacle detection on each path point on the initial path within a range of a first variable neighborhood, and recording a distance between the each path point and an obstacle; segmenting the initial path according to the distance between the each path point and the obstacle; calculating a path offset of a segmented initial path to obtain an offset path; and performing smoothing processing on the offset path to obtain a final path.

Abstract: The present disclosure relates to a method and an apparatus for processing a data flow of a positioning base station, a device and a computer readable medium. The method includes: extracting, under the condition that a data packet to be processed which is sent by the positioning base station is received, a first identifier carried in the data packet to be processed; screening out a first data packet by using the first identifier, where the first data packet is a data packet to be processed including a distance from the positioning base station to a target position; extracting a second identifier carried in the first data packet, where second identifiers carried in different data packets to be processed sent by the same positioning base station vary; and determining, under the condition that time indicated by the second identifier is target time, the first data packet as a target data packets.

Abstract: A warehouse management system uses a constraint programming model and associated search algorithm for determining packing of items into minimal or otherwise moderated sets of heterogeneous bins (e.g., cartons or other types of containers). In some embodiments, a constraint solver of the warehouse management system minimizes or otherwise moderates the number of shipping containers required to package and ship a group of items. Packaging configurations may be based on multi-dimensional considerations of item properties, bin capacities, such as weight and volume capacities, ordering and grouping rules, and packaging restrictions. Given a set of items, each with a given weight and volume, and a set of containers, each with a specified weight and volume capacity, the goal is to compute carton placement for each item. Container selection may be performed such that the overall number of cartons required for packaging is minimized or otherwise moderated.

Abstract: A method and an apparatus for controlling a robot, an electronic device, and a computer-readable storage medium. The control method includes: acquiring an environmental map obtained by detecting a current environment; detecting the environmental map to acquire at least one right angle corner point in the environmental map; determining a coordinate system in which the right angle corner point is located and using the right angle corner point of which the coordinate system satisfies a preset condition as a target right angle corner point; and controlling the robot to clean the target right angle corner point.

Abstract: The present disclosure relates to a new process for construction of controlled structures on the surface of modified digital barcoded magnetic beads (BMB) with higher capacity, higher fluorescence intensity, wider dynamic range, and improved sensitivity in clinical applications.

Abstract: A cleaning method for a cleaning device includes: acquiring a grid map of a region to be cleaned; dividing a passable region in the grid map into a plurality of candidate regions; screening the plurality of candidate regions; prioritizing a plurality of screened candidate regions, and corresponding the plurality of screened candidate regions with different priorities to different cleaning parameters; and cleaning the plurality of screened candidate regions according to priority sorting, the cleaning parameters include at least one of a cleaning frequency, cleaning time, cleaning agent addition information and a cleaning mode. Adopting the cleaning method for the cleaning device effectively solves problems in that cleaning efficiency of a robot vacuum cleaner is relatively low in related technologies.

Abstract: Techniques for constraint programming-based periodic task scheduling are disclosed, including: determining a set of tasks to be scheduled across a set of shared resources, the set of tasks including multiple periodic tasks; filtering out one or more high-utilization tasks from the set of tasks to be scheduled; generating a constraint programming (CP) model based on the set of tasks, the CP model including a set of constrained variables, a set of constraints, and a search directive; applying a CP solver to the CP model, to obtain a CP solution for scheduling the set of tasks across the set of shared resources; where the CP solution assigns two or more of the periodic tasks to a same resource in the set of shared resources, based at least on the two or more periodic tasks having periods that are harmonically compatible.

Abstract: Techniques for conducting an assay for multiple analytes in a sample wherein the presence/absence of each analyte in said sample is indicated by a light signal are provided. An example method includes determining the presence of an analyte by: providing a light to the sample, wherein a light signal is emitted from the sample associated with the presence of individual analytes, capturing a plurality of images by one or more photodetectors, each including the plurality of analytes, at a plurality of durations, and for respective analytes of the plurality of analytes, determining a range of integration durations associated with a light signal associated with the presence of the analyte, identifying an image of the plurality of images, captured at a duration within the range of integration durations, and analyzing the image to determine the presence of the analyte.

Abstract: The invention relates to the technical field of agricultural planting, in particular to a special controlled-release microbial fertilizer for peanuts in a continuous cropping field and a preparation method thereof. The fabric comprises an outer layer, a middle layer and an inner layer. Through a three-layer structure, the controlled-release fertilizer prepared by the disclosure can realize the fertilizer efficiency period of 50-60 days, and achieves the purpose of twice releases.

Abstract: The present disclosure relates to a method for planning a path navigation, a storage medium and an electronic device in the technical field of path navigation. The method for planning the path navigation includes: planning an initial path of a sweeping robot, performing obstacle detection on each path point on the initial path within a range of a first variable neighborhood, and recording a distance between the each path point and an obstacle; segmenting the initial path according to the distance between the each path point and the obstacle; calculating a path offset of a segmented initial path to obtain an offset path; and performing smoothing processing on the offset path to obtain a final path.

Abstract: The invention relates to the technical field of agricultural planting, in particular to a controlled-release bacterial fertilizer for peanuts and a preparation method of the special controlled-release bacterial fertilizer. The special controlled-release bacterial fertilizer is composed of an inner layer and an outer layer; after the outer layer is released completely, the inner-layer network structure gradually absorbs water and preserves moisture, and has good slow release and controlled release properties, thereby achieving the gradual release of the inner layer, high fertilizer utilization rate, exerting the efficacy of the microbial agent and facilitating the large-area promotion.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Information about a set of maintenance tasks and time windows includes a cost value per task per time window. Based on the information, a data model generator generates a data model, including task elements; time elements; cost elements; a total cost element; a constraint that requires each task element be assigned a time window from a respective domain, such that each time element is assigned a task count from a respective domain; a constraint that requires each cost element be assigned a cost value associated with a time window assigned (or to be assigned) to a task element corresponding to the cost element; and a constraint that requires the total cost element be assigned a total cost value that is a sum of the cost values assigned (or to be assigned) to the cost elements. Based on the data model, a CP solver determines a proposed maintenance schedule.

Abstract: A method and an apparatus for controlling a robot, an electronic device, and a computer-readable storage medium. The control method includes: acquiring an environmental map obtained by detecting a current environment; detecting the environmental map to acquire at least one right angle corner point in the environmental map; determining a coordinate system in which the right angle corner point is located and using the right angle corner point of which the coordinate system satisfies a preset condition as a target right angle corner point; and controlling the robot to clean the target right angle corner point.

Abstract: The present disclosure relates to a method and an apparatus for processing a data flow of a positioning base station, a device and a computer readable medium. The method includes: extracting, under the condition that a data packet to be processed which is sent by the positioning base station is received, a first identifier carried in the data packet to be processed; screening out a first data packet by using the first identifier, where the first data packet is a data packet to be processed including a distance from the positioning base station to a target position; extracting a second identifier carried in the first data packet, where second identifiers carried in different data packets to be processed sent by the same positioning base station vary; and determining, under the condition that time indicated by the second identifier is target time, the first data packet as a target data packets.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: The invention relates to the technical field of agricultural planting, in particular to a controlled-release bacterial fertilizer for peanuts and a preparation method of the special controlled-release bacterial fertilizer. The special controlled-release bacterial fertilizer is composed of an inner layer and an outer layer; after the outer layer is released completely, the inner-layer network structure gradually absorbs water and preserves moisture, and has good slow release and controlled release properties, thereby achieving the gradual release of the inner layer, high fertilizer utilization rate, exerting the efficacy of the microbial agent and facilitating the large-area promotion.

Abstract: The invention relates to the technical field of agricultural planting, in particular to a special controlled-release microbial fertilizer for peanuts in a continuous cropping field and a preparation method thereof. The fabric comprises an outer layer, a middle layer and an inner layer. Through a three-layer structure, the controlled-release fertilizer prepared by the disclosure can realize the fertilizer efficiency period of 50-60 days, and achieves the purpose of twice releases.