CN105320134A - Path planning method for robot to independently build indoor map - Google Patents

Path planning method for robot to independently build indoor map Download PDF

Info

Publication number
CN105320134A
CN105320134A CN201510701063.4A CN201510701063A CN105320134A CN 105320134 A CN105320134 A CN 105320134A CN 201510701063 A CN201510701063 A CN 201510701063A CN 105320134 A CN105320134 A CN 105320134A
Authority
CN
China
Prior art keywords
node
composition
path
path planning
robot
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201510701063.4A
Other languages
Chinese (zh)
Inventor
杜元源
曾碧
林伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Leiyang Intelligent Technology Co Ltd
Guangdong University of Technology
Original Assignee
Guangdong Leiyang Intelligent Technology Co Ltd
Guangdong University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Leiyang Intelligent Technology Co Ltd, Guangdong University of Technology filed Critical Guangdong Leiyang Intelligent Technology Co Ltd
Priority to CN201510701063.4A priority Critical patent/CN105320134A/en
Publication of CN105320134A publication Critical patent/CN105320134A/en
Pending legal-status Critical Current

Links

Abstract

The invention discloses a path planning method for a robot to independently build an indoor map, comprising: step 1, initialization; step 2, employing a laser radar to collect data and perform SLAM; step 3, employing a static boustrophedon mode to decide a next quasi-composition node; step4, after deciding the next quasi-composition node, entering a local dynamic priority mode to determine a next composition node; step 5, deciding the next composition, and then utilizing an A * algorithm to plan the path to the next composition node; step 6, according to a planned path, a robot moving to the next composition point; step 7, utilizing a ''blind alley'' escape strategy to search for an escape node in the composition path; step 8, after finding an escape target, utilizing the A * algorithm to plan an escape path; and step 9, completing composition and finishing path planning. The path planning method is concise and visual, has a changeable resolution, and is easy to create and store.

Description

A kind of path planning of robot autonomous structure indoor map
Technical field
The present invention relates to robotics, particularly relate to a kind of path planning algorithm of robot autonomous structure indoor map.
Background technology
The map describing method that current mobile robot commonly uses has four kinds: grating map, topological map, directly characterization method and geometric properties map, because robot is not too responsive to measured barrier particular location, one need be researched and developed there is succinct, resolution changable, the easily feature such as establishment and storage directly perceived, be applicable to the path planning of the foundation of indoor environment path planning cartographic model.
Summary of the invention
The object of the invention is to the path planning that a kind of robot autonomous structure indoor map is provided for the deficiencies in the prior art, this path planning is directly perceived succinct, resolution changable, easily create and store.
For achieving the above object, the present invention is achieved through the following technical solutions.
A path planning for robot autonomous structure indoor map, comprises the steps:
Step 1: initialization;
Step 2: adopt laser radar image data and SLAM to build map;
Step 3: adopt static ox to plough the next accurate composition node of mode decision;
Step 4: decision-making goes out next accurate composition node, then enter local dynamic station priority mode and determine next composition node;
Step 5: decision-making goes out next composition node, then utilize A* algorithmic rule to go out path to next composition node;
Step 6: according to the path cooked up, robot motion is to next composition point;
Step 7: use " blind alley " to flee from tactful searching in composition path and flee from node;
Step 8: after finding and fleeing from target, then utilize A* algorithmic rule to flee from path;
Step 9: composition completes, path planning terminates.
Wherein, described static ox is ploughed the formula of pattern and is .
Wherein, the formula of described A* algorithm is , wherein refer to that start node S moves to the consumption figures of node; refer to the consumption figures that joint movements is estimated to destination node G; refer to the estimated value of the minimal cost path arriving destination node from starting point node through node.
Beneficial effect of the present invention is: the path planning of a kind of robot autonomous structure indoor map of the present invention, comprises the steps: step 1: initialization; Step 2: adopt laser radar image data and SLAM to build map; Step 3: adopt static ox to plough the next accurate composition node of mode decision; Step 4: decision-making goes out next accurate composition node, then enter local dynamic station priority mode and determine next composition node; Step 5: decision-making goes out next composition node, then utilize A* algorithmic rule to go out path to next composition node; Step 6: according to the path cooked up, robot motion is to next composition point; Step 7: use " blind alley " to flee from tactful searching in composition path and flee from node; Step 8: after finding and fleeing from target, then utilize A* algorithmic rule to flee from path; Step 9: composition completes, path planning terminates, and the present invention has succinct, resolution changable, the easy advantage creating and store directly perceived.
Accompanying drawing explanation
Utilize accompanying drawing to be further detailed the present invention below, but the embodiment in accompanying drawing does not form any limitation of the invention.
Fig. 1 is path planning algorithm flow process of the present invention.
Embodiment
Below in conjunction with concrete embodiment, the present invention will be described.
As shown in Figure 1, a kind of path planning of robot autonomous structure indoor map, comprises the steps:
Step 1: initialization;
Step 2: adopt laser radar image data and SLAM to build map;
Step 3: adopt static ox to plough the next accurate composition node of mode decision;
Step 4: decision-making goes out next accurate composition node, then enter local dynamic station priority mode and determine next composition node;
Step 5: decision-making goes out next composition node, then utilize A* algorithmic rule to go out path to next composition node;
Step 6: according to the path cooked up, robot motion is to next composition point;
Step 7: use " blind alley " to flee from tactful searching in composition path and flee from node;
Step 8: after finding and fleeing from target, then utilize A* algorithmic rule to flee from path;
Step 9: composition completes, path planning terminates.
Further, described static ox is ploughed the formula of pattern and is .
Further, the formula of described A* algorithm is , wherein refer to that start node S moves to the consumption figures of node; refer to the consumption figures that joint movements is estimated to destination node G; refer to the estimated value of the minimal cost path arriving destination node from starting point node through node.
Need further explain, the present invention adopts Grid Method to describe, and there are eight working direction in robot, assuming that the distance walking direct bearing is , then the distance walking oblique orientation is , getting approximate value is 14, being then expressed as follows of cost function: , ; In formula, represent the consumption figures of father node to destination node S of node; represent that node is to its father node consumption figures; method of estimation have a lot, be that manhatton distance is estimated, Euclidean distance is estimated in the method that grating map is conventional, used herein is that manhatton distance is estimated, have ignored diagonal distance, is specifically expressed as follows:
, wherein: with the coordinate of representation node, with represent the coordinate of destination node G; " blind alley " flees from strategy: robot is when composition path planning, can with the data structure storage composition node path of storehouse, when robot enters " blind alley ", grid beyond composition node rolling window can be searched for one by one with the strategy of " first-in last-out ", find out the node that can flee from.
Above content is only preferred embodiment of the present invention, and for those of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, this description should not be construed as limitation of the present invention.

Claims (3)

1. a path planning for robot autonomous structure indoor map, is characterized in that, comprise the steps:
Step 1: initialization;
Step 2: adopt laser radar image data and SLAM to build map;
Step 3: adopt static ox to plough the next accurate composition node of mode decision;
Step 4: decision-making goes out next accurate composition node, then enter local dynamic station priority mode and determine next composition node;
Step 5: decision-making goes out next composition node, then utilize A* algorithmic rule to go out path to next composition node;
Step 6: according to the path cooked up, robot motion is to next composition point;
Step 7: use " blind alley " to flee from tactful searching in composition path and flee from node;
Step 8: after finding and fleeing from target, then utilize A* algorithmic rule to flee from path;
Step 9: composition completes, path planning terminates.
2. the path planning of a kind of robot autonomous structure indoor map according to claim 1, is characterized in that: the formula that described static ox ploughs pattern is .
3. the path planning of a kind of robot autonomous structure indoor map according to claim 1, is characterized in that: the formula of described A* algorithm is , wherein refer to that start node S moves to the consumption figures of node; refer to the consumption figures that joint movements is estimated to destination node G; refer to the estimated value of the minimal cost path arriving destination node from starting point node through node.
CN201510701063.4A 2015-10-26 2015-10-26 Path planning method for robot to independently build indoor map Pending CN105320134A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510701063.4A CN105320134A (en) 2015-10-26 2015-10-26 Path planning method for robot to independently build indoor map

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510701063.4A CN105320134A (en) 2015-10-26 2015-10-26 Path planning method for robot to independently build indoor map

Publications (1)

Publication Number Publication Date
CN105320134A true CN105320134A (en) 2016-02-10

Family

ID=55247713

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510701063.4A Pending CN105320134A (en) 2015-10-26 2015-10-26 Path planning method for robot to independently build indoor map

Country Status (1)

Country Link
CN (1) CN105320134A (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106197421A (en) * 2016-06-24 2016-12-07 北京工业大学 A kind of forward position impact point for moving robot autonomous exploration generates method
CN106647769A (en) * 2017-01-19 2017-05-10 厦门大学 AGV path tracking and obstacle avoiding coordination method based on A* extraction guide point
CN107247463A (en) * 2017-06-08 2017-10-13 广东容祺智能科技有限公司 A kind of unmanned aerial vehicle station system for supporting self-defined map to access
CN108469814A (en) * 2018-02-08 2018-08-31 广东雷洋智能科技股份有限公司 Path cruise method applied to home-services robot
CN108663063A (en) * 2018-05-09 2018-10-16 宁波拓邦智能控制有限公司 Overlay path planing method, device, equipment, computer installation and storage medium
CN108709562A (en) * 2018-04-28 2018-10-26 北京机械设备研究所 A kind of mobile robot rolling grating map construction method
CN108981710A (en) * 2018-08-07 2018-12-11 北京邮电大学 A kind of complete coverage path planning method of mobile robot
CN109085836A (en) * 2018-08-29 2018-12-25 深圳市浦硕科技有限公司 A kind of method that sweeping robot returns designated position minimal path
CN109947114A (en) * 2019-04-12 2019-06-28 南京华捷艾米软件科技有限公司 Robot complete coverage path planning method, device and equipment based on grating map
CN112486182A (en) * 2020-12-08 2021-03-12 南通大学 Sweeping robot for realizing construction of unknown environment map and path planning and use method thereof
CN113534820A (en) * 2021-09-14 2021-10-22 深圳市元鼎智能创新有限公司 Method and device for motion obstacle avoidance and route control of sweeping robot and sweeping robot

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090055020A1 (en) * 2007-06-28 2009-02-26 Samsung Electronics Co., Ltd. Apparatus, method and medium for simultaneously performing cleaning and creation of map for mobile robot
US20120143372A1 (en) * 2010-12-06 2012-06-07 Samsung Electronics Co., Ltd. Robot and method for planning path of the same
CN102520718A (en) * 2011-12-02 2012-06-27 上海大学 Physical modeling-based robot obstacle avoidance path planning method
CN102890507A (en) * 2011-07-21 2013-01-23 鸿奇机器人股份有限公司 Self-walking robot, cleaning robot and positioning method thereof
CN103439972A (en) * 2013-08-06 2013-12-11 重庆邮电大学 Path planning method of moving robot under dynamic and complicated environment
CN103605368A (en) * 2013-12-04 2014-02-26 苏州大学张家港工业技术研究院 Method and device for route programming in dynamic unknown environment
CN104950883A (en) * 2015-05-14 2015-09-30 西安电子科技大学 Mobile robot route planning method based on distance grid map

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090055020A1 (en) * 2007-06-28 2009-02-26 Samsung Electronics Co., Ltd. Apparatus, method and medium for simultaneously performing cleaning and creation of map for mobile robot
US20120143372A1 (en) * 2010-12-06 2012-06-07 Samsung Electronics Co., Ltd. Robot and method for planning path of the same
CN102890507A (en) * 2011-07-21 2013-01-23 鸿奇机器人股份有限公司 Self-walking robot, cleaning robot and positioning method thereof
CN102520718A (en) * 2011-12-02 2012-06-27 上海大学 Physical modeling-based robot obstacle avoidance path planning method
CN103439972A (en) * 2013-08-06 2013-12-11 重庆邮电大学 Path planning method of moving robot under dynamic and complicated environment
CN103605368A (en) * 2013-12-04 2014-02-26 苏州大学张家港工业技术研究院 Method and device for route programming in dynamic unknown environment
CN104950883A (en) * 2015-05-14 2015-09-30 西安电子科技大学 Mobile robot route planning method based on distance grid map

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
赵慧南 等: "基于二分搜索的牛耕式全覆盖规划算法研究", 《计算机工程与应用》 *
陈光明 等: "一种动态窗口下改进的机器人路径规划", 《计算机工程与应用》 *

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106197421B (en) * 2016-06-24 2019-03-22 北京工业大学 A kind of forward position target point generation method independently explored for mobile robot
CN106197421A (en) * 2016-06-24 2016-12-07 北京工业大学 A kind of forward position impact point for moving robot autonomous exploration generates method
CN106647769A (en) * 2017-01-19 2017-05-10 厦门大学 AGV path tracking and obstacle avoiding coordination method based on A* extraction guide point
CN106647769B (en) * 2017-01-19 2019-05-24 厦门大学 Based on A*Extract AGV path trace and the avoidance coordination approach of pilot point
CN107247463A (en) * 2017-06-08 2017-10-13 广东容祺智能科技有限公司 A kind of unmanned aerial vehicle station system for supporting self-defined map to access
CN108469814A (en) * 2018-02-08 2018-08-31 广东雷洋智能科技股份有限公司 Path cruise method applied to home-services robot
CN108709562B (en) * 2018-04-28 2020-07-03 北京机械设备研究所 Method for constructing rolling grid map of mobile robot
CN108709562A (en) * 2018-04-28 2018-10-26 北京机械设备研究所 A kind of mobile robot rolling grating map construction method
CN108663063A (en) * 2018-05-09 2018-10-16 宁波拓邦智能控制有限公司 Overlay path planing method, device, equipment, computer installation and storage medium
CN108663063B (en) * 2018-05-09 2021-11-16 宁波拓邦智能控制有限公司 Overlay path planning method, device, equipment, computer device and storage medium
CN108981710A (en) * 2018-08-07 2018-12-11 北京邮电大学 A kind of complete coverage path planning method of mobile robot
CN108981710B (en) * 2018-08-07 2019-10-11 北京邮电大学 A kind of complete coverage path planning method of mobile robot
CN109085836A (en) * 2018-08-29 2018-12-25 深圳市浦硕科技有限公司 A kind of method that sweeping robot returns designated position minimal path
CN109947114A (en) * 2019-04-12 2019-06-28 南京华捷艾米软件科技有限公司 Robot complete coverage path planning method, device and equipment based on grating map
CN109947114B (en) * 2019-04-12 2022-03-15 南京华捷艾米软件科技有限公司 Robot full-coverage path planning method, device and equipment based on grid map
CN112486182A (en) * 2020-12-08 2021-03-12 南通大学 Sweeping robot for realizing construction of unknown environment map and path planning and use method thereof
CN112486182B (en) * 2020-12-08 2022-12-02 南通大学 Sweeping robot for realizing unknown environment map construction and path planning and use method thereof
CN113534820A (en) * 2021-09-14 2021-10-22 深圳市元鼎智能创新有限公司 Method and device for motion obstacle avoidance and route control of sweeping robot and sweeping robot
CN113534820B (en) * 2021-09-14 2021-12-14 深圳市元鼎智能创新有限公司 Method and device for motion obstacle avoidance and route control of sweeping robot and sweeping robot

Similar Documents

Publication Publication Date Title
CN105320134A (en) Path planning method for robot to independently build indoor map
CN110689622B (en) Synchronous positioning and composition method based on point cloud segmentation matching closed-loop correction
CN107356252B (en) Indoor robot positioning method integrating visual odometer and physical odometer
CN105115497B (en) A kind of reliable indoor mobile robot precision navigation positioning system and method
CN103064416B (en) Crusing robot indoor and outdoor autonomous navigation system
CN105116899B (en) Distributed Multi Mobile Robots Formation's control method based on ESO
CN109059924A (en) Adjoint robot Incremental Route method and system for planning based on A* algorithm
CN102541057B (en) Moving robot obstacle avoiding method based on laser range finder
KR101286135B1 (en) Autonomous topological mapping method of medium-large size space using upward single camera
CN102494685B (en) H infinity information fusion method for WSN (Wireless Sensors Network)/INS (Inertial Navigation System) high-precision real-time combination and navigation
CN106405605A (en) Robot indoor and outdoor seamless positioning method and system based on ROS and GPS
CN107305384A (en) The method and robot of a kind of automatic obstacle-avoiding
CN112525197B (en) Ultra-wideband inertial navigation fusion pose estimation method based on graph optimization algorithm
CN106774425A (en) A kind of method and system of unmanned plane during flying navigation
Gao et al. Multi-mobile robot autonomous navigation system for intelligent logistics
Choi et al. Efficient simultaneous localization and mapping based on ceiling-view: ceiling boundary feature map approach
Liu et al. Evasion of a team of dubins vehicles from a hidden pursuer
WO2022111723A1 (en) Road edge detection method and robot
Gao et al. Localization of mobile robot based on multi-sensor fusion
Mozamir et al. Indoor localization estimation techniques in wireless sensor network: A review
Akiyama et al. Pedestrian dead reckoning using adaptive particle filter to human moving mode
CN116698043A (en) Visual navigation method for indoor mobile robot
Zhu Binocular vision-slam using improved sift algorithm
CN115268461A (en) Mobile robot autonomous navigation method with fusion algorithm
Tian The research into methods of map building and path planning on mobile robots

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20160210

WD01 Invention patent application deemed withdrawn after publication