CN112828883A - Robot environment exploration method and system in unknown environment - Google Patents

Robot environment exploration method and system in unknown environment Download PDF

Info

Publication number
CN112828883A
CN112828883A CN202011564261.8A CN202011564261A CN112828883A CN 112828883 A CN112828883 A CN 112828883A CN 202011564261 A CN202011564261 A CN 202011564261A CN 112828883 A CN112828883 A CN 112828883A
Authority
CN
China
Prior art keywords
environment
robot
topological
entropy
exploration
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.)
Granted
Application number
CN202011564261.8A
Other languages
Chinese (zh)
Other versions
CN112828883B (en
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.)
Shenzhen Research Institute of CUHK
Original Assignee
Shenzhen Research Institute of CUHK
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 Shenzhen Research Institute of CUHK filed Critical Shenzhen Research Institute of CUHK
Priority to CN202011564261.8A priority Critical patent/CN112828883B/en
Publication of CN112828883A publication Critical patent/CN112828883A/en
Application granted granted Critical
Publication of CN112828883B publication Critical patent/CN112828883B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B25HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25JMANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00Programme-controlled manipulators
    • B25J9/16Programme controls
    • B25J9/1602Programme controls characterised by the control system, structure, architecture
    • B25J9/1605Simulation of manipulator lay-out, design, modelling of manipulator
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B25HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25JMANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00Programme-controlled manipulators
    • B25J9/16Programme controls
    • B25J9/1602Programme controls characterised by the control system, structure, architecture
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B25HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25JMANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00Programme-controlled manipulators
    • B25J9/16Programme controls
    • B25J9/1656Programme controls characterised by programming, planning systems for manipulators
    • B25J9/1664Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning

Abstract

The invention discloses a robot environment exploration method and system in an unknown environment, wherein the method comprises the following steps: s1, modeling environmental point cloud expression; s2, constructing a topological map in a sensing visual range; s3, evaluating the search result gain under the expression of a topological map: namely, information gain evaluation under topological environment expression; and S4, motion decision based on information gain and planning path length. The invention can enable the mobile robot to efficiently and accurately collect information and realize environment exploration and modeling. The method can be widely applied to environment exploration modeling and monitoring tasks based on the mobile robot, and has wide potential application prospect in a plurality of scenes such as disaster relief, home service and the like.

Description

Robot environment exploration method and system in unknown environment
Technical Field
The invention relates to the technical field of autonomous navigation of mobile robots, in particular to a method and a system for exploring and modeling an autonomous environment of a mobile robot.
Background
Mobile robots are increasingly used for tasks related to information collection, such as environmental monitoring and surveillance tasks. In the process, the robot can automatically collect the environmental information, so that the robot can be used for potential subsequent applications. At present, most monitoring robots collect information according to preset routes, and the method has low efficiency and cannot automatically and flexibly adapt to requirements according to environments.
In recent years, autonomous information collection algorithms based on mobile robots and related applications have been developed. However, the efficiency of path planning and the effectiveness of motion control decisions during exploration still remain to be improved. How to achieve environment modeling and monitoring with less time and less energy consumption to obtain more information is a long-sought goal of the research and related applications.
Disclosure of Invention
In order to make up for the defects of the prior art, the invention provides a robot environment exploration method in an unknown environment, and the exploration on the environment is rapidly and accurately completed.
Therefore, the robot environment exploration method under the unknown environment provided by the invention comprises the following steps: s1, environmental point cloud expression modeling: constructing a point cloud topological environment expression under the incremental environment point cloud model for the established incremental environment point cloud model; s2, constructing a topological map in a sensing visual range: based on the point cloud topological environment expression, constructing a topological map expression, namely: establishing a topologically expressed path diagram along with the detection process in the visual range of a sensor carried by the robot; s3, evaluating the search result gain under the expression of a topological map: namely, information gain evaluation under topological environment expression; s4, motion decision based on information gain and planning path length: the method comprises the steps of exploring target point decision generation and motion planning, and after an information gain value of a planned exploring position is obtained, motion planning decision is made based on the information gain and the motion cost of reaching the target point.
In some embodiments, the following features are also included:
in step S2, a spatial position random point is generated within the sensor range. Connecting the random points based on a space barrier-free connection criterion, thereby constructing a topological graph structure of a complex environment to be explored; the graph structure is composed of generated spatially random nodes and inter-node connecting edges.
In step S3, the information gain of each generated node takes the degree of information entropy change as an evaluation criterion.
The entropy of the existing model of the environment is calculated according to a Shannon entropy formula, and the conditional entropy under the observation condition corresponding to the estimated exploration position and the position is calculated at the same time, so that the difference between the entropy of the existing model and the calculated conditional entropy is calculated, and the difference is used as an information gain value of the estimated exploration plan.
In step S4, the movement cost is measured by taking the distance between the current position and the target position of the robot as a metric, and the topological topography map constructed in step S2 prevents the robot from searching for a path in the whole space, thereby improving the efficiency of path search.
In planning decision, the maximum information gain and the minimum distance are used as optimization objective functions, the maximum information gain and the minimum distance are linearly superposed, coefficients of the linear superposition are determined through debugging in different environments, and positions to be explored are searched from topological nodes to optimize a cost function, so that the robot environment is independently explored.
Step S2 specifically includes: generating space position random points in a sensor range, randomly acquiring some points in the space to obtain space random position points, and connecting the random points based on a space barrier-free connection criterion to construct a topological graph structure for exploring a complex environment, wherein the topological graph structure is composed of generated space random nodes and connecting edges among the nodes.
Step S3 specifically includes: firstly, calculating the entropy Encopy (i) of the existing model of the environment according to a Shannon entropy formula; the position i of each point cloud in the environment has a certain occupation probability p, the Entropy of the map can obtain Encopy (i) through a Shannon formula, the conditional Entropy Encopy (i, x) under the condition of observation obtained under the estimated exploration position and the corresponding position is calculated, x is the position expected to be explored, the difference between the Entropy of the existing model and the calculated conditional Entropy is calculated, and the difference is used as an information gain value of the estimated exploration plan
I=Entropy(i)-Entropy(i,x)。
Step S4 specifically includes: obtaining the motion cost by inquiring a topological road map, wherein the motion cost takes the distance between the current position and the target position of the robot as a measurement standard; inquiring on the topological road map to find a route from the current position of the robot to a target point, and obtaining a line segment consisting of a plurality of nodes and line segments, wherein the length of the line segment is the movement cost from the current position of the robot to the target position and is marked as tau; in planning decision, the position to be explored is searched from the topological nodes by taking the maximum information gain and the minimum distance as optimization objective functions to optimize a cost function cost ═ Ie ^ (lambda tau), wherein lambda is an adjustable coefficient, so that the robot environment autonomous exploration is realized.
The invention also provides a robot environment exploration system in an unknown environment, and the robot environment exploration method is adopted.
Compared with the prior art, the invention has the advantages that:
according to the technical scheme, the robot is helped to quickly judge the target point by combining the information gain of the map constructed in the exploration process and the path length from the robot to each decision point, so that the exploration on the environment is quickly and accurately completed.
The topological road map provided by the invention can help the robot to rapidly plan a path in space. By effectively evaluating the length of the planned path and the obtained information, the efficient implementation of exploration motion planning is realized. And further, by utilizing the motion planning result, the environment exploration efficiency and the high-precision real-time operation of environment modeling are realized. Meanwhile, the method is tested in different environments, and the result shows that the method has better performance compared with the existing method.
The invention can assist the robot to quickly complete the construction of the unknown environment, thereby assisting the robot in navigation in the unknown environment, and simultaneously, quickly and accurately providing effective information in the unknown environment for the human, so that the invention can be widely applied to environment exploration modeling and monitoring tasks based on the mobile robot, and has wide potential application prospect in a plurality of scenes such as disaster relief, home service and the like.
Drawings
FIG. 1 is a schematic flow diagram of a system according to an embodiment of the present invention;
FIG. 2a is an environmental diagram of an embodiment of the present invention in practice;
FIG. 2b is an environmental point cloud MAP constructed by RTAB-MAP according to an embodiment of the present invention;
fig. 3a and fig. 3b are schematic diagrams illustrating a topology node environment expression construction provided in an embodiment of the present application;
FIG. 4a is experimental verification test experimental hardware, including a quad-rotor drone platform, of an embodiment of the present invention;
FIG. 4b is an experimental test scenario of an embodiment of the present invention;
FIG. 4c is an exploration process and environmental modeling results implemented with the method of an embodiment of the present invention.
Detailed Description
The following further describes the embodiments of the present invention with reference to the drawings and preferred embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
It should be noted that the terms of orientation such as left, right, up, down, top and bottom in the present embodiment are only relative concepts to each other or are referred to the normal use state of the product, and should not be considered as limiting.
The embodiment of the invention aims to develop an autonomous exploration strategy based on a road map, so that a mobile robot can efficiently and accurately collect information and realize environment exploration and modeling.
The technical problems to be solved include:
(1) the problems of information collection and environment exploration in a complex environment are solved;
(2) solving the problems of path planning and information gain evaluation and providing information gain evaluation quantitative indexes;
(3) the problem of exploration visual angle planning in the autonomous exploration process of the mobile robot is solved;
the technical problem of the embodiment is solved by the following technical scheme:
in the present embodiment, the planned path length and the collected environment information are considered in the environment exploration algorithm of the present embodiment.
Firstly, the algorithm is used for establishing a topological route map of the incremental environment point cloud model in the exploration process. The incremental point cloud model is generated by an existing depth camera based composition modeling algorithm (RTAB-MAP). And constructing a topological environment expression under the model based on the established environment point cloud model.
And secondly, constructing a topological map expression based on the existing point cloud environment expression. And establishing a path diagram of topological expression along with the detection process in the visual range of the sensor carried by the robot. In this process, spatially positioned random points are first generated within the sensor range. And connecting the random points based on a space barrier-free connection criterion, thereby constructing a topological graph structure of complex environment to be explored. The graph structure is composed of generated spatially random nodes and inter-node connecting edges. In the subsequent information gain evaluation, the node is used as a unit for development, so that the calculation cost of the system is reduced, and the real-time performance of the system is improved.
And thirdly, evaluating information gain under the topological environment expression. In this embodiment, the information gain of each generated node takes the degree of information entropy change as an evaluation criterion. Specifically, the present embodiment first calculates the entropy of the existing model of the environment according to the shannon entropy formula, and simultaneously calculates the conditional entropy under the estimated exploration position and the corresponding obtained observation condition under the position. Thereby calculating the difference between the existing model entropy and the calculated conditional entropy. And the difference is used as the information gain value of the evaluated exploration plan.
And fourthly, exploring target point decision generation and motion planning. And after the information gain value of the planned exploration position is obtained, performing motion planning decision based on the information gain and the motion cost of reaching the target point. The motion cost is measured by the distance between the current position of the robot and the target position. The topological topographic map constructed in the second step prevents the robot from searching paths in the whole space, and the efficiency of path searching is improved. In planning decision, the maximum information gain and the minimum distance are used as optimization objective functions, the maximum information gain and the minimum distance are linearly superposed, coefficients of the linear superposition are determined through debugging in different environments, and positions to be explored are searched from topological nodes to optimize a cost function, so that the robot environment is independently explored.
Fig. 1 is a flow chart of the system of this embodiment, and in this block diagram, the following steps are included:
in step S1, an environment model is first constructed based on the depth vision camera by the existing RTAB-MAP algorithm. The model has large storage data volume but rich information. And utilizing the initial point cloud expression of the environment obtained by the exploration to provide input for a subsequent algorithm.
As shown in fig. 2a and 2b, fig. 2a shows an actual environment MAP, and fig. 2b shows an environment point cloud MAP constructed by RTAB-MAP. The point cloud map is a discretized representation of a complex spatial environment.
And step S2, constructing a topological node map corresponding to the model by using the established environment point cloud model. And establishing a path diagram of topological expression along with the detection process in the visual range of the sensor carried by the robot. In this process, first, a random point of spatial position is generated within the sensor range, which is the range that can be sensed by the sensor, as shown in fig. 3 a. And randomly taking some points in the space to obtain spatial random position points. And connecting the random points based on a space barrier-free connection criterion (the space barrier-free criterion is that for a connecting line between any two points in the space, if the position of each point on the connecting line is not coincident with the position of a barrier in the space, the connecting line is considered to be barrier-free), thereby constructing a topological graph structure of the complex environment to be explored, as shown in fig. 3b, black points represent points obtained by random sampling, black connecting lines are barrier-free, and the points and lines form a topological graph in the space. The graph structure is composed of generated spatially random nodes and inter-node connecting edges. In the subsequent information gain evaluation, the node is used as a unit for development, so that the calculation cost of the system is reduced, and the real-time performance of the system is improved.
And step S3, evaluating the information gain under the topological environment expression. In this embodiment, the information gain of each generated node takes the degree of information entropy change as an evaluation criterion. Specifically, the present embodiment first calculates the entropy of the existing model of the environment according to the shannon entropy formula. The position i of each point cloud in the environment has a certain occupation probability p, the Entropy of the map can obtain control (i) through shannon formula, and the conditional Entropy of the estimated exploration position and the corresponding obtained observation condition of the position is simultaneously calculated, wherein x is the position expected to be explored. Thereby calculating the difference between the existing model entropy and the calculated conditional entropy. And the difference is used as the information gain value I ═ control (I) -control (I, x) for the evaluated exploration plan.
Step S4, exploration target point decision generation and movement planning. And after the information gain value of the planned exploration position is obtained, performing motion planning decision based on the information gain and the motion cost of reaching the target point. The movement cost takes the distance between the current position and the target position of the robot as a measurement standard, and the movement cost can be obtained by inquiring a topological road map. As can be seen from fig. 3b, in order to find a route from the current position of the robot to the target point, a line segment composed of a plurality of nodes and line segments can be directly queried on the topological road map, and the length of the line segment is the movement cost from the current position of the robot to the target position, which is labeled as τ. In planning decision, the position to be explored is searched from the topological nodes by taking the maximum information gain and the minimum distance as optimization objective functions to optimize a cost function cost ═ Ie ^ (lambda tau), wherein lambda is an adjustable coefficient, so that the robot environment autonomous exploration is realized.
Fig. 3a and 3b are schematic diagrams of environment expression and construction of the topology node according to this embodiment.
In fig. 3a and 3b, r1 and r2 are the visible range parameters of the sensor mounted on the mobile robot, and these two parameters determine the range of the environment that the mobile robot can sense. The cylinder is illustrated as an obstacle (obsacle) that expresses the obstacle encountered during planning in this space. In fig. 2a, the identified light purple cone space is the perception space (sensor scope) of the robot, and the dotted line is the sensor visual line schematic (sensor beam).
In fig. 3b, nodes (nodes) are random nodes generated in the sensing space, and an edge (edge) is established between the nodes by using accessible and barrier-free judgment. The reachability is judged whether the straight line connection between the two nodes passes through the barrier: if not, judging that the connection is feasible; if so, the connection is judged to be not feasible. Therefore, a topological map is established in the perception space, and subsequent information gain calculation and motion planning decision based on the nodes are realized.
4a, 4b, 4c, example of the results of the test experiments of the present algorithm
Fig. 4a is the present algorithm test experiment hardware, including a quad-rotor drone platform. A drone onboard computer (Raspberry Pi), a drone motion controller (Pixhawk), and a drone onboard depth vision sensor (RealSense).
Fig. 4b is an experimental test scenario, which includes a limited exploration space formed by the ceiling and surrounding walls, and exploration process obstacles formed by pillars.
Fig. 4c shows the exploration process and the environment modeling result of the algorithm. Wherein the exploration path starting point (Start) and ending point (End) are identified in yellow. The red line is the explored planned path obtained by the algorithm of the embodiment. And the model formed by the small blocks is an environment model obtained by exploring and constructing the robot.
Compared with the traditional method, the modeling method can obviously improve the mapping efficiency and the mapping precision. Importantly, in the process of drawing construction, the method does not need to traverse the whole environment to obtain an exploration path, and only needs to query a topological road map to obtain a path from the position of the robot to the target position, so that the target node can be quickly evaluated, the decision making effectiveness is improved, more information can be obtained by using shorter energy, and the environment can be quickly and effectively monitored.
The above description is a detailed description of the present embodiment with reference to specific preferred embodiments, and it should not be construed that the specific implementations of the present embodiment are limited to these descriptions. For those skilled in the art to which the embodiment belongs, several equivalent substitutions or obvious modifications can be made without departing from the concept of the embodiment, and the same performance or purpose should be considered as belonging to the protection scope of the embodiment.

Claims (10)

1. A robot environment exploration method under an unknown environment is characterized by comprising the following steps:
s1, environmental point cloud expression modeling: constructing a point cloud topological environment expression under the incremental environment point cloud model for the established incremental environment point cloud model;
s2, constructing a topological map in a sensing visual range: based on the point cloud topological environment expression, constructing a topological map expression, namely: establishing a topologically expressed path diagram along with the detection process in the visual range of a sensor carried by the robot;
s3, evaluating the search result gain under the expression of a topological map: namely, information gain evaluation under topological environment expression;
s4, motion decision based on information gain and planning path length: the method comprises the steps of exploring target point decision generation and motion planning, and after an information gain value of a planned exploring position is obtained, motion planning decision is made based on the information gain and the motion cost of reaching the target point.
2. The robot environment exploring method according to claim 1, wherein: in step S2, a spatial position random point is generated within the sensor range. Connecting the random points based on a space barrier-free connection criterion, thereby constructing a topological graph structure of a complex environment to be explored; the graph structure is composed of generated spatially random nodes and inter-node connecting edges.
3. The robot environment exploring method according to claim 1, wherein: in step S3, the information gain of each generated node takes the degree of information entropy change as an evaluation criterion.
4. The robot environment exploring method according to claim 3, wherein: the entropy of the existing model of the environment is calculated according to a Shannon entropy formula, and the conditional entropy under the observation condition corresponding to the estimated exploration position and the position is calculated at the same time, so that the difference between the entropy of the existing model and the calculated conditional entropy is calculated, and the difference is used as an information gain value of the estimated exploration plan.
5. The robot environment exploring method according to claim 1, wherein: in step S4, the movement cost is measured by taking the distance between the current position and the target position of the robot as a metric, and the topological topography map constructed in step S2 prevents the robot from searching for a path in the whole space, thereby improving the efficiency of path search.
6. The robot environment exploring method according to claim 5, wherein: in planning decision, the maximum information gain and the minimum distance are used as optimization objective functions, the maximum information gain and the minimum distance are linearly superposed, coefficients of the linear superposition are determined through debugging in different environments, and positions to be explored are searched from topological nodes to optimize a cost function, so that the robot environment is independently explored.
7. The robot environment exploring method according to claim 2, wherein: step S2 specifically includes: generating space position random points in a sensor range, randomly acquiring some points in the space to obtain space random position points, and connecting the random points based on a space barrier-free connection criterion to construct a topological graph structure for exploring a complex environment, wherein the topological graph structure is composed of generated space random nodes and connecting edges among the nodes.
8. The robot environment exploring method according to claim 2, wherein: step S3 specifically includes: firstly, calculating the entropy Encopy (i) of the existing model of the environment according to a Shannon entropy formula; the position i of each point cloud in the environment has a certain occupation probability p, the Entropy of the map can obtain Encopy (i) through a Shannon formula, the conditional Entropy Encopy (i, x) under the condition of observation obtained under the estimated exploration position and the corresponding position is calculated, x is the position expected to be explored, the difference between the Entropy of the existing model and the calculated conditional Entropy is calculated, and the difference is used as an information gain value of the estimated exploration plan
I=Entropy(i)-Entropy(i,x)。
9. The robot environment exploring method according to claim 5, wherein: step S4 specifically includes:
obtaining the motion cost by inquiring a topological road map, wherein the motion cost takes the distance between the current position and the target position of the robot as a measurement standard;
inquiring on the topological road map to find a route from the current position of the robot to a target point, and obtaining a line segment consisting of a plurality of nodes and line segments, wherein the length of the line segment is the movement cost from the current position of the robot to the target position and is marked as tau;
in planning decision, the position to be explored is searched from the topological nodes by taking the maximum information gain and the minimum distance as optimization objective functions to optimize a cost function cost ═ Ie ^ (lambda tau), wherein lambda is an adjustable coefficient, so that the robot environment autonomous exploration is realized.
10. A robot environment exploration system in an unknown environment, characterized in that: a method for exploring the environment of a robot according to claims 1-9.
CN202011564261.8A 2020-12-25 2020-12-25 Robot environment exploration method and system in unknown environment Active CN112828883B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011564261.8A CN112828883B (en) 2020-12-25 2020-12-25 Robot environment exploration method and system in unknown environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011564261.8A CN112828883B (en) 2020-12-25 2020-12-25 Robot environment exploration method and system in unknown environment

Publications (2)

Publication Number Publication Date
CN112828883A true CN112828883A (en) 2021-05-25
CN112828883B CN112828883B (en) 2022-07-01

Family

ID=75925020

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011564261.8A Active CN112828883B (en) 2020-12-25 2020-12-25 Robot environment exploration method and system in unknown environment

Country Status (1)

Country Link
CN (1) CN112828883B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113359796A (en) * 2021-06-08 2021-09-07 同济大学 Unmanned aerial vehicle searching method for underground multi-branch cave
CN114131610A (en) * 2021-12-15 2022-03-04 深圳亿嘉和科技研发有限公司 Human behavior recognition perception-based robot man-machine action interaction system and method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100070078A1 (en) * 2008-09-16 2010-03-18 Samsung Electronics Co., Ltd. Apparatus and method for building map
CN107037812A (en) * 2017-03-31 2017-08-11 南京理工大学 A kind of vehicle path planning method based on storage unmanned vehicle
CN108592912A (en) * 2018-03-24 2018-09-28 北京工业大学 A kind of autonomous heuristic approach of indoor mobile robot based on laser radar
CN109974699A (en) * 2017-12-27 2019-07-05 深圳市优必选科技有限公司 A kind of robot and its autonomous heuristic approach of map and device
CN110274602A (en) * 2018-03-15 2019-09-24 奥孛睿斯有限责任公司 Indoor map method for auto constructing and system
CN110376594A (en) * 2018-08-17 2019-10-25 北京京东尚科信息技术有限公司 A kind of method and system of the intelligent navigation based on topological diagram
CN112033410A (en) * 2020-09-03 2020-12-04 中南大学 Mobile robot environment map construction method, system and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100070078A1 (en) * 2008-09-16 2010-03-18 Samsung Electronics Co., Ltd. Apparatus and method for building map
CN107037812A (en) * 2017-03-31 2017-08-11 南京理工大学 A kind of vehicle path planning method based on storage unmanned vehicle
CN109974699A (en) * 2017-12-27 2019-07-05 深圳市优必选科技有限公司 A kind of robot and its autonomous heuristic approach of map and device
CN110274602A (en) * 2018-03-15 2019-09-24 奥孛睿斯有限责任公司 Indoor map method for auto constructing and system
CN108592912A (en) * 2018-03-24 2018-09-28 北京工业大学 A kind of autonomous heuristic approach of indoor mobile robot based on laser radar
CN110376594A (en) * 2018-08-17 2019-10-25 北京京东尚科信息技术有限公司 A kind of method and system of the intelligent navigation based on topological diagram
CN112033410A (en) * 2020-09-03 2020-12-04 中南大学 Mobile robot environment map construction method, system and storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BRIAN J. JULIAN: "On mutual information-based control of range sensing robots for mapping applications", 《2013 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS)》 *
于宁波等: "一种基于RGB-D的移动机器人未知室内环境自主探索与地图构建方法", 《机器人》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113359796A (en) * 2021-06-08 2021-09-07 同济大学 Unmanned aerial vehicle searching method for underground multi-branch cave
CN114131610A (en) * 2021-12-15 2022-03-04 深圳亿嘉和科技研发有限公司 Human behavior recognition perception-based robot man-machine action interaction system and method
CN114131610B (en) * 2021-12-15 2023-11-10 深圳亿嘉和科技研发有限公司 Robot man-machine action interaction system and method based on human behavior recognition and perception

Also Published As

Publication number Publication date
CN112828883B (en) 2022-07-01

Similar Documents

Publication Publication Date Title
CN113110457B (en) Autonomous coverage inspection method for intelligent robot in indoor complex dynamic environment
Manikas et al. Genetic algorithms for autonomous robot navigation
KR101778028B1 (en) Robot and method for planning path of the same
CN110989352B (en) Group robot collaborative search method based on Monte Carlo tree search algorithm
CN112828883B (en) Robot environment exploration method and system in unknown environment
CN106796434A (en) Ground drawing generating method, self-position presumption method, robot system and robot
CN103984981B (en) Building environmental sensor measuring point optimization method based on Gaussian process model
US20120158176A1 (en) Swarm robot and sweeping method using swarm robot
CN112114584A (en) Global path planning method of spherical amphibious robot
CN111609848B (en) Intelligent optimization method and system for multi-robot cooperation mapping
CN114756034B (en) Robot real-time obstacle avoidance path planning method and device
Tang et al. An autonomous exploration algorithm using environment-robot interacted traversability analysis
CN114296474A (en) Unmanned aerial vehicle path planning method and system based on path time cost
EP4180895B1 (en) Autonomous mobile robots for coverage path planning
JP7014180B2 (en) Vehicle control device, vehicle control method, and vehicle control device control program
CN114879660B (en) Robot environment sensing method based on target drive
CN112857370A (en) Robot map-free navigation method based on time sequence information modeling
Jia et al. Coverage path planning for legged robots in unknown environments
Bayer et al. Decentralized topological mapping for multi-robot autonomous exploration under low-bandwidth communication
Soni et al. Multi-robot unknown area exploration using frontier trees
CN113433937A (en) Heuristic exploration-based layered navigation obstacle avoidance system and layered navigation obstacle avoidance method
CN109977455B (en) Ant colony optimization path construction method suitable for three-dimensional space with terrain obstacles
CN114596360B (en) Double-stage active real-time positioning and mapping algorithm based on graph topology
Wang et al. Application of ant colony algorithm in path planning of the data center room robot
CA3184001A1 (en) Multi-agent map generation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant