Abstract: Disclosed are solutions for an autonomous vehicle to real-time detect and determine dynamic and/or obscured obstacles to support navigation and services to within a desired proximity of said obstacles. Certain such implementations are specifically directed to autonomous mowers, for example, capable of real-time object detection to determine location and orientation of solar panels in a solar farm, for example, and based on the location and orientation of such solar panels further determine the location of their corresponding posts that may be otherwise obstructed from direct detection by the autonomous mower's other sensing systems possibly due to vegetation growth around the posts or other reasons.

Abstract: An autonomous mowing system comprising: a memory configured to hold a set of path data defining a set of paths, the set of paths comprising a transit path to a maintenance area and a set of mow paths to cover the maintenance area; a processor coupled to the memory; a computer-readable medium coupled to the processor, the computer-readable medium storing a set of instructions executable by the processor, the set of instructions comprising instructions for: using the set of path data, determining a plurality of candidate routes that traverse the transit path and fully cover the maintenance area and a total cost for each of the plurality of candidate routes; determining a least cost route from the plurality of candidate routes; and configuring an autonomous mower to follow the least cost route to mow the maintenance area.

Abstract: Systems and techniques for generating a set of connected segments for a device or system to traverse in order to reach every point of the region (a coverage plan). Nodes defining the region to be traversed define a polygon. The polygon is decomposed into a mesh and a graph of the mesh is generated. The graph may be used to determine a longest funneled path which, in turn, may be used to either optimize for a longest path or to divide the polygon for eroding sides. The longest path and/or erosions are used to define a set of segments. The segments are connected, which in some examples is done via an optimization to minimize an amount of time or energy to traverse all segments and connections. The resultant coverage plan is sent to a system configured to receive the plan and traverse the region.

Abstract: Systems and techniques for generating a set of connected segments for a device or system to traverse in order to reach every point of the region (a coverage plan). Nodes defining the region to be traversed define a polygon. The polygon is decomposed into a mesh and a graph of the mesh is generated. The graph may be used to determine a longest funneled path which, in turn, may be used to either optimize for a longest path or to divide the polygon for eroding sides. The longest path and/or erosions are used to define a set of segments. The segments are connected, which in some examples is done via an optimization to minimize an amount of time or energy to traverse all segments and connections. The resultant coverage plan is sent to a system configured to receive the plan and traverse the region.

Abstract: Systems and techniques for generating a set of connected segments for a device or system to traverse in order to reach every point of the region (a coverage plan). Nodes defining the region to be traversed define a polygon. The polygon is decomposed into a mesh and a graph of the mesh is generated. The graph may be used to determine a longest funneled path which, in turn, may be used to either optimize for a longest path or to divide the polygon for eroding sides. The longest path and/or erosions are used to define a set of segments. The segments are connected, which in some examples is done via an optimization to minimize an amount of time or energy to traverse all segments and connections. The resultant coverage plan is sent to a system configured to receive the plan and traverse the region.

Abstract: An autonomous mowing system comprising: a memory configured to hold a set of path data defining a set of paths, the set of paths comprising a transit path to a maintenance area and a set of mow paths to cover the maintenance area; a processor coupled to the memory; a computer-readable medium coupled to the processor, the computer-readable medium storing a set of instructions executable by the processor, the set of instructions comprising instructions for: using the set of path data, determining a plurality of candidate routes that traverse the transit path and fully cover the maintenance area and a total cost for each of the plurality of candidate routes; determining a least cost route from the plurality of candidate routes; and configuring an autonomous mower to follow the least cost route to mow the maintenance area