Robot Path Planning with Corner-Cutting Obstacle Bypass

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing robot path planning technologies are inefficient in reducing distance and time due to sharp turns and transitions, and fail to effectively avoid obstacles in complex environments.

Innovation Solution

A corner-cutting technique that iteratively identifies and removes sharpest changes in direction along a path, substituting them with shorter bypass segments, ensuring the optimized path avoids obstacles and meets predetermined angle thresholds, using straight-line segments for high computational efficiency and applying smoothing techniques for curved paths.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional path planning methods are used, then the robot can reach the destination, but the path contains sharp turns and transitions that increase distance and time

Engineering Contradiction:
Improvepath efficiencyVSAvoidtravel time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The path is segmented into multiple straight-line segments connected at vertices. The corner-cutting technique further segments the path by inserting additional vertices along existing segments, creating smaller sub-segments that collectively form a smoother, more efficient trajectory while maintaining the overall path structure.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The optimization operates in the dimensional space of path geometry by adjusting vertex positions and angles. The corner-cutting process modifies the path in the angular dimension by ensuring all vertices meet the minimum angle threshold, transforming sharp corners into gentler transitions that reduce travel distance and time.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Productivity

If corner-cutting optimization is applied, then path efficiency improves, but the computational complexity increases

Engineering Contradiction:
Improvepath efficiencyVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The algorithm performs preliminary corner-cutting optimizations during the path planning phase before the robot executes the path. By pre-optimizing the path geometry and removing sharp corners in advance, the system achieves efficient paths without adding computational burden during real-time robot operation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The corner-cutting process applies partial optimization by focusing only on vertices that violate the minimum angle threshold. Rather than reoptimizing the entire path, the algorithm selectively modifies only the necessary portions, reducing computational complexity while still achieving significant path efficiency improvements.

Inventive Principle:
Principle #16Partial or excessive action

3Stability of the object's composition

If sharp turns are removed from the path, then path smoothness improves, but the path length may increase

Engineering Contradiction:
Improvepath smoothnessVSAvoidpath length
Core Design Contradiction:
Stability of the object's compositionVSLength of moving object

Solution Approach 1:

The corner-cutting technique replaces sharp angular transitions with curved-like transitions by inserting intermediate vertices that create gentler angle changes. This geometric transformation smooths the path trajectory, making it more suitable for robotic motion while the iterative optimization ensures the overall path length remains efficient.

Inventive Principle:
Principle #14Spheroidality (Curvature)

Solution Approach 2:

The algorithm changes the geometric parameters of path vertices by adjusting their positions and the angles between connected segments. By modifying vertex coordinates to satisfy minimum angle constraints, the path transitions from sharp, angular geometry to smoother geometry with reduced total length through iterative optimization.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11254003B1Enhanced robot path planning
Publication Date: 2022.02.22 INTRINSIC INNOVATION LLC
  • US11254003B1 patent drawing
  • US11254003B1 patent drawing
  • US11254003B1 patent drawing

AI summary

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for enhanced path planning. In some implementations, a first path is determined for travel by a robot, the first path extending from an origin to a destination. Path segments are determined based on the first path. A corner between two of the path segments has an angle less than a predetermined threshold is determined. In response to determining that the corner between two of the path segments has an angle less than the predetermined threshold, a bypass path segment is determined that bypasses the corner. A second path for the robot to travel is determined based on the path segments and the bypass path segment. Data indicating the second path is provided to the robot.