P. Urcola, M. T. Lázaro, J. A. Castellanos, L. Montano
{"title":"从随机地图中生成路径规划的概率图","authors":"P. Urcola, M. T. Lázaro, J. A. Castellanos, L. Montano","doi":"10.1109/ECMR.2015.7403770","DOIUrl":null,"url":null,"abstract":"This paper presents a method to automatically generate probabilistic graphs for path planning out of stochastic maps. A sample based technique is used to generate a set of paths from which a graph structure of the map is built. The nodes of the graph represent places in the map and the edges the paths between those places, which are labelled with the cost of traversing the edge and the probability of being navigable. We provide results of the proposed method using different types of stochastic maps such as feature-based maps, occupancy grid maps and pose graph maps.","PeriodicalId":142754,"journal":{"name":"2015 European Conference on Mobile Robots (ECMR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Generation of probabilistic graphs for path planning from stochastic maps\",\"authors\":\"P. Urcola, M. T. Lázaro, J. A. Castellanos, L. Montano\",\"doi\":\"10.1109/ECMR.2015.7403770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method to automatically generate probabilistic graphs for path planning out of stochastic maps. A sample based technique is used to generate a set of paths from which a graph structure of the map is built. The nodes of the graph represent places in the map and the edges the paths between those places, which are labelled with the cost of traversing the edge and the probability of being navigable. We provide results of the proposed method using different types of stochastic maps such as feature-based maps, occupancy grid maps and pose graph maps.\",\"PeriodicalId\":142754,\"journal\":{\"name\":\"2015 European Conference on Mobile Robots (ECMR)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 European Conference on Mobile Robots (ECMR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECMR.2015.7403770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 European Conference on Mobile Robots (ECMR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECMR.2015.7403770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generation of probabilistic graphs for path planning from stochastic maps
This paper presents a method to automatically generate probabilistic graphs for path planning out of stochastic maps. A sample based technique is used to generate a set of paths from which a graph structure of the map is built. The nodes of the graph represent places in the map and the edges the paths between those places, which are labelled with the cost of traversing the edge and the probability of being navigable. We provide results of the proposed method using different types of stochastic maps such as feature-based maps, occupancy grid maps and pose graph maps.