Abstract: A computer-implemented method and a system for generating a path for a vehicle from a source to a target within a two-dimensional (2D) environment with one or more obstacles is disclosed. The obstacles may be dynamic, static or both. The method comprises generating, in a two dimensions-plus-time space, a velocity cone that represents a set of potential waypoints reachable from a first source for the vehicle moving at a speed, providing a polytope, obtaining at least one interception polygon by intersecting and projecting the velocity cone with the polytope on the 2D region; generating a 2D scene comprising interception polygons to avoid, computing a visibility graph algorithm for the 2D scene and obtaining a plurality of conflict-free sub-paths, and composing a valid path connecting the source to the target based on the plurality of conflict-free sub-paths.

Abstract: A computer-implemented method and a system for generating a path for a vehicle from a source to a target within a two-dimensional (2D) environment with one or more obstacles is disclosed. The obstacles may be dynamic, static or both. The method comprises generating, in a two dimensions-plus-time space, a velocity cone that represents a set of potential waypoints reachable from a first source for the vehicle moving at a speed, providing a polytope, obtaining at least one interception polygon by intersecting and projecting the velocity cone with the polytope on the 2D region; generating a 2D scene comprising interception polygons to avoid, computing a visibility graph algorithm for the 2D scene and obtaining a plurality of conflict-free sub-paths, and composing a valid path connecting the source to the target based on the plurality of conflict-free sub-paths.

Abstract: A method and a system for guiding a vehicle from a source to a target within a scenario with obstacles are disclosed. The source is established as a starting point and a subpath to the target is computed. When an obstacle is detected that crosses the computed subpath, a plurality of obstacle-free subpaths are computed to connect the starting point to a waypoint of an outer boundary of a detected obstacle. Priorities for each waypoint are computed and ordered accordingly in a list of potential waypoints to select the highest priority waypoint in the list as a new starting point. Previous operations are repeated until the target is reached, thus the path is obtained by backtracking waypoints to the source. The vehicle can be then guided and the target reached via the obtained path.

Abstract: A method and a system for guiding a vehicle from a source to a target within a scenario with obstacles are disclosed. The source is established as a starting point and a subpath to the target is computed. When an obstacle is detected that crosses the computed subpath, a plurality of obstacle-free subpaths are computed to connect the starting point to a waypoint of an outer boundary of a detected obstacle. Priorities for each waypoint are computed and ordered accordingly in a list of potential waypoints to select the highest priority waypoint in the list as a new starting point. Previous operations are repeated until the target is reached, thus the path is obtained by backtracking waypoints to the source. The vehicle can be then guided and the target reached via the obtained path.