Abstract: A method for controlling a sensor subsystem, the method including receiving one or more metrics representing one or more characteristics of livestock, including one or more livestock objects, contained in an enclosure and monitored by one or more sensors coupled to a winch subsystem. The method further includes determining a position to move the one or more sensors based on the metrics and determining an instruction that includes information related to a movement of the one or more sensors. The method further includes sending the instruction to the winch subsystem to change the position of the one or more sensors.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for controlling a camera to observe aquaculture feeding behavior. In some implementations, a method includes moving a camera to a first position, obtaining an image captured by the camera at the first position, determining a feeding observation mode, and based on the feeding observation mode and analysis of the image, determining a second position to move the camera.

Abstract: A method for controlling a sensor subsystem, the method including receiving one or more metrics representing one or more characteristics of livestock, including one or more livestock objects, contained in an enclosure and monitored by one or more sensors coupled to a winch subsystem. The method further includes determining a position to move the one or more sensors based on the metrics and determining an instruction that includes information related to a movement of the one or more sensors. The method further includes sending the instruction to the winch subsystem to change the position of the one or more sensors.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for controlling a camera to observe aquaculture feeding behavior. In some implementations, a method includes moving a camera to a first position, obtaining an image captured by the camera at the first position, determining a feeding observation mode, and based on the feeding observation mode and analysis of the image, determining a second position to move the camera.

Abstract: Apparatus and methods related to routing robots are provided. A roadmap of an environment that includes first and second robots can be received. The roadmap can be annotated with unidirectional lanes connecting conflict regions, where each lane ends so to avoid blocking a conflict region. First and second routes for the respective uses of the first and second robots can be determined, where both the first and second routes include a first lane connected to a first conflict region. A first, higher priority and a second, lower priority can be assigned to the respective first and second robots. It can be determined that the second robot following the second route will block the first robot on the first lane. Based on the first priority being higher than the second priority, the computing device can alter the second route to prevent the second robot from blocking the first robot.

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for controlling a camera to observe aquaculture feeding behavior. In some implementations, a method includes moving a camera to a first position, obtaining an image captured by the camera at the first position, determining a feeding observation mode, and based on the feeding observation mode and analysis of the image, determining a second position to move the camera.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for controlling a camera to observe aquaculture feeding behavior. In some implementations, a method includes moving a camera to a first position, obtaining an image captured by the camera at the first position, determining a feeding observation mode, and based on the feeding observation mode and analysis of the image, determining a second position to move the camera.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for controlling a camera to observe aquaculture feeding behavior. In some implementations, a method includes moving a camera to a first position, obtaining an image captured by the camera at the first position, determining a feeding observation mode, and based on the feeding observation mode and analysis of the image, determining a second position to move the camera.

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Abstract: A method for controlling a sensor subsystem, the method including receiving one or more metrics representing one or more characteristics of livestock, including one or more livestock objects, contained in an enclosure and monitored by one or more sensors coupled to a winch subsystem. The method further includes determining a position to move the one or more sensors based on the metrics and determining an instruction that includes information related to a movement of the one or more sensors. The method further includes sending the instruction to the winch subsystem to change the position of the one or more sensors.

Abstract: A method for controlling a sensor subsystem, the method including receiving one or more metrics representing one or more characteristics of livestock, including one or more livestock objects, contained in an enclosure and monitored by one or more sensors coupled to a winch subsystem. The method further includes determining a position to move the one or more sensors based on the metrics and determining an instruction that includes information related to a movement of the one or more sensors. The method further includes sending the instruction to the winch subsystem to change the position of the one or more sensors.

Abstract: A method for controlling a sensor subsystem, the method including receiving one or more metrics representing one or more characteristics of livestock, including one or more livestock objects, contained in an enclosure and monitored by one or more sensors coupled to a winch subsystem. The method further includes determining a position to move the one or more sensors based on the metrics and determining an instruction that includes information related to a movement of the one or more sensors. The method further includes sending the instruction to the winch subsystem to change the position of the one or more sensors.

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Abstract: Systems and methods related to roadmaps for mobile robots are provided. A computing device can determine a roadmap of an environment. The roadmap can include lanes and a designated region that is adjacent to a first lane of the plurality of lanes and suitable for robotic traversal when unoccupied. The computing device can determine a first route between first and second points in the environment that uses the first lane. The computing device can send a direction to use the first route to a first robot. The computing device can receive, from the first robot, sensor data indicative of an occupied status of the designated region. The computing device can determine a second route between the first and second points through the designated region based on the occupied status of the designated region. The computing device can send a direction to use the second route to a second robot.

Abstract: Apparatus and methods related to routing robots are provided. A roadmap of an environment that includes first and second robots can be received. The roadmap can be annotated with unidirectional lanes connecting conflict regions, where each lane ends so to avoid blocking a conflict region. First and second routes for the respective uses of the first and second robots can be determined, where both the first and second routes include a first lane connected to a first conflict region. A first, higher priority and a second, lower priority can be assigned to the respective first and second robots. It can be determined that the second robot following the second route will block the first robot on the first lane. Based on the first priority being higher than the second priority, the computing device can alter the second route to prevent the second robot from blocking the first robot.

Abstract: Apparatus and methods related to routing robots are provided. A roadmap of an environment that includes first and second robots can be received. The roadmap can be annotated with unidirectional lanes connecting conflict regions, where each lane ends so to avoid blocking a conflict region. First and second routes for the respective uses of the first and second robots can be determined, where both the first and second routes include a first lane connected to a first conflict region. A first, higher priority and a second, lower priority can be assigned to the respective first and second robots. It can be determined that the second robot following the second route will block the first robot on the first lane. Based on the first priority being higher than the second priority, the computing device can alter the second route to prevent the second robot from blocking the first robot.

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Abstract: Systems and methods related to roadmaps for mobile robots are provided. A computing device can determine a roadmap of an environment. The roadmap can include lanes and a designated region that is adjacent to a first lane of the plurality of lanes and suitable for robotic traversal when unoccupied. The computing device can determine a first route between first and second points in the environment that uses the first lane. The computing device can send a direction to use the first route to a first robot. The computing device can receive, from the first robot, sensor data indicative of an occupied status of the designated region. The computing device can determine a second route between the first and second points through the designated region based on the occupied status of the designated region. The computing device can send a direction to use the second route to a second robot.

Abstract: This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.