通过子图同构实现全局定位

M. Piaggio, A. Sgorbissa, R. Zaccaria
{"title":"通过子图同构实现全局定位","authors":"M. Piaggio, A. Sgorbissa, R. Zaccaria","doi":"10.1109/EURBOT.1999.827634","DOIUrl":null,"url":null,"abstract":"A novel approach to the global localisation problem for an autonomous mobile robot is presented. Instead of referring to traditional map-based techniques, we choose to extract a graph-like topological representation of the free space from occupancy grids, thus shifting the map-matching problem to a sub-graph isomorphism one. An efficient any-time algorithm is described in detail, and simulated experimental results are provided.","PeriodicalId":364500,"journal":{"name":"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Global localisation via sub-graph isomorphism\",\"authors\":\"M. Piaggio, A. Sgorbissa, R. Zaccaria\",\"doi\":\"10.1109/EURBOT.1999.827634\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel approach to the global localisation problem for an autonomous mobile robot is presented. Instead of referring to traditional map-based techniques, we choose to extract a graph-like topological representation of the free space from occupancy grids, thus shifting the map-matching problem to a sub-graph isomorphism one. An efficient any-time algorithm is described in detail, and simulated experimental results are provided.\",\"PeriodicalId\":364500,\"journal\":{\"name\":\"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURBOT.1999.827634\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Third European Workshop on Advanced Mobile Robots (Eurobot'99). Proceedings (Cat. No.99EX355)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURBOT.1999.827634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种求解自主移动机器人全局定位问题的新方法。我们没有参考传统的基于地图的技术,而是选择从占用网格中提取自由空间的类图拓扑表示,从而将地图匹配问题转化为子图同构问题。详细介绍了一种高效的任意时间算法,并给出了仿真实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Global localisation via sub-graph isomorphism
A novel approach to the global localisation problem for an autonomous mobile robot is presented. Instead of referring to traditional map-based techniques, we choose to extract a graph-like topological representation of the free space from occupancy grids, thus shifting the map-matching problem to a sub-graph isomorphism one. An efficient any-time algorithm is described in detail, and simulated experimental results are provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hierarchical decision-theoretic planning for autonomous robotic surveillance Environment modelling in a multi-agent mobile system Learning to acquire and select useful landmarks for route following Motion control of a snakelike robot Development of a visual object localization module for mobile robots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1