Warehouse Path Planning Using Landmarks and Matrix Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing path planning methods for unmanned devices in warehouses are inefficient and do not effectively optimize the routing of unmanned devices, such as drones and vehicles, leading to suboptimal production efficiency.

Innovation Solution

A path planning method that determines the coordinates of landmarks and products in a two-dimensional matrix map, calculates route distances based on landmark positions, and selects an optimal path by considering the proximity of landmarks to main lanes, allowing for efficient travel path planning.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If complex path planning algorithms are used to optimize routing, then production efficiency is improved, but device complexity and calculation requirements increase

Engineering Contradiction:
Improveproduction efficiencyVSAvoidhardware complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent divides the warehouse into a two-dimensional matrix map with discrete grid cells, where each cell represents a specific location. This segmentation transforms the continuous path planning problem into a discrete grid-based problem, simplifying calculations while maintaining routing optimization capabilities. The matrix structure allows efficient computation of distances and paths without requiring complex continuous mathematical models.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a landmark system as an intermediary between the unmanned device and the warehouse environment. Landmarks are placed at key locations (shelf ends, lane intersections) and serve as reference points for position determination and path calculation. This intermediary structure simplifies the path planning process by providing predetermined navigation points that reduce computational complexity while maintaining routing efficiency.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Measurement precision

If detailed landmark information is collected and processed, then routing accuracy is improved, but calculation time and processing requirements increase

Engineering Contradiction:
Improverouting accuracyVSAvoidcalculation time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs preliminary actions by pre-establishing the two-dimensional matrix map structure and pre-positioning landmarks at key warehouse locations before the unmanned device begins operation. The matrix map is pre-configured with grid cells representing warehouse locations, and landmarks are placed at predetermined positions (shelf ends, lane intersections). This preliminary setup eliminates the need for real-time complex calculations during actual path planning, as the framework is already in place.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a simplified two-dimensional matrix map copy of the physical warehouse environment. This virtual map replicates the essential spatial relationships and landmarks without requiring processing of all detailed environmental information. The matrix representation captures the necessary geometric and topological features for accurate routing while significantly reducing data processing requirements compared to using full three-dimensional or detailed sensor data.

Inventive Principle:
Principle #26Copying

Data Source

PatentEP3828789B1Method and device for planning path of unmanned device
Publication Date: 2026.02.25 BEIJING JINGDONG SHANGKE INFORMATION TECH CO LTD
  • EP3828789B1 patent drawingFigure 1
  • EP3828789B1 patent drawingFigure 2
  • EP3828789B1 patent drawingFigure 3

AI summary

The present disclosure provides a path planning method and device for an unmanned device. The method includes: taking a current landmark as a current node, obtaining a landmark corresponding to a product to be picked with a route closest to the current node, and taking the obtained landmark as the current node(120), wherein an initial value of the current node is an initial landmark of the unmanned device; determining whether the current node is a landmark corresponding to the last product to be picked(130); if no, performing the step(120) of obtaining a landmark corresponding to a product to be picked with a route closest to the current node; and if yes, taking a route composed of the initial landmark of the unmanned device and landmarks corresponding to products to be picked that are selected sequentially as a travel route of the unmanned device(140).