Bethany R. Leffler, M. Littman, Alexander L. Strehl, Thomas J. Walsh
{"title":"利用潜在结构进行高效勘探","authors":"Bethany R. Leffler, M. Littman, Alexander L. Strehl, Thomas J. Walsh","doi":"10.15607/RSS.2005.I.011","DOIUrl":null,"url":null,"abstract":"When interacting with a new environment, a robot can improve its online performance by efficiently exploring the effects of its actions. The efficiency of exploration can be expanded significantly by modeling and using latent structure to generalize experiences. We provide a theoretical development of the problem of exploration with latent structure, analyze several algorithms and prove matching lower bounds. We demonstrate our algorithmic ideas on a simple robot car repeatedly traversing a path with two different surface properties.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"11 1","pages":"81-88"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Efficient Exploration With Latent Structure\",\"authors\":\"Bethany R. Leffler, M. Littman, Alexander L. Strehl, Thomas J. Walsh\",\"doi\":\"10.15607/RSS.2005.I.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When interacting with a new environment, a robot can improve its online performance by efficiently exploring the effects of its actions. The efficiency of exploration can be expanded significantly by modeling and using latent structure to generalize experiences. We provide a theoretical development of the problem of exploration with latent structure, analyze several algorithms and prove matching lower bounds. We demonstrate our algorithmic ideas on a simple robot car repeatedly traversing a path with two different surface properties.\",\"PeriodicalId\":87357,\"journal\":{\"name\":\"Robotics science and systems : online proceedings\",\"volume\":\"11 1\",\"pages\":\"81-88\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics science and systems : online proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15607/RSS.2005.I.011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
When interacting with a new environment, a robot can improve its online performance by efficiently exploring the effects of its actions. The efficiency of exploration can be expanded significantly by modeling and using latent structure to generalize experiences. We provide a theoretical development of the problem of exploration with latent structure, analyze several algorithms and prove matching lower bounds. We demonstrate our algorithmic ideas on a simple robot car repeatedly traversing a path with two different surface properties.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
