H. Choset, Ercan U. Acar, Yangang Zhang, M. Schervish
{"title":"Sensor-Based Coverage for Demining: Exact Cellular Decompositions and Uncertain Detectors","authors":"H. Choset, Ercan U. Acar, Yangang Zhang, M. Schervish","doi":"10.1115/imece2001/dsc-24637","DOIUrl":null,"url":null,"abstract":"\n Coverage path planning is the determination of a path that a robot must take in order to pass itself, a detector, or some other effector over each point in an environment. Applications include demining, floor scrubbing, and inspection. In previous work, we developed the boustrophedon cellular decomposition, an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon decomposition is covered with simple back and forth motions. Therefore, coverage is reduced to finding an exhaustive path through a graph that represents the adjacency relationships of the cells in the boustrophedon decomposition. Such a path will ensure that a detector passes over all points in the environment, but it does not guarantee that all ordnance is indeed detected because mine detectors have error. Therefore, we also consider probabilistic methods to determine paths for the robot to maximize the likelihood of detecting all ordnance in a target location using a priori known information.","PeriodicalId":90691,"journal":{"name":"Proceedings of the ASME Dynamic Systems and Control Conference. ASME Dynamic Systems and Control Conference","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2001-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ASME Dynamic Systems and Control Conference. ASME Dynamic Systems and Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1115/imece2001/dsc-24637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Coverage path planning is the determination of a path that a robot must take in order to pass itself, a detector, or some other effector over each point in an environment. Applications include demining, floor scrubbing, and inspection. In previous work, we developed the boustrophedon cellular decomposition, an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon decomposition is covered with simple back and forth motions. Therefore, coverage is reduced to finding an exhaustive path through a graph that represents the adjacency relationships of the cells in the boustrophedon decomposition. Such a path will ensure that a detector passes over all points in the environment, but it does not guarantee that all ordnance is indeed detected because mine detectors have error. Therefore, we also consider probabilistic methods to determine paths for the robot to maximize the likelihood of detecting all ordnance in a target location using a priori known information.