Path planning method for mobile robots
A path planning method is provided for mobile robots, including the following steps: Step 1. Searching for available paths according to the destinations of moving of the robots and the nodes properties on the map; Step 2. Determining the optimum path, according to the weights of the segments on all...
Saved in:
Main Authors | , , , , , , , |
---|---|
Format | Patent |
Language | English |
Published |
04.06.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A path planning method is provided for mobile robots, including the following steps: Step 1. Searching for available paths according to the destinations of moving of the robots and the nodes properties on the map; Step 2. Determining the optimum path, according to the weights of the segments on all the available paths, with the segments being arbitrary curves made up of Bezier curves or splined curves of a plurality of control points; and Step 3. Driving the robots to move along the optimum path, and to stop at the stop points. The present path planning method for mobile robots increases the ways of connection between the nodes significantly and avoids that there is only a single way of connection between two nodes. |
---|---|
Bibliography: | Application Number: US201615305507 |