Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Robot walking path scheduling management method

A dispatch management and robot technology, applied in vehicle position/route/altitude control, instruments, control/regulation systems, etc., can solve the problems of low patrol safety and low patrol efficiency, and achieve the goal of improving patrol efficiency, ensuring safety, realizing The effect of route scheduling management

Pending Publication Date: 2021-06-22
元通智能技术(南京)有限公司
View PDF2 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] Aiming at the low safety and low patrol efficiency of robot patrols in the prior art, a scheduling management method for robot walking paths is provided, which can efficiently realize obstacle avoidance operations for dynamic obstacles while ensuring the safety of robots , and then efficiently realize the path scheduling management of the robot, and further improve the patrol efficiency of the robot

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
  • Robot walking path scheduling management method
  • Robot walking path scheduling management method
  • Robot walking path scheduling management method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] combine figure 1 As shown, a scheduling management method of a robot walking path of the present invention comprises the following steps:

[0039]1) Divide the area

[0040] Obtain space scene information, and divide the space into safe area, non-safe area and forbidden area according to the space scene information; it is worth noting that the safe area is used for robots to patrol, and the non-safe area is used for robots to bypass obstacles. And the robot is prohibited from moving in the forbidden zone.

[0041] 2) Generate patrol path

[0042] A patrol path is generated according to the safety area, specifically, a patrol path is generated in the safety area according to the patrol purpose. Then the robot moves according to the patrol path, that is, the robot patrols in the safe area, so that the patrol purpose can be realized under the condition of ensuring safety.

[0043] 3) Obstacle bypass

example 1

[0044] When the robot encounters an obstacle while moving on the patrol path, the robot generates a temporary path in the safe area and / or non-safe area, and the robot moves according to the temporary path, so that the obstacle can be bypassed. It is worth noting that if The robot bypasses the obstacle according to the temporary path, then the robot continues to move according to the patrol path until it reaches the end of the patrol path, and then the robot moves to the rest area and ends the patrol task; if the robot cannot bypass the obstacle according to the temporary path, the remaining The patrol path is set as an obstacle section, and the robot moves to the rest area and ends the patrol mission. The following is an example of obstacle circumvention. In this example, the robot first obtains judgment information and then moves accordingly. Specifically, follow the steps below to realize obstacle circumvention:

[0045] Step 1: When the robot goes around the obstacle and h...

example 2

[0051] It is worth noting that the shortest detour paths generated in the above steps are all temporary paths, and the example of the above steps is aimed at the scene where the robot makes a logical judgment based on the spatial scene information and then moves accordingly. The present invention is not limited thereto. When the robot of the present invention encounters an obstacle, it can make corresponding judgments during the moving process. The second example of the obstacle circumvention method is given below, and the specific steps are as follows:

[0052] Step 1: When the robot must leave the path when it is going around obstacles, set the position of leaving the path as point a, and judge whether the robot can take a point on the path in front of point a along the forward direction and within the patrol accuracy, It is worth noting that the patrol accuracy of the present invention is set to n centimeters, that is, it is judged whether the robot can calibrate and obtain ...

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 discloses a robot walking path scheduling management method, which belongs to the technical field of robot scheduling management and comprises the following steps: acquiring space scene information and dividing a space into a safe area, a non-safe area and a forbidden area; a patrol path is generated according to the safe area, the robot moves according to the patrol path, and when the robot encounters an obstacle, the robot generates a temporary path in the safe area and / or the non-safe area; if the robot bypasses the obstacle according to the temporary path, the robot continues to move to the terminal point according to the patrol path, and then the robot moves to the rest area and ends the patrol task; and if the robot cannot bypass the obstacle, the remaining patrol path is set as an obstacle road section, and the robot moves to the rest area and finishes the patrol task. Aiming at the defects of low patrol safety and patrol efficiency of the robot in the prior art, the obstacle avoidance operation of the dynamic obstacle can be efficiently realized under the condition of ensuring the safety of the robot, and the patrol efficiency of the robot is further improved.

Description

technical field [0001] The invention belongs to the technical field of robot scheduling management, and more specifically relates to a scheduling management method of a robot walking path. Background technique [0002] With the rapid development of new-generation information technologies such as artificial intelligence, big data, and cloud computing, a new-generation information infrastructure that is high-speed, mobile, secure, and ubiquitous has been further improved and constructed, gradually forming a network of interconnection of everything, human-computer interaction, and integration of heaven and earth. Space provides a rich imagination space for the popularization and application of robots in various service scenarios such as patrolling, security, and transportation, improves the efficiency, intelligence, informatization, and standardization of services, and greatly saves human resource costs. In particular, in the unmanned patrol application scenario of a flat garag...

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/0214G05D1/0221G05D1/0276
Inventor 秦旭彦马洪张乐唐皓牛硕
Owner 元通智能技术(南京)有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com