{"title":"Autonomous navigation and exploration in a rescue environment","authors":"D. Calisi, A. Farinelli, L. Iocchi, D. Nardi","doi":"10.1109/SSRR.2005.1501268","DOIUrl":null,"url":null,"abstract":"We present an approach Io autonomous exploration of a rescue environment. Exploration is based on unexplored frontiers and navigation on a two-level approach to the robot motion problem. Our method makes use of a motion planner capable of negotiating with very fine representations of the environment, that is used to move in a cluttered scenario. A topological path-planner \"guides\" the lower level and reduces the search space. The two algorithms are derived from two widely-used probabilistic algorithms, currently successfully deployed in many robot applications, the probabilistic roadmap and the rapid-exploring random trees. However, their adaptation to the rescue scenario requires significant extensions.","PeriodicalId":173715,"journal":{"name":"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"56","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Safety, Security and Rescue Rototics, Workshop, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSRR.2005.1501268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 56
Abstract
We present an approach Io autonomous exploration of a rescue environment. Exploration is based on unexplored frontiers and navigation on a two-level approach to the robot motion problem. Our method makes use of a motion planner capable of negotiating with very fine representations of the environment, that is used to move in a cluttered scenario. A topological path-planner "guides" the lower level and reduces the search space. The two algorithms are derived from two widely-used probabilistic algorithms, currently successfully deployed in many robot applications, the probabilistic roadmap and the rapid-exploring random trees. However, their adaptation to the rescue scenario requires significant extensions.