基于旅行时变最大熵逆强化学习的海鸟轨迹预测

Tsubasa Hirakawa, Takayoshi Yamashita, K. Yoda, Toru Tamaki, H. Fujiyoshi
{"title":"基于旅行时变最大熵逆强化学习的海鸟轨迹预测","authors":"Tsubasa Hirakawa, Takayoshi Yamashita, K. Yoda, Toru Tamaki, H. Fujiyoshi","doi":"10.1109/ACPR.2017.20","DOIUrl":null,"url":null,"abstract":"Trajectory prediction is a challenging problem in the fields of computer vision, robotics, and machine learning, and a number of methods for trajectory prediction have been proposed. Most methods generate trajectories that move toward a goal in a straight line (goal-directed) while avoiding obstacles. However, there are not only such goal-directed trajectories but also trajectories that taking detours to reach the goal (non-goal-directed). In this paper, we propose a method of predicting such non-goal-directed trajectories based on the maximum entropy inverse reinforcement learning framework. Our method introduces travel time as a state of the Markov decision process. As a practical example, we apply the proposed method to seabird trajectories measured using global positioning system loggers. Experimental results show that the proposed method can effectively predict non-goal-directed trajectories.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Travel Time-Dependent Maximum Entropy Inverse Reinforcement Learning for Seabird Trajectory Prediction\",\"authors\":\"Tsubasa Hirakawa, Takayoshi Yamashita, K. Yoda, Toru Tamaki, H. Fujiyoshi\",\"doi\":\"10.1109/ACPR.2017.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Trajectory prediction is a challenging problem in the fields of computer vision, robotics, and machine learning, and a number of methods for trajectory prediction have been proposed. Most methods generate trajectories that move toward a goal in a straight line (goal-directed) while avoiding obstacles. However, there are not only such goal-directed trajectories but also trajectories that taking detours to reach the goal (non-goal-directed). In this paper, we propose a method of predicting such non-goal-directed trajectories based on the maximum entropy inverse reinforcement learning framework. Our method introduces travel time as a state of the Markov decision process. As a practical example, we apply the proposed method to seabird trajectories measured using global positioning system loggers. Experimental results show that the proposed method can effectively predict non-goal-directed trajectories.\",\"PeriodicalId\":426561,\"journal\":{\"name\":\"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACPR.2017.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2017.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

轨迹预测是计算机视觉、机器人技术和机器学习领域的一个具有挑战性的问题,目前已经提出了许多轨迹预测的方法。大多数方法生成的轨迹是在避开障碍的情况下沿直线(目标导向)向目标移动。然而,不仅有这样的目标导向轨迹,也有绕路达到目标的轨迹(非目标导向)。在本文中,我们提出了一种基于最大熵逆强化学习框架的非目标导向轨迹预测方法。我们的方法引入了旅行时间作为马尔可夫决策过程的一种状态。作为一个实例,我们将该方法应用于全球定位系统记录器测量的海鸟轨迹。实验结果表明,该方法可以有效地预测非目标轨迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Travel Time-Dependent Maximum Entropy Inverse Reinforcement Learning for Seabird Trajectory Prediction
Trajectory prediction is a challenging problem in the fields of computer vision, robotics, and machine learning, and a number of methods for trajectory prediction have been proposed. Most methods generate trajectories that move toward a goal in a straight line (goal-directed) while avoiding obstacles. However, there are not only such goal-directed trajectories but also trajectories that taking detours to reach the goal (non-goal-directed). In this paper, we propose a method of predicting such non-goal-directed trajectories based on the maximum entropy inverse reinforcement learning framework. Our method introduces travel time as a state of the Markov decision process. As a practical example, we apply the proposed method to seabird trajectories measured using global positioning system loggers. Experimental results show that the proposed method can effectively predict non-goal-directed trajectories.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信