Abstract: Methods and systems for autonomous generation of shortest lateral paths for unmanned aerial systems are described. An example system includes memory storing code and at least one processor to execute the code to cause the at least one processor to access an initial scenario including a source point, a target point, and a no flight zone, determine a computation time for identifying a lateral path for an aircraft to traverse that avoids the no flight zone, determine whether the determined computation time satisfies a threshold of a reference computation time, change the first number of vertices to a second number of vertices when the reference computation time is not satisfied, determine a buffer area surrounding the no flight zone, construct a visibility graph including lateral paths, and identify one of the lateral paths as being shorter than others of the lateral paths.

Abstract: Methods and systems for autonomous generation of shortest lateral paths for unmanned aerial systems are described. An example system includes memory storing code and at least one processor to execute the code to cause the at least one processor to access an initial scenario including a source point, a target point, and a no flight zone, determine a computation time for identifying a lateral path for an aircraft to traverse that avoids the no flight zone, determine whether the determined computation time satisfies a threshold of a reference computation time, change the first number of vertices to a second number of vertices when the reference computation time is not satisfied, determine a buffer area surrounding the no flight zone, construct a visibility graph including lateral paths, and identify one of the lateral paths as being shorter than others of the lateral paths.

Abstract: Methods and systems for autonomous generation of shortest lateral paths for unmanned aerial systems are described. An example method includes defining an area between a source point and a target point; identifying a first no flight zone within the area; identifying a second no flight zone outside of the area; estimating a first computation time to determine a first lateral path between the source point and the target point, the estimating to consider the first no flight zone, the estimating not to consider the second no flight zone; comparing the first computation time to a reference computation time; in response to the first computation time not satisfying a threshold of the reference computation time, modifying the first no flight zone to be a third no flight zone; and estimating a second computation time to determine a second lateral path between the source point and the target point, the estimating to consider the third no flight zone.

Abstract: Methods and systems for autonomous generation of shortest lateral paths for unmanned aerial systems are described. An example method includes defining an area between a source point and a target point; identifying a first no flight zone within the area; identifying a second no flight zone outside of the area; estimating a first computation time to determine a first lateral path between the source point and the target point, the estimating to consider the first no flight zone, the estimating not to consider the second no flight zone; comparing the first computation time to a reference computation time; in response to the first computation time not satisfying a threshold of the reference computation time, modifying the first no flight zone to be a third no flight zone; and estimating a second computation time to determine a second lateral path between the source point and the target point, the estimating to consider the third no flight zone.