Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/31255
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim J | - |
dc.contributor.author | Bonadies S | - |
dc.contributor.author | Lee A | - |
dc.contributor.author | Gadsden SA | - |
dc.date.accessioned | 2025-03-01T15:47:21Z | - |
dc.date.available | 2025-03-01T15:47:21Z | - |
dc.date.issued | 2017-10-01 | - |
dc.identifier.uri | http://hdl.handle.net/11375/31255 | - |
dc.description.abstract | This paper proposes a cooperative robot exploration (CREI strategy which is based on the sensor-based random tree (SKT) method. The proposed CRE strategy is for exploring unknown environments with a team of mobile robots equipped with range finder sensors. An existing backtracking technique for frontier-based exploration involves moving back through inefficient routes. To enhance the efficiency of the backtracking algorithm, a hub node is defined and the most direct backtracking route is generated using its frontier data. Numerical simulations demonstrate that the proposed strategy enables exploration of unknown environments by robots more efficiently than other common methods. | - |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | - |
dc.subject | 4605 Data Management and Data Science | - |
dc.subject | 46 Information and Computing Sciences | - |
dc.subject | 40 Engineering | - |
dc.subject | 4602 Artificial Intelligence | - |
dc.title | A Cooperative Exploration Strategy with Efficient Backtracking for Mobile Robots | - |
dc.type | Article | - |
dc.date.updated | 2025-03-01T15:47:17Z | - |
dc.contributor.department | Mechanical Engineering | - |
dc.identifier.doi | https://doi.org/10.1109/iris.2017.8250106 | - |
Appears in Collections: | Mechanical Engineering Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
066-gadsden_conf_066.pdf | Published version | 1.1 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.