首页 /研究 /Information-lookahead planning for AUV mapping
OTHER

Information-lookahead planning for AUV mapping

Zeyn Saigol, Richard Dearden, Jeremy Wyatt, Bramley J. Murton

发表年份
2009
引用次数
10

摘要

Exploration for robotic mapping is typically handled using greedy entropy reduction. Here we show how to apply information lookahead planning to a challenging instance of this problem in which an Autonomous Underwater Vehicle (AUV) maps hydrothermal vents. Given a simulation of vent behaviour we derive an observation function to turn the planning for mapping problem into a POMDP. We test a variety of information state MDP algorithms against greedy, systematic and reactive search strategies. We show that directly rewarding the AUV for visiting vents induces effective mapping strategies. We evaluate the algorithms in simulation and show that our information lookahead method outperforms the others. 1

关键词

Computer scienceMotion planningGreedy algorithmEntropy (arrow of time)Remotely operated underwater vehicleVariety (cybernetics)Mathematical optimizationArtificial intelligenceRobotAlgorithm

相关论文

查看 OTHER 分类全部论文