Local path planning method based on dynamic window method and suitable for Ackerman model robot

A technology of local path planning and dynamic window, applied in the field of robot navigation, which can solve the problems of long local paths, inability to avoid obstacles with optimal paths, and failure of robots to successfully avoid obstacles.

Active Publication Date: 2021-03-16
JIANGXI HONGDU AVIATION IND GRP
View PDF12 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] (1) If the robot starts avoiding obstacles at a position closer to the obstacle, the robot cannot successfully avoid the obstacle due to the minimum turning radius limit; Long, unable to bypass obstacles with the optimal path;
[0006] (2) At the end of obstacle avoidance, it cannot be

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Local path planning method based on dynamic window method and suitable for Ackerman model robot
  • Local path planning method based on dynamic window method and suitable for Ackerman model robot
  • Local path planning method based on dynamic window method and suitable for Ackerman model robot

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0062] In order to make the technical means, creative features, goals and effects achieved by the present invention easy to understand, the present invention will be further described below in conjunction with specific illustrations.

[0063] A local path planning method based on the dynamic window method and suitable for Ackerman model robots, the specific steps are as follows:

[0064] Step 1) Obtain the posture of the robot and the position of the obstacle according to the sensor carried by the robot itself, and create an environment model;

[0065] Step 2) Calculate the obstacle avoidance starting point S in the environment model 1 The coordinates of the local target point P 0 ,S 2 coordinates and directions;

[0066] Step 3) Considering kinematics constraints, safety allowable speed constraints, dynamics constraints and minimum turning radius constraints comprehensively, determine the final velocity space;

[0067] Step 4) segment the obstacle avoidance process of the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a local path planning method based on a dynamic window method and suitable for an Ackerman model robot. The method comprises the steps of: firstly, acquiring the posture of the robot and the position of an obstacle according to a sensor carried by the robot, then calculating the coordinates of an obstacle avoidance starting point and coordinates and direction of a local target point, and determining a final speed space; meanwhile, segmenting the obstacle avoidance process of the robot to determine evaluation functions, judging the number of segments in segmented obstacle avoidance at present, and selecting the corresponding evaluation function for processing to obtain the speed corresponding to the minimum evaluation function value to serve as the optimal speed ofrobot operation, and repeatedly executing the obtained optimal speed, judging whether the robot reaches a local target point or not according to the current position of the robot, and if so, ending obstacle avoidance; conducting local path planning according to the size and position of the obstacle, the robot speed and the minimum turning radius, and promoting the robot to move in an optimal pathon the premise that the robot can avoid the obstacle and can return to a global path in a smooth direction after obstacle avoidance is finished.

Description

technical field [0001] The invention relates to the technical field of robot navigation, in particular to a local path planning method based on a dynamic window method and suitable for an Ackerman model robot. Background technique [0002] In recent years, with the development of artificial intelligence, robots have shown excellent characteristics in high-risk, repetitive, and complex tasks. However, in order to complete specific tasks, robots can actively avoid obstacles in complex environments. However, how to quickly avoid obstacles and find the optimal path to avoid obstacles has become one of the key factors affecting its performance. [0003] Robot path planning includes global path planning and local path planning. The global path planning is to plan a safe and feasible path in a known environment. The local path planning is to plan the path according to the local environmental information after detecting the working environment of the robot through sensors. Make the...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G05D1/02
CPCG05D1/0223G05D1/0214G05D1/0221
Inventor 史小露倪琳轩齐洪豪曹雄伟陈寿辉谢训鹏裴立明
Owner JIANGXI HONGDU AVIATION IND GRP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products